Analysis of the insecurity of ECMQV with partially known nonces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2851, Issue , 2003, Pages 240-251

  Leadbitter, Peter J ^a   Smart, Nigel P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

AUTHENTICATED KEY AGREEMENT PROTOCOLS; CLOSEST VECTOR PROBLEM; DIGITAL SIGNATURE ALGORITHMS; ELLIPTIC CURVE; HIGH PROBABILITY; NON-UNIFORM DISTRIBUTION; PARTIAL KNOWLEDGE; S-ALGORITHMS;

CRYPTOGRAPHY;

EID: 35248856015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10958513_19     Document Type: Article

References (16)

1. L. Babai. On Lovàsz lattice reduction and the nearest lattice point problem. Combinatoria, 6, 1-13, 1986.
2. 0.292, In Advances in Cryptology - EuroCrypt '99, Springer LNCS 1592, 1-11, 1999.
3. D. Boneh, S. Halevi and N. Howgrave-Graham. The Modular Inversion Hidden Number Problem. In Advances in Cryptology - AsiaCrypt 2001, LNCS 2248, 36-51, 2001
4. D. Boneh and R. Venkatesan. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In Advances in Cryptology - CRYPTO '96, Springer LNCS 1109, 129-142, 1996.
5. D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. of Cryptology, 10, 233-260, 1997.
6. N. Howgrave-Graham and N.P. Smart. Lattice attacks on digital signature schemes. Designs, Codes and Cryptography, 23, 283-290, 2001.
7. L. Law, A. Menezes, M. Qu, J. Solinas and S. Vanstone. An efficient protocol for authenticated key agreement. To appear Designs, Codes and Cryptography
8. A.L. Lenstra, H.W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math Ann., 261, 515-534, 1982.
9. R. Merkle, M. Hellman. Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inform. Theory, IT-24:525-530, September 1978.
10. P.Q. Nguyen and I.E. Shparlinski. The insecurity of the Digital Signature Algorithm with partially known nonces. J. Cryptology, 15, 151-176, 2002.
11. P.Q. Nguyen and I.E. Shparlinski. The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces. To appear Designs, Codes and Cryptography.
12. P.Q. Nguyen and J. Stern. Lattice reduction in cryptology: An update. In Algorithmic Number Theory - ANTS-IV, Springer LNCS 1838, 85-112, 2000.
13. J.M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32, 918-924, 1978.
14. C.P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Programming, 66, 181-199, 1994.
15. A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In proc. of 23rd FOCS, pages 145-152. IEEE, 1982
16. B.M.M. de Weger. Solving exponential diophantine equations using lattice basis reduction algorithms. J. Number Theory, 26, 325-367, 1987.