Skip to main content

Performance Evaluation of a Pseudo-Random Number Generator Against Various Attacks

  • Conference paper
  • First Online:
Proceedings of the Future Technologies Conference (FTC) 2018 (FTC 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 881))

Included in the following conference series:

  • 1973 Accesses

Abstract

Every user agrees upon a key-exchange protocol before initiating a communication over the Internet. These keys at the root level are a combination of highly unpredictable sequences of random numbers. It is crucial that the numbers generated are strong and secured. Ciphers are developed to generate these strong sets of keys. We conducted a thorough research on the existing hardware and software ciphers. Flaws were identified in the design complexity, platform dependency, application dimensions, and resource consumption. This led to the development of a generic n-bit LFSR based Cryptographically Secured Pseudo Random Number Generator (hardware-software co-simulation). As the generator forms the foundation for the security of the entire network, it has to be resistant to most attacks. The current ciphers which are used in real time applications like communication devices, online shopping and payments, group chats on social media, etc. are prone to attacks. This paper focuses on identifying those attacks and conducting the same on our cipher to evaluate its performance. To the best of our knowledge, we are the first to summarize these attacks from a wide domain of applications and prove it all experimentally in a single paper. Since a CSPRNG works at different layers of the communication cycle, attacks have been bifurcated into Cryptanalysis, LFSR, and Real-time attacks. Various test cases and results are discussed in order to ensure the effectiveness of the CSPRNG.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Upadhyay, D., Shah, T., Sharma, P.: Cryptanalysis of hardware based stream ciphers and implementation of GSM stream cipher to propose a novel approach for designing n-bit LFSR stream cipher. In: 2015 19th International Symposium on VLSI Design and Test (VDAT), 26 June 2015, pp. 1–6. IEEE (2015)

    Google Scholar 

  2. Robshaw, M., Billet, O. (eds.): New Stream Cipher Designs: The eSTREAM Finalists. Springer, 19 June 2008

    Google Scholar 

  3. Shah, T., Upadhyay, D., Sharma, P.: A comparative analysis of different LFSR-based ciphers and parallel computing platforms for development of generic cipher compatible on both hardware and software platforms. In: Proceedings of the International Conference on Recent Cognizance in Wireless Communication & Image Processing 2016, pp. 305–316. Springer, New Delhi (2016)

    Google Scholar 

  4. Sepehrdad, P., Vaudenay, S., Vuagnoux, M.: Discovery and exploitation of new biases in RC4. In: International Workshop on Selected Areas in Cryptography, 12 August 2010, pp. 74–91. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Ekdahl, P., Johansson, T.: Another attack on A5/1. IEEE Trans. Inf. Theory 49(1), 284–9 (2003)

    Article  MathSciNet  Google Scholar 

  6. Driessen, B., Hund, R., Willems, C., Paar, C., Holz, T.: Don’t trust satellite phones: a security analysis of two satphone standards. In: 2012 IEEE Symposium on Security and Privacy (SP), 20 May 2012 , pp. 128–142. IEEE (2012)

    Google Scholar 

  7. Shah, T., Upadhyay, D.: Design analysis of an n-Bit LFSR-based generic stream cipher and its implementation discussion on hardware and software platforms. In: Proceedings of the International Congress on Information and Communication Technology 2016, pp. 607–621. Springer, Singapore (2016)

    Google Scholar 

  8. Klein, A.: Attacks on the RC4 stream cipher. Des. Codes Cryptogr. 48(3), 269–286 (2008)

    Article  MathSciNet  Google Scholar 

  9. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Annual International Cryptology Conference, 23 August 1998, pp. 13–25. Springer, Heidelberg (1998)

    Google Scholar 

  10. Knudsen, L.R., Robshaw, M.J.: Brute force attacks. In: The Block Cipher Companion 2011, pp. 95–108. Springer, Heidelberg (2011)

    Google Scholar 

  11. Nxtforum.org, ‘Making a strong Password’. https://nxtforum.org/security/making-a-strong-password-(please-sticky)/5/?wap2. Accessed 30 June 2014

  12. Akamai.com, Brute Force Attacks. https://www.akamai.com/us/en/resources/brute-force-attacks.jsp. Accessed 2017

  13. Zhu, B.: An online calculator for Berlekamp Massey Algorithm. http://bma.bozhu.me/

  14. Canteaut, A.: Correlation attack for stream ciphers. Encyclopedia of Cryptography and Security, p. 103 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Trishla Shah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shah, T., Sampalli, S., Upadhyay, D., Sharma, P. (2019). Performance Evaluation of a Pseudo-Random Number Generator Against Various Attacks. In: Arai, K., Bhatia, R., Kapoor, S. (eds) Proceedings of the Future Technologies Conference (FTC) 2018. FTC 2018. Advances in Intelligent Systems and Computing, vol 881. Springer, Cham. https://doi.org/10.1007/978-3-030-02683-7_21

Download citation

Publish with us

Policies and ethics