A rigorous proof of the Waterloo algorithm for the discrete logarithm problem

DOI10.1023/A:1016521712726zbMATH Open1006.11072OpenAlexW1596459745MaRDI QIDQ1611366FDOQ1611366

Daniel Panario, Michael Drmota

Publication date: 21 August 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016521712726

Recommendations

• A deterministic algorithm for the discrete logarithm problem in a semigroup
• Public Key Cryptography - PKC 2006
• On generic complexity of the discrete logarithm problem
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
• scientific article
• Complexity of a determinate algorithm for the discrete logarithm
• Publication:5750402
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• scientific article; zbMATH DE number 1024052

zbMATH Keywords

generating functionsdiscrete logarithm problemfinite fieldssmooth polynomials

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cited In (3)

• Title not available (Why is that?)
• Faster individual discrete logarithms in finite fields of composite extension degree
• Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms

This page was built for publication: A rigorous proof of the Waterloo algorithm for the discrete logarithm problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611366)