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

DOI10.1023/A:1016521712726zbMath1006.11072OpenAlexW1596459745MaRDI QIDQ1611366

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

zbMATH Keywords

generating functionsfinite fieldsdiscrete logarithm problemsmooth polynomials

Mathematics Subject Classification ID

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

Related Items (1)

Faster individual discrete logarithms in finite fields of composite extension degree

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