Skip to main content
SpringerLink
Log in

Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm

  • Conference paper
Algebraic Informatics (CAI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8080))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Blake, I.F., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Cambridge University Press (2000)

    Google Scholar 

  3. Blake, I.F., Garefalakis, T.: On the security of the digital signature algorithm. Des. Codes Cryptogr. 26(1-3), 87–96 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blum, L., Blum, M., Shub, M.: A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing 15, 364–383 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithm. IEEE Transactions on Information Theory 31, 469–472 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. FIPS PUB 186-3: Federal Information Processing Standards Publication, Digital Signature Standard (DSS)

    Google Scholar 

  7. Girault, M., Poupard, G., Stern, J.: Global Payment System (GPS): un protocole de signature à la volée. In: Proceedings of Trusting Electronic Trade (1999)

    Google Scholar 

  8. Johnson, D., Menezes, A.J., Vanstone, S.A.: The elliptic curve digital signature algorithm (ECDSA). Intern. J. of Information Security 1, 36–63 (2001)

    MATH  Google Scholar 

  9. Hoffstein, J., Pipher, J., Silverman, J.: An Introduction to Mathematical Cryptography. Springer (2008)

    Google Scholar 

  10. Howgrave-Graham, N.A., Smart, N.P.: Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptogr. 23, 283–290 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Koblitz, N., Menezes, A.J., Vanstone, S.A.: The state of elliptic curve cryptography. Des. Codes Cryptogr. 19, 173–193 (2000)

    Article  MathSciNet  Google Scholar 

  12. Koblitz, N., Menezes, A.J.: A survey of Public-Key Cryptosystems. SIAM Review 46(4), 599–634 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513–534 (1982)

    Article  Google Scholar 

  14. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  15. Nguyen, P.Q., Stehlé, D.: Low-Dimensional Lattice Basis Reduction Revisited. ACM Transactions on Algorithms 5(4), Article 46 (2009)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Nguyen, P.Q., Shparlinski, I.E.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology 15, 151–176 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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)

    Article  MathSciNet  MATH  Google Scholar 

  19. Poulakis, D.: Some Lattice Attacks on DSA and ECDSA Applicable Algebra in Engineering. Communication and Computing 22, 347–358 (2011)

    MathSciNet  MATH  Google Scholar 

  20. Stein, W.A., et al.: Sage Mathematics Software (Version 4.6), The Sage Development Team, http://www.sagemath.org

  21. Stinson, D.R.: Cryptography, Theory and Practice, 2nd edn. Chapman & Hall/CRC (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University of Thessaloniki, P.O. Box 114, Thessaloniki, 54124, Greece

    Konstantinos Draziotis

  2. Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, 54124, Greece

    Dimitrios Poulakis

Authors
  1. Konstantinos Draziotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitrios Poulakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ERISCS Research Group, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille CEDEX 9, France

    Traian Muntean

  2. Department of Mathematics, Aristotle University of Thessaloniki, University Campus, 54124, Thessaloniki, Greece

    Dimitrios Poulakis

  3. ERISCS Research Group and IML Research Laboratory, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille, France

    Robert Rolland

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation