Analysis of the Insecurity of ECMQV with Partially Known Nonces
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 240-251
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Insecurity of the Digital Signature Algorithm with Partially Known NoncesJournal of Cryptology, 2002
- The Modular Inversion Hidden Number Problem2001
- Lattice Attacks on Digital Signature SchemesDesigns, Codes and Cryptography, 2001
- Lattice Reduction in Cryptology: An Update2000
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes1996
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978