{
  "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-08-09"
  },
  "id": "quantum-cryptanalysis",
  "nombre": "Quantum Cryptanalysis",
  "categoria": "Algebraic and Number Theoretic Algorithms",
  "categoria_id": "algebraic",
  "problema": "Atacar primitivas criptograficas concretas con recursos cuanticos, mas alla 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."
  }
}