Skip to main content

On Pseudo-random Number Generation Using Elliptic Curve Cryptography

  • Conference paper
Security in Computing and Communications (SSCC 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 377))

Included in the following conference series:

Abstract

The recent branch of network security is Cryptography using Elliptic Curve Architectures which is based on the arithmetic of elliptic curves and discrete logarithmic problems. ECC schemes are public-key based mechanisms that provide encryption, digital signatures and key exchange algorithms. Elliptic curve algorithms are solely based on generation of random numbers which can be identified by pseudo-random number generator. This paper describes the mechanism of deriving random number and the possibilities of random number generator attack on ECC algorithms. The algorithm proposed here in can be used for generating random numbers in ECIES or any ECC based encryption decryption algorithm. Through the results obtained it is proved to be better in comparison to other algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. Brown, D.R.L., Gjøsteen, K.: A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator, IACR ePrint 2007/048 Crypto (2007)

    Google Scholar 

  2. Jao, D., Jetchev, D., Venkatesan, R.: On the bits of elliptic curve diffie-hellman keys. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 33–47. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Kaliski, B.S.: Journal of Cryptology 3, 187–199 (1991-1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient pseudorandom generators based on the DDH assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 426–441. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Caragiu, M., Johns, R.A., Gieseler, J.: Quasi-random structures from elliptic curves. J. Algebra, Number Theory Appl. 6, 561–571 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Chevassut, O., Fouque, P.-A., Gaudry, P., Pointcheval, D.: The twist-Augmented technique for key exchange. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 410–426. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Longa, P.: High-Speed Elliptic Curve and Pairing-Based Cryptography. A thesis presented to the University of Waterloo (2011)

    Google Scholar 

  8. Batina, L., Mentens, N., Sakiyama, K., Preneel, B., Verbauwhede, I.: Low-Cost Elliptic Curve Cryptography for Wireless Sensor Networks. In: Buttyán, L., Gligor, V.D., Westhoff, D., et al. (eds.) ESAS 2006. LNCS, vol. 4357, pp. 6–17. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Gayoso Martinez, V., et al.: A Survey of the Elliptic Curve Integrated Encryption Scheme. Journal of Computer Science and Engg. (August 2010)

    Google Scholar 

  10. Kumar, A., et al.: Performance Analysis of MANET using Elliptic Curve Cryptosystem. In: IEEE – ICACT – 2012 (2012)

    Google Scholar 

  11. Fan, J., et al.: State – of –the art of Secure ECC implementations: a survey on known side-channel attacks and countermeasures. In: IEEE Symposium on Hardwar-Oriented Security and Trust (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubal, M., Deshmukh, A. (2013). On Pseudo-random Number Generation Using Elliptic Curve Cryptography. In: Thampi, S.M., Atrey, P.K., Fan, CI., Perez, G.M. (eds) Security in Computing and Communications. SSCC 2013. Communications in Computer and Information Science, vol 377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40576-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40576-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40575-4

  • Online ISBN: 978-3-642-40576-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics