{
  "total": 14,
  "devueltos": 14,
  "total_catalogo": 74,
  "filtro": {
    "categoria": "algebraic",
    "q": null,
    "limit": 100
  },
  "aviso": "speedup_declarado es lo que declara la fuente citada, NO una medición de Rosetta. Lo que Rosetta midió va en evidencia_rosetta, y para la mayoría del catálogo está vacío.",
  "procedencia": {
    "fuente": "Quantum Algorithm Zoo",
    "fuente_url": "https://quantumalgorithmzoo.org/",
    "instantanea_sha256": "dee7e76b5f19096ed329c88714744b93babf7b7d0296eb97e357b2582d16b75e",
    "generado_at": "2026-09-09",
    "como_reconstruir": "Baja https://quantumalgorithmzoo.org/, recomputa su sha256 y corre scripts/build-quantum-catalog.mjs"
  },
  "items": [
    {
      "id": "factoring",
      "nombre": "Factoring",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Descomponer un entero de n bits en sus factores primos. Es el problema sobre el que descansa RSA.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/shor"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/shor.py"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/codebook/shors-algorithm"
        },
        {
          "nombre": "Qrisp",
          "url": "https://qrisp.eu/reference/Algorithms/Shor.html#shor"
        }
      ],
      "referencias": [
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 125,
          "cita": "Peter Shor Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of FOCS 1994 , pg. 124-134.",
          "url": null
        },
        {
          "n": 248,
          "cita": "Daniel J. Bernstein, Johannes Buchmann, and Erik Dahmen, Eds. Post-Quantum Cryptography Springer , 2009.",
          "url": "http://www.springer.com/mathematics/numbers/book/978-3-540-88701-0"
        },
        {
          "n": 252,
          "cita": "J. M. Pollard Theorems on factorization and primality testing Proceedings of the Cambridge Philosophical Society. 76:521-228, 1974.",
          "url": null
        },
        {
          "n": 253,
          "cita": "L. Babai, R. Beals, and A. Seress Polynomial-time theory of matrix groups In Proceedings of STOC 2009 , pg. 55-64.",
          "url": null
        },
        {
          "n": 254,
          "cita": "Neil J. Ross and Peter Selinger Optimal ancilla-free Clifford+T approximations of z-rotations arXiv:1403.2975 , 2014.",
          "url": "http://arxiv.org/abs/1403.2975"
        },
        {
          "n": 271,
          "cita": "Frédéric Grosshans, Thomas Lawson, François Morain, and Benjamin Smith Factoring safe semiprimes with a single quantum query arXiv:1511.04385 , 2015.",
          "url": "http://arxiv.org/abs/1511.04385"
        },
        {
          "n": 362,
          "cita": "Volker Strassen Einige Resultate über Berechnungskomplexität In Jahresbericht der Deutschen Mathematiker-Vereinigung , 78(1):1-8, 1976/1977.",
          "url": null
        },
        {
          "n": 366,
          "cita": "D. J. Bernstein, N. Heninger, P. Lou, and L. Valenta Post-quantum RSA IACR e-print 2017/351 , 2017.",
          "url": "https://eprint.iacr.org/2017/351"
        },
        {
          "n": 384,
          "cita": "M. Ekerå and J. Håstad Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers Proceedings of PQCrypto 2017 , pg. 347-363. (LNCS Volume 10346), 2017.",
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-59879-6_20"
        },
        {
          "n": 386,
          "cita": "D. J. Bernstein, J.-F. Biasse, and M. Mosca A low-resource quantum factoring algorithm Proceedings of PQCrypto 2017 , pg. 330-346 (LNCS Volume 10346), 2017.",
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-59879-6_19"
        },
        {
          "n": 431,
          "cita": "Craig Gidney and Martin Ekera How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits Quantum 5:433, 2021. [ arXiv:1905.09749 ]",
          "url": "https://arxiv.org/abs/1905.09749"
        },
        {
          "n": 542,
          "cita": "David Harvey and Markus Hittmeir A log-log speedup for exponent one-fifth deterministic integer factorization arXiv:2105.11105 , 2021.",
          "url": "https://arxiv.org/abs/2105.11105"
        }
      ],
      "n_referencias": 13,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "discrete-log",
      "nombre": "Discrete-log",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Dado b = a^s mod N, encontrar s. Sostiene DSA, ECDSA y el intercambio de claves Diffie-Hellman.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/discrete_log"
        },
        {
          "nombre": "Qrisp",
          "url": "https://github.com/diehoq/quantum-elliptic-curve-logarithm"
        }
      ],
      "referencias": [
        {
          "n": 14,
          "cita": "D. Boneh and R. J. Lipton Quantum cryptanalysis of hidden linear functions. In Don Coppersmith, editor, CRYPTO '95 , Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 1995.",
          "url": null
        },
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 109,
          "cita": "John Proos and Christof Zalka Shor's discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation , Vol. 3, No. 4, pg.317-344, 2003. [ arXiv:quant-ph/0301141 ]",
          "url": "http://arxiv.org/abs/quant-ph/0301141"
        },
        {
          "n": 203,
          "cita": "Andrew Childs and Gábor Ivanyos Quantum computation of discrete logarithms in semigroups. arXiv:1310.6238 , 2013.",
          "url": "http://arxiv.org/abs/1310.6238"
        },
        {
          "n": 204,
          "cita": "Matan Banin and Boaz Tsaban A reduction of semigroup DLP to classic DLP. arXiv:1310.7903 , 2013.",
          "url": "http://arxiv.org/abs/1310.7903"
        },
        {
          "n": 385,
          "cita": "M. Ekerå On post-processing in the quantum algorithm for computing short discrete logarithms IACR ePrint Archive Report 2017/1122 , 2017.",
          "url": "https://eprint.iacr.org/2017/1122"
        },
        {
          "n": 432,
          "cita": "Martin Roetteler, Michael Naehrig, Krysta M. Svore, and Kristin Lauter Quantum resource estimates for computing elliptic curve discrete logarithms Proceedings of ASIACRYPT 2017 [ arXiv:1706.06752 ]",
          "url": "https://arxiv.org/abs/1706.06752"
        }
      ],
      "n_referencias": 7,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "pell-s-equation",
      "nombre": "Pell's Equation",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Resolver la ecuación de Pell x^2 - d*y^2 = 1 sobre los enteros. Romperla quiebra el criptosistema de Buchmann-Williams.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 49,
          "cita": "Sean Hallgren Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing , 2002.",
          "url": null
        }
      ],
      "n_referencias": 1,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "principal-ideal",
      "nombre": "Principal Ideal",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Decidir si un ideal de un cuerpo de números es principal, y en ese caso hallar su generador. Es al menos tan difícil como factorizar.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 49,
          "cita": "Sean Hallgren Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing , 2002.",
          "url": null
        },
        {
          "n": 131,
          "cita": "Arthur Schmidt Quantum Algorithms for many-to-one Functions to Solve the Regulator and the Principal Ideal Problem. arXiv:0912.4807 , 2009.",
          "url": "http://arxiv.org/abs/0912.4807"
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "unit-group",
      "nombre": "Unit Group",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Calcular el grupo de unidades del anillo de enteros de un cuerpo de números.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 50,
          "cita": "Sean Hallgren Fast quantum algorithms for computing the unit group and class group of a number field. In Proceedings of the 37th ACM Symposium on Theory of Computing , 2005.",
          "url": null
        },
        {
          "n": 116,
          "cita": "Arthur Schmidt and Ulrich Vollmer Polynomial time quantum algorithm for the computation of the unit group of a number field. In Proceedings of the 37th Symposium on the Theory of Computing , pg. 475-480, 2005.",
          "url": null
        },
        {
          "n": 213,
          "cita": "Kirsten Eisenträger, Sean Hallgren, Alexei Kitaev, and Fang Song A quantum algorithm for computing the unit group of an arbitrary degree number field In Proceedings of STOC 2014 pg. 293-302.",
          "url": null
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 4,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "class-group",
      "nombre": "Class Group",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Calcular el grupo de clases de un cuerpo de números, un invariante central de la teoría algebraica de números.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 50,
          "cita": "Sean Hallgren Fast quantum algorithms for computing the unit group and class group of a number field. In Proceedings of the 37th ACM Symposium on Theory of Computing , 2005.",
          "url": null
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 2,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "gauss-sums",
      "nombre": "Gauss Sums",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Estimar sumas de Gauss sobre cuerpos finitos, objeto básico de la teoría de números.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 47,
          "cita": "Joseph Geraci and Daniel A. Lidar On the exact evaluation of certain instances of the Potts partition function by quantum computers. Comm. Math. Phys. Vol. 279, pg. 735, 2008. [ arXiv:quant-ph/0703023 ]",
          "url": "http://arxiv.org/abs/quant-ph/0703023"
        },
        {
          "n": 90,
          "cita": "Wim van Dam and Gadiel Seroussi Efficient quantum algorithms for estimating Gauss sums. arXiv:quant-ph/0207131 , 2002.",
          "url": "http://arxiv.org/abs/quant-ph/0207131"
        }
      ],
      "n_referencias": 2,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "primality-proving",
      "nombre": "Primality Proving",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Certificar que un número es primo, no solo probablemente primo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 393,
          "cita": "Qi Cheng Primality Proving via One Round in ECPP and One Iteration in AKS Journal of Cryptology , Volume 20, Issue 3, pg. 375-387, July 2007.",
          "url": null
        },
        {
          "n": 394,
          "cita": "Daniel J. Bernstein Proving primality in essentially quartic random time Mathematics of Computation , Vol. 76, pg. 389-403, 2007.",
          "url": null
        },
        {
          "n": 395,
          "cita": "F. Morain Implementing the asymptotically fast version of the elliptic curve primality proving algorithm Mathematics of Computation , Vol. 76, pg. 493-505, 2007.",
          "url": null
        },
        {
          "n": 396,
          "cita": "Alvaro Donis-Vela and Juan Carlos Garcia-Escartin A quantum primality test with order finding arXiv:1711.02616 , 2017.",
          "url": "https://arxiv.org/abs/1711.02616"
        },
        {
          "n": 397,
          "cita": "H. F. Chau and H.-K. Lo Primality test via quantum factorization International Journal of Modern Physics C , Vol. 8, No. 2, pg. 131-138, 1997. [ arXiv:quant-ph/9508005 ]",
          "url": "https://arxiv.org/abs/quant-ph/9508005"
        },
        {
          "n": 398,
          "cita": "David Harvey and Joris Van Der Hoeven Integer multiplication in time \\( O(n \\log \\ n) \\) hal-02070778 , 2019.",
          "url": "https://hal.archives-ouvertes.fr/hal-02070778"
        },
        {
          "n": 399,
          "cita": "Charles Greathouse personal communication , 2019.",
          "url": null
        }
      ],
      "n_referencias": 7,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "solving-exponential-congruences",
      "nombre": "Solving Exponential Congruences",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Resolver congruencias con incógnitas en el exponente.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 111,
          "cita": "Wim van Dam and Igor Shparlinski Classical and quantum algorithms for exponential congruences. Proceedings of TQC 2008 , pg. 1-10. [ arXiv:0804.1109 ]",
          "url": "http://arxiv.org/abs/0804.1109"
        }
      ],
      "n_referencias": 1,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "matrix-elements-and-multiplicity-coefficients-of-group-repre",
      "nombre": "Matrix Elements and Multiplicity Coefficients of Group Representations",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Estimar elementos de matriz y coeficientes de multiplicidad de representaciones de grupos, incluidos los coeficientes de Clebsch-Gordan.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 106,
          "cita": "Stephen P. Jordan Fast quantum algorithms for approximating the irreducible representations of groups. arXiv:0811.0562 , 2008.",
          "url": "http://arxiv.org/abs/0811.0562"
        },
        {
          "n": 196,
          "cita": "Robert Beals Quantum computation of Fourier transforms over symmetric groups. In Proceedings of STOC 1997 , pg. 48-53.",
          "url": null
        },
        {
          "n": 197,
          "cita": "Dave Bacon, Isaac L. Chuang, and Aram W. Harrow The quantum Schur transform: I. efficient qudit circuits. In Proceedings of SODA 2007 , pg. 1235-1244. [ arXiv:quant-ph/0601001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0601001"
        },
        {
          "n": 460,
          "cita": "Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtěch Havlíček, and Guanyu Zhu Quantum complexity of the Kronecker coefficients PRX Quantum 5(1):010329, 2023. [ arXiv:2302.11454 ]",
          "url": "https://arxiv.org/abs/2302.11454"
        },
        {
          "n": 515,
          "cita": "Greta Panova Polynomial time classical versus quantum algorithms for representation theoretic multiplicities arXiv:2502.20253 , 2025.",
          "url": "https://arxiv.org/abs/2502.20253"
        },
        {
          "n": 516,
          "cita": "Martin Larocca and Vojtech Havlicek Quantum Algorithms for Representation-Theoretic Multiplicities arXiv:2407.17649 , 2024.",
          "url": "https://arxiv.org/abs/2407.17649"
        }
      ],
      "n_referencias": 6,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "verifying-matrix-products",
      "nombre": "Verifying Matrix Products",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Comprobar si el producto de dos matrices es una tercera, más rápido que multiplicarlas.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 6,
          "cita": "A. Ambainis, H. Buhrman, P. Høyer, M. Karpinizki, and P. Kurur Quantum matrix verification. Unpublished Manuscript, 2002.",
          "url": null
        },
        {
          "n": 19,
          "cita": "Harry Buhrman and Robert Špalek Quantum verification of matrix products. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms , pages 880-889, 2006. [ arXiv:quant-ph/0409035 ]",
          "url": "http://arxiv.org/abs/quant-ph/0409035"
        },
        {
          "n": 85,
          "cita": "M. Szegedy Quantum speed-up of Markov chain based algorithms. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science , pg. 32, 2004.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "subset-sum",
      "nombre": "Subset-sum",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Dado un conjunto de números, hallar un subconjunto que sume un valor objetivo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 7,
          "cita": "Andris Ambainis Quantum walk algorithm for element distinctness. SIAM Journal on Computing , 37:210-239, 2007. [ arXiv:quant-ph/0311001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0311001"
        },
        {
          "n": 178,
          "cita": "Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, and Alexander Meurer Quantum algorithms for the subset-sum problem. from cr.yp.to .",
          "url": null
        },
        {
          "n": 404,
          "cita": "Anja Becker, Jean-Sebastien Coron, and Antoine Joux Improved generic algorithms for hard knapsacks Proceedings of Eurocrypt 2011 pg. 364-385 [ IACR eprint 2011/474 ]",
          "url": "http://eprint.iacr.org/2011/474"
        }
      ],
      "n_referencias": 3,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "decoding",
      "nombre": "Decoding",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Decodificar un código corrector de errores lineal, problema duro que sostiene la criptografía basada en códigos.",
      "speedup_declarado": "Varies",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 238,
          "cita": "Jon R. Grice and David A. Meyer A quantum algorithm for Viterbi decoding of classical convolutional codes arXiv:1405.7479",
          "url": "http://arxiv.org/abs/1405.7479"
        },
        {
          "n": 239,
          "cita": "Alexander Barg and Shiyu Zhou A quantum decoding algorithm of the simplex code Proceedings of the 36th Annual Allerton Conference, 1998 Available at author's homepage .",
          "url": "http://www.ece.umd.edu/~abarg/reprints/rm1dq.pdf"
        }
      ],
      "n_referencias": 2,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    },
    {
      "id": "quantum-cryptanalysis",
      "nombre": "Quantum Cryptanalysis",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Atacar primitivas criptográficas concretas con recursos cuánticos, más allá de Shor y Grover.",
      "speedup_declarado": "Various",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 14,
          "cita": "D. Boneh and R. J. Lipton Quantum cryptanalysis of hidden linear functions. In Don Coppersmith, editor, CRYPTO '95 , Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 1995.",
          "url": null
        },
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 109,
          "cita": "John Proos and Christof Zalka Shor's discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation , Vol. 3, No. 4, pg.317-344, 2003. [ arXiv:quant-ph/0301141 ]",
          "url": "http://arxiv.org/abs/quant-ph/0301141"
        },
        {
          "n": 125,
          "cita": "Peter Shor Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of FOCS 1994 , pg. 124-134.",
          "url": null
        },
        {
          "n": 262,
          "cita": "T. Laarhoven, M. Mosca, and J. van de Pol Solving the shortest vector problem in lattices faster using quantum search Proceedings of PQCrypto13 , pp. 83-101, 2013. [ arXiv:1301.6176 ]",
          "url": "http://arxiv.org/abs/1301.6176"
        },
        {
          "n": 283,
          "cita": "Andrew M. Childs, David Jao, and Vladimir Soukharev Constructing elliptic curve isogenies in quantum subexponential time Journal of Mathematical Cryptology , 8(1):1-29 (2014) [ arXiv:1012.4019 ]",
          "url": "http://arxiv.org/abs/1012.4019"
        },
        {
          "n": 284,
          "cita": "Markus Grassl, Brandon Langenberg, Martin Roetteler, and Rainer Steinwandt Applying Grover's algorithm to AES: quantum resource estimates arXiv:1512.04965 , 2015.",
          "url": "http://arxiv.org/abs/1512.04965"
        },
        {
          "n": 285,
          "cita": "M. Ami, O. Di Matteo, V. Gheorghiu, M. Mosca, A. Parent, and J. Schanck Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 arXiv:1603.09383 , 2016.",
          "url": "http://arxiv.org/abs/1603.09383"
        },
        {
          "n": 286,
          "cita": "Marc Kaplan, Gaetan Leurent, Anthony Leverrier, and Maria Naya-Plasencia Quantum differential and linear cryptanalysis arXiv:1510.05836 , 2015.",
          "url": "http://arxiv.org/abs/1510.05836"
        },
        {
          "n": 287,
          "cita": "Scott Fluhrer Quantum Cryptanalysis of NTRU Cryptology ePrint Archive: Report 2015/676 , 2015.",
          "url": "https://eprint.iacr.org/2015/676"
        },
        {
          "n": 288,
          "cita": "Marc Kaplan Quantum attacks against iterated block ciphers arXiv:1410.1434 , 2014.",
          "url": "http://arxiv.org/abs/1410.1434"
        },
        {
          "n": 289,
          "cita": "H. Kuwakado and M. Morii Quantum distinguisher between the 3-round Feistel cipher and the random permutation In Proceedings of IEEE International Symposium on Information Theory (ISIT) , pg. 2682-2685, 2010.",
          "url": null
        },
        {
          "n": 290,
          "cita": "H. Kuwakado and M. Morii Security on the quantum-type Even-Mansour cipher In Proceedings of International Symposium on Information Theory and its Applications (ISITA) , pg. 312-316, 2012.",
          "url": null
        },
        {
          "n": 291,
          "cita": "Martin Roetteler and Rainer Steinwandt A note on quantum related-key attacks arXiv:1306.2301 , 2013.",
          "url": "http://arxiv.org/abs/1306.2301"
        },
        {
          "n": 292,
          "cita": "Thomas Santoli and Christian Schaffner Using Simon's algorithm to attack symmetric-key cryptographic primitives arXiv:1603.07856 , 2016.",
          "url": "http://arxiv.org/abs/1603.07856"
        },
        {
          "n": 315,
          "cita": "Gilles Brassard, Peter Høyer, and Alain Tapp Quantum cryptanalysis of hash and claw-free functions In Proceedings of the 3rd Latin American symposium on Theoretical Informatics (LATIN'98) , pg. 163-169, 1998.",
          "url": null
        },
        {
          "n": 316,
          "cita": "Daniel J. Bernstein Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete? In Proceedings of the 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems (SHARCS'09) , pg. 105-116, 2009. [available here ]",
          "url": "https://cr.yp.to/hash/collisioncost-20090517.pdf"
        },
        {
          "n": 536,
          "cita": "André Chailloux and Johanna Loyer Lattice Sieving via Quantum Random Walks In Proceedings of Asiacrypt , pg. 63-91, 2021. [ arXiv:2105.05608 ]",
          "url": "https://arxiv.org/abs/2105.05608"
        },
        {
          "n": 537,
          "cita": "Lior Eldar and Sean Hallgren An efficient quantum algorithm for lattice problems achieving subexponential approximation factor arXiv:2201.13450 , 2022.",
          "url": "https://arxiv.org/abs/2201.13450"
        },
        {
          "n": 538,
          "cita": "Leo Ducas and Wessel van Woerden A note on a Claim of Eldar and Hallgren: LLL already solves it github , 2021.",
          "url": "https://github.com/lducas/BDD-note"
        },
        {
          "n": 539,
          "cita": "Yu-Ao Chen and Xiao-Shan Gao Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems Journal of Systems Science and Complexity 35, 373-412, 2022. [ arXiv:1712.06239 ]",
          "url": "https://arxiv.org/abs/1712.06239"
        },
        {
          "n": 540,
          "cita": "Yu-Ao Chen, Xiao-Shan Gao, and Chun-Ming Yuan Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis Journal of Systems Science and Complexity , 2025. [ arXiv:1802.03856 ]",
          "url": "https://arxiv.org/abs/1802.03856"
        },
        {
          "n": 541,
          "cita": "Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, and Jianqiang Li Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems Quantum 7, 1069, 2023. [ arXiv:2111.00405 ]",
          "url": "https://arxiv.org/abs/2111.00405"
        }
      ],
      "n_referencias": 23,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": false,
        "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
      }
    }
  ]
}