Solving Discrete Logarithms from Partial Knowledge of the Key

DOI10.1007/978-3-540-77026-8_17MaRDI QIDQ5458212zbMATH OpenOpenAlexFDO

Authors K. S. Gopalakrishnan, Nicolas Thériault, Chui Zhi Yao

Publication date 11 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-77026-8_17

zbMATH Keywords

Discrete Logarithm ProblemGeneric GroupsSide Channel Attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the Bits of Elliptic Curve Diffie-Hellman Keys
• Partial lifting and the elliptic curve discrete logarithm problem
• On the possibility of transformation of multidimensional ECDLP into 1-dimensional ECDLP
• Algorithms and Computation
• scientific article; zbMATH DE number 1848387

Cited in

(7)

• Computing discrete logarithms in an interval
• Computing interval discrete logarithm problem with restricted jump method
• Indistinguishable proofs of work or knowledge
• On the possibility of transformation of multidimensional ECDLP into 1-dimensional ECDLP
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Solving discrete logarithm problem in an interval using periodic iterates
• Attacking embedded ECC implementations through CMOV side channels

This page was built for publication: Solving Discrete Logarithms from Partial Knowledge of the Key

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