Abstract
Using Lagrange’s algorithm for the computation of a basis of a 2-dimensional lattice formed by two successive minima, we present some attacks on DSA and ECDSA which permit us, under some assumptions, to compute the secret key of the scheme provided that one or two signed messages are given.
MSC 2010
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Goldwasser, S., Micciancio, D.: “Pseudo-random” number generation within cryptographic algorithms: The DSS case. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 277–291. Springer, Heidelberg (1997)
Blake, I.F., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Cambridge University Press (2000)
Blake, I.F., Garefalakis, T.: On the security of the digital signature algorithm. Des. Codes Cryptogr. 26(1-3), 87–96 (2002)
Blum, L., Blum, M., Shub, M.: A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing 15, 364–383 (1986)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithm. IEEE Transactions on Information Theory 31, 469–472 (1985)
FIPS PUB 186-3: Federal Information Processing Standards Publication, Digital Signature Standard (DSS)
Girault, M., Poupard, G., Stern, J.: Global Payment System (GPS): un protocole de signature à la volée. In: Proceedings of Trusting Electronic Trade (1999)
Johnson, D., Menezes, A.J., Vanstone, S.A.: The elliptic curve digital signature algorithm (ECDSA). Intern. J. of Information Security 1, 36–63 (2001)
Hoffstein, J., Pipher, J., Silverman, J.: An Introduction to Mathematical Cryptography. Springer (2008)
Howgrave-Graham, N.A., Smart, N.P.: Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptogr. 23, 283–290 (2001)
Koblitz, N., Menezes, A.J., Vanstone, S.A.: The state of elliptic curve cryptography. Des. Codes Cryptogr. 19, 173–193 (2000)
Koblitz, N., Menezes, A.J.: A survey of Public-Key Cryptosystems. SIAM Review 46(4), 599–634 (2004)
Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513–534 (1982)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Nguyen, P.Q., Stehlé, D.: Low-Dimensional Lattice Basis Reduction Revisited. ACM Transactions on Algorithms 5(4), Article 46 (2009)
Nguyên, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146–180. Springer, Heidelberg (2001)
Nguyen, P.Q., Shparlinski, I.E.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology 15, 151–176 (2002)
Nguyen, P.Q., Shparlinski, I.E.: The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptogr. 30, 201–217 (2003)
Poulakis, D.: Some Lattice Attacks on DSA and ECDSA Applicable Algebra in Engineering. Communication and Computing 22, 347–358 (2011)
Stein, W.A., et al.: Sage Mathematics Software (Version 4.6), The Sage Development Team, http://www.sagemath.org
Stinson, D.R.: Cryptography, Theory and Practice, 2nd edn. Chapman & Hall/CRC (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Draziotis, K., Poulakis, D. (2013). Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm. In: Muntean, T., Poulakis, D., Rolland, R. (eds) Algebraic Informatics. CAI 2013. Lecture Notes in Computer Science, vol 8080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40663-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-40663-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40662-1
Online ISBN: 978-3-642-40663-8
eBook Packages: Computer ScienceComputer Science (R0)