Ephemeral key recovery using index calculus method

DOI10.1080/09720529.2010.10698275MaRDI QIDQ3062048zbMATH OpenOpenAlexFDO

Authors R. Padmavathy, Chakravarthy Bhagvati

Publication date 3 January 2011

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2010.10698275

zbMATH Keywords

discrete logarithm problemPohlig-Hellmanindex calculus methodephemeral keys

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1808254
• Efficient ephemeral elliptic curve cryptographic keys
• Key recovery attacks on iterated Even-Mansour encryption schemes
• On reusing ephemeral keys in Diffie-Hellman key agreement protocols
• Fast and memory-efficient key recovery in side-channel attacks
• scientific article; zbMATH DE number 1950331
• scientific article; zbMATH DE number 5138871
• Optimal recovery of secret keys from weak side channel traces
• The design and implementation of protocol-based hidden key recovery
• Practical key recovery for discrete-logarithm based authentication schemes from random nonce bits

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Monte Carlo Methods for Index Computation (mod p)
• On reusing ephemeral keys in Diffie-Hellman key agreement protocols
• The Xedni calculus and the elliptic curve discrete logarithm problem

This page was built for publication: Ephemeral key recovery using index calculus method

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