The discrete logarithm problem for exponents of bounded height

DOI10.1112/S1461157014000230MaRDI QIDQ2878833zbMATH OpenFDO

Authors Simon R. Blackburn, Sam Scott

Publication date 5 September 2014

Published in LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/S1461157014000230

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Discrete logarithm problems with auxiliary inputs
• Computing discrete logarithms in an interval
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом

Cites work

• Mathematics of public key cryptography.
• On Diffie-Hellman Key Agreement with Short Exponents

Cited in

(4)

• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Binary refinement implies discrete exponentiation
• scientific article; zbMATH DE number 3863322 (Why is no real title available?)
• scientific article; zbMATH DE number 4214161 (Why is no real title available?)

This page was built for publication: The discrete logarithm problem for exponents of bounded height

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