Computing small discrete logarithms faster

DOI10.1007/978-3-642-34931-7_19MaRDI QIDQ2876940zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein, Tanja Lange

Publication date 20 August 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34931-7_19

zbMATH Keywords

discrete logarithmsprecomputationrandom walks

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Computing discrete logarithms in an interval
• Analysis of possible pre-computation aided DLP solving algorithms
• Square-root algorithms for the discrete logarithm problem (a survey)
• scientific article; zbMATH DE number 1303121
• Cryptography and Coding

Cited in

(12)

• Solving discrete logarithm problems faster with the aid of pre-computation
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• Fully secure functional encryption for inner products, from standard assumptions
• Analysis of possible pre-computation aided DLP solving algorithms
• Computing discrete logarithms in an interval
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Generic construction of trace-and-revoke inner product functional encryption
• How to Solve Multiple Short-Exponent Discrete Logarithm Problem
• On the distributed discrete logarithm problem with preprocessing
• FE for inner products and its application to multi-authority ABE
• Multiple group action dlogs with(out) precomputation
• Recent progress on the elliptic curve discrete logarithm problem

This page was built for publication: Computing small discrete logarithms faster

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