Skip to main content
SpringerLink
Log in
Book cover

Smart Technologies and Innovation for a Sustainable Future pp 221–228Cite as

Measuring Ciphertext Randmoness Using Die Hard Randomness Index

  • Conference paper
  • First Online:

  • 1975 Accesses

Part of the book series: Advances in Science, Technology & Innovation ((ASTI))

Abstract

In this paper we present a novel quantitative measure of randomness based on Diehard randomness tests. The proposed method relies on the results of diehard tests in calculating a randomness index; namely Diehard Randomness Index (DRI). The presented index can be helpful in measuring randomness in bit sequences generated from pseudo-random and random number generators to identify which has better randomness properties. The paper also show sample calculations of the proposed index to measure randomness of ciphertext resulting from encryption using block-ciphers.

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   139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   179.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. Papoulis, A., Pillai, S.U.: Probability, Random Variables and Stochastic Processes. McGraw-Hill, New York (2002)

    Google Scholar 

  2. Alcover, P.M., Guillamón, A., Ruiz, M.C.: A new randomness test for bit sequences. Informatica 24(3), 339–356 (2013)

    MathSciNet  MATH  Google Scholar 

  3. Marsaglia, G.: Diehard battery of tests of randomness (1995). [Online]. Available: http://www.stat.fsu.edu/pub/diehard/

  4. Marsaglia, G., Tsang, W.W.: Some difficult-to-pass tests of randomness. J. Stat. Softw. 7(3) (2002)

    Google Scholar 

  5. Alani, M.M.: Testing randomness in ciphertext of block-ciphers using diehard tests. Int. J. Comput. Sci. Netw. Secur. 10(4), 53–57 (2010)

    MathSciNet  Google Scholar 

  6. I.S. Institute: Crypt-XS tests of randomness (1998). [Online]. Available: http://www.isi.qut.edu.au/resources/cryptx/

  7. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST (2010)

    Google Scholar 

  8. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (2001)

    Google Scholar 

  9. Soto, J.: Statistical testing of random number generators. In: Proceedings of the 22nd National Information Systems Security Conference, Virginia (1999)

    Google Scholar 

  10. Duggan, M.J., Drew, J.H., Leemis, L.M.: A test of randomness based on the distance between consecutive random number pairs. In: Proceedings of the 2005 Winter Simulation Conference (2005)

    Google Scholar 

  11. Gacs, P.: Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341(1–3), 91–137 (2005)

    Article  MathSciNet  Google Scholar 

  12. Doganaksoy, A., Calık, C., Sulak F., Turan, M.S.: New randomness tests using random walk. In: Proceedings of National Conference on Cryptology II, Turkey (2006)

    Google Scholar 

  13. L’Ecuyer, P., Simard, R.: TestU01: a C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4) (2007)

    Article  Google Scholar 

  14. Pironio, S., Acín, A., Massar, S., de La Giroday, A.B., Matsukevich, D.N., Maunz, P., Monroe, C.: Random numbers certified by Bell’s theorem. Nature 464(7291), 1021–1024 (2010)

    Article  Google Scholar 

  15. McKinney, E.H.: Generalized birthday problem. Am. Math. Mon. 73, 385–387 (1966)

    Article  MathSciNet  Google Scholar 

  16. Isaac, R.: The Pleasures of Probability. Springer, New York (1995)

    Google Scholar 

  17. Wald, A., Wolfwitz, J.: An exact test for randomness in the non-parametric case based on serial correlation. Ann. Math. Stat. 14(4), 378–388 (1943)

    Article  MathSciNet  Google Scholar 

  18. Soong, T.T.: Fundamentals of Probability and Statistics for Engineers. John Wiley and Sons, Chichester (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Khawarizmi International College, Abu Dhabi, United Arab Emirates

    Mohammed M. Alani

Authors
  1. Mohammed M. Alani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammed M. Alani .

Editor information

Editors and Affiliations

  1. College of Education, American University in the Emirates, Dubai, United Arab Emirates

    Ahmed Al-Masri

  2. Computer Science Research Institute, Magee Campus, University of Ulster, Londonderry, UK

    Kevin Curran

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

Alani, M.M. (2019). Measuring Ciphertext Randmoness Using Die Hard Randomness Index. In: Al-Masri, A., Curran, K. (eds) Smart Technologies and Innovation for a Sustainable Future. Advances in Science, Technology & Innovation. Springer, Cham. https://doi.org/10.1007/978-3-030-01659-3_25

Download citation

Publish with us

Policies and ethics

Search

Navigation