{
  "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": "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."
  }
}