Skip to main content
SpringerLink
Log in

Statistical Strength of a Hybrid Cryptosystem on 2-D Cellular Automata with Nonaffine Rotations

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5559))

  • 1460 Accesses

Abstract

In this paper we present some basic evaluation of quality of the multicore (or multiagent) cryptosystem 2DCARotate according to the statistical tests suite recommended by the US National Institute of Standards and Technology (NIST), as well as to a new test by the grade analysis method which has recently been developed at the Institute of Computer Science of the Polish Academy of Sciences. The paper reports some results of these tests for our 2DCARotate based on a nonaffine Boolean function of rotation combined with three cellular automata (viewed as systems of many agents interacting upon neighborhood environment), in comparison with 3DES and AES-Rijndael which are currently the world’s best symmetric ciphers. Against such competition our cipher fares surprisingly well.

The authors gratefully acknowledge insightful conversations with Professors E. Pleszczyńska and W. Szczesny and their advice to test the ciphers using the grade analysis method.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Daemen, J., Rijmen, V.: The Design of Rijndael: AES. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  2. Gutowitz, H.: Cryptography with Dynamical Systems, Laboratoire d’Electronique Paris, France (July 25, 1996)

    Google Scholar 

  3. Hardjono, T., Pieprzyk, J., Seberry, J.: Fundamentals in Computer Security. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  4. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, 5th printing. CRC Press, Boca Raton (2001), www.cacr.math.uwaterloo.ca/hac/

    MATH  Google Scholar 

  5. Data Encryption Standard, FIPS Publication 46, Washington, DC (1977)

    Google Scholar 

  6. Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher, FIPS Special Publication 800-67 (2004)

    Google Scholar 

  7. von Neumann, J.: Theory of self-reproducing automata. Urbana University of Illinois Press (1966)

    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, NIST Special Publication 800-22, with revisions dated May 15 (2001)

    Google Scholar 

  9. Schneier, B.: Description of a New Variable-Length Key 64-Bit Block Cipher (Blowfish). In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 191–204. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  10. Srebrny, M., Such, P.: Encryption Using Two-Dimensional Cellular Automata with Application. In: Proceedings of Advanced Computer Systems 2002, pp. 177–190. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  11. Srebrny, M., Such, P., Szczesny, W.: Statistical tests of a new cipher related to four renown ones, internal report of the Institute of Computer Science of the Polish Academy of Sciences (December 2007)

    Google Scholar 

  12. Szczesny, W.: Grade correspondence analysis applied to contingency tables and questionnaire data. Intelligent Data Analysis 6(1), 17–51 (2002)

    MATH  Google Scholar 

  13. Szczesny, W., Kowalczyk, T., Srebrny, M., Such, P.: Testowanie jakości szyfrów jako generatorów ciągów losowych: wyniki eksperymentów przy wykorzystaniu metod gradacyjnych, Report of the Inst. of Comp. Science, Polish Academy of Sciences (2006)

    Google Scholar 

  14. Szczesny, W., Kowalczyk, T.: Grade differentiation between multivariate data sets, 2008 (to be published); Report of the Inst. of Comp. Science, Polish Acad. of Sciences (2007)

    Google Scholar 

  15. Ciok, A., Kowalczyk, T., Pleszczynska, E., Szczesny, W.: Algorithms of grade correspondence-cluster analysis. The Collected Papers of Theoretical and Applied Computer Science 7(1-4), 5–22 (1995)

    Google Scholar 

  16. TurboPower LockBox software library, http://sourceforge.net/projects/tplockbox/

  17. Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986), www.stephenwolfram.com/publications/articles/ca/85-cryptography/1/text.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Technical Sciences, University of Commerce, Kielce, Poland; and Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Marian Srebrny

  2. University of Commerce, Kielce, Poland

    Piotr Such

Authors
  1. Marian Srebrny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Such
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Systems Science, Stockholm University, Forum 100, 164 40, Kista, Sweden

    Anne Håkansson

  2. Institute of Informatics, Wroclaw University of Technology, Str. Janiszweskiego 11/17, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  3. Department of Computer Science, Franklin University, 201 South Grant Ave., 43215, Columbus, Ohio, USA

    Ronald L. Hartung

  4. School of Environment and Technology, Centre for SMART Systems, University of Brighton, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  5. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, SA, 5095, Mawson Lakes, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srebrny, M., Such, P. (2009). Statistical Strength of a Hybrid Cryptosystem on 2-D Cellular Automata with Nonaffine Rotations. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01665-3_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01664-6

  • Online ISBN: 978-3-642-01665-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation