Skip to main content
SpringerLink
Log in
Book cover

Computing and Network Sustainability pp 283–291Cite as

A Fault Attack for Scalar Multiplication in Elliptic Curve Digital Signature Algorithm

  • Conference paper
  • First Online:

  • 789 Accesses

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 12))

Abstract

The dominant operation in cryptographic scheme of elliptic curve is the multiplication using point on an elliptic curve by an integer. This paper specifically discusses the competent algorithms for scalar multiplication a very tedious process in Elliptic Curve Cryptography that are relevant for systems using constrained resources like smart cards. The taxonomy of the work in the open literature for these devices is not only from security perspectives, but likewise some implementation attack, such as fault attacks, must be considered. We survey different implementation approaches and algorithms with the purpose of providing a valuable reference of implementing scalar multiplication in order to retrieve information with a way to determine secret signing key. In addition, this paper provides a review of injecting different fault attacks in a system constrained environment with Elliptic Curve Cryptography. Finally, some arguments about future scope that should be undertaken are provided.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Biehl I, Meyer B, Müller V (2000) Differential fault attacks on elliptic curve cryptosytems. In: Advances in cryptology—CRYPTO 2000. Springer, pp 131–146

    Google Scholar 

  2. Blömer J, Otto M, Seifert J-P (2006) Sign change fault attacks on elliptic curve crytosystems. In: Fault diagnosis and tolerance in cryptography. Springer, pp 36–52

    Google Scholar 

  3. Boneh D, DeMillo RA, Lipton RJ (2001) On the importance of eliminating errors in cryptographic computations. J Cryptology 14(2):101–119

    Article  MathSciNet  MATH  Google Scholar 

  4. Saxena VP, Nalwaya P (2014) A novel cryptographic approach based on feedback mode of elgamal system. Int J Adv Res Sci Eng (IJARSE) 3(2):128–138. ISSN – 23198354

    Google Scholar 

  5. Saxena VP, Priya Nalwaya PN (2014) A cryptographic approach based on integrating running key in feedback mode of elgamal system. In: 2014 international conference on computational intelligence and communication networks (CICN). IEEE Computer Society, pp 719–724. http://doi.ieeecomputersociety.org/10.11

  6. Biham E, Shamir A (1997) Differential fault analysis of secret key cryptosystems. In: Advances in cryptology—CRYPTO’97. Springer, pp 513–525

    Google Scholar 

  7. Barenghi A, Bertoni G, Palomba A, Susella R (2011) A novel fault attack against ECDSA. In: IEEE international symposium on hardware-oriented security and trust (HOST). IEEE, pp 161–166

    Google Scholar 

  8. Hankerson D, Menezes AJ, Vanstone S (2006) Guide to elliptic curve cryptography. Springer Science & Business Media

    Google Scholar 

  9. Booth AD (1980) A signed binary multiplication technique. Computer arithmetic-benchmark papers in electrical engineering and computer science, vol 21

    Google Scholar 

  10. Reitwiesner GW (1960) Binary arithmetic. Adv Comput 1:231–308

    Article  MathSciNet  Google Scholar 

  11. Li H, Zhang R, Yi J, Lv H (2013) A novel algorithm for scalar multiplication in ECDSA. In: 2013 fifth international conference on computational and information sciences (ICCIS). IEEE, pp 943–946

    Google Scholar 

  12. Fan J, Verbauwhede I (2012) An updated survey on secure ecc implementations: attacks, countermeasures and cost. In: Cryptography and security: from theory to applications. Springer, pp 265–282

    Google Scholar 

  13. Saxena VP, Anubhav Saxena SM (2015) Implementation of fault attacks on elliptic curve cryptosystems. Reading, vol 3, no 4, p 0

    Google Scholar 

  14. Amiel F, Clavier C, Tunstall M (2006) Fault analysis of dpa-resistant algorithms. In: Fault diagnosis and tolerance in cryptography. Springer, pp 223–236

    Google Scholar 

  15. Ciet M, Joye M (2005) Elliptic curve cryptosystems in the presence of permanent and transient faults. Des Codes Crypt 36(1):33–43

    Article  MathSciNet  MATH  Google Scholar 

  16. Schmidt J-M, Medwed M (2009) A fault attack on ECDSA. In: 2009 Workshop on fault diagnosis and tolerance in cryptography (FDTC). IEEE, pp 93–99

    Google Scholar 

  17. Ling J, King B (2013) Smart card fault attacks on elliptic curve cryptography. In: 2013 IEEE 56th international midwest symposium on circuits and systems (MWSCAS). IEEE, pp 1255–1258

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Government Women Engineering College, Ajmer, India

    Deepti Jyotiyana & Varun P. Saxena

Authors
  1. Deepti Jyotiyana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Varun P. Saxena
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Varun P. Saxena .

Editor information

Editors and Affiliations

  1. Department of Software and Systems Engineering, VIT University, Vellore, Tamil Nadu, India

    H.R . Vishwakarma

  2. Department of Electronics and Communication Engineering, ITM University, Gwalior, Madhya Pradesh, India

    Shyam Akashe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Jyotiyana, D., Saxena, V.P. (2017). A Fault Attack for Scalar Multiplication in Elliptic Curve Digital Signature Algorithm. In: Vishwakarma, H., Akashe, S. (eds) Computing and Network Sustainability. Lecture Notes in Networks and Systems, vol 12. Springer, Singapore. https://doi.org/10.1007/978-981-10-3935-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3935-5_29

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3934-8

  • Online ISBN: 978-981-10-3935-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation