Ephemeral key recovery using index calculus method
From MaRDI portal
Publication:3062048
DOI10.1080/09720529.2010.10698275zbMATH Open1206.94085OpenAlexW2008085788MaRDI QIDQ3062048FDOQ3062048
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
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
- Title not available (Why is that?)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Discrete logarithms in \(\mathrm{GF}(p)\)
- The Xedni calculus and the elliptic curve discrete logarithm problem
- On reusing ephemeral keys in Diffie-Hellman key agreement protocols
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)
