P. J. Leadbitter, N. P. Smart  Home/Search
Context Related
| iacr.org/2002/145.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present the first lattice attack on an authenticated key agreement protocol, which does not use a digital signature algorithm to produce the authentication. We present a two stage attack on MQV in which one party may recover the other party's static private key from partial knowledge of the nonces from several runs of the protocol. The first stage reduces the attack to a hidden number problem which is partially solved by considering a closest vector problem and using... (Update)
Similar documents based on text: More All
0.7: The Insecurity of the Elliptic Curve Digital Signature.. - Nguyen, Shparlinski (2000) (Correct)
0.6: HMQV: A High-Performance Secure Diffie-Hellman Protocol - Krawczyk (2005) (Correct)
0.6: The Insecurity of the Digital Signature Algorithm with.. - Nguyen, Shparlinski (2000) (Correct)
BibTeX entry: (Update)
P. J. Leadbitter and N. P. Smart. Cryptanalysis of MQV with partially known nonces. Cryptology ePrint Archive: Report 2002/145, 2002 http://citeseer.ist.psu.edu/leadbitter02cryptanalysis.html More
@misc{ leadbitter02cryptanalysis,
author = "P. Leadbitter and N. Smart",
title = "Cryptanalysis of MQV with partially known nonces",
text = "P. J. Leadbitter and N. P. Smart. Cryptanalysis of MQV with partially known
nonces. Cryptology ePrint Archive: Report 2002/145, 2002",
year = "2002",
url = "citeseer.ist.psu.edu/leadbitter02cryptanalysis.html" }
Citations (may not include all citations):227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
68 Small solutions to polynomial equations (context) - Coppersmith - 1997
63 Monte Carlo methods for index computation (context) - Pollard - 1978
60 Lattice basis reduction: Improved practical algorithms and s.. - Schnorr, Euchner - 1994
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
34 The insecurity of the Digital Signature Algorithm with parti.. - Nguyen, Shparlinski
26 Cryptanalysis of RSA with private key d less than N - Boneh, Durfee - 1999
19 Lattice reduction in cryptology: An update - Nguyen, Stern - 2000
16 Lattice attacks on digital signature schemes (context) - Howgrave-Graham, Smart - 2001
13 An efficient protocol for authenticated key agreement - Law, Menezes et al.
8 asz lattice reduction and the nearest lattice point problem (context) - Babai - 1986
6 The Modular Inversion Hidden Number Problem - Boneh, Halevi et al. - 2001
3 Solving exponential diophantine equations using lattice basi.. (context) - de Weger - 1987
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC