Skip to main content
SpringerLink
Log in

Cryptosystems Based on Chaos Theory

  • Conference paper
  • First Online:
Book cover Chaos, Complexity and Leadership 2013

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Abstract

This paper reviews some developments in cryptographic primitives based on chaotic systems; such as Mandelbrot set, Julia set, and logistic map. However we classified the reviewed chaotic cryptosystems into two categorizes; public-key and nonpublic key cryptosystems. Chaos system has attracted much attention in the field of cryptography due to its properties such as being deterministic and sensitive to the initial values. As it will be indicated in the following sections, researchers are urgently looking for new public-key primitives (encryption, key sharing and digital signature) and nonpublic key system (Hash function) which might be able to replace standard cryptographic algorithms. In the surveyed nonpublic key system, we are showing the latest hash function (chaos Hash Algorithm 1 (CHA-1)) which is based on chaos theory. CHA-1 accepts messages with length less than 280 bits and produces a unique message digest of length 160-bit. As well as in the public-key systems, the creation of the Fractal based public-key primitives is possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. The surveyed chaotic cryptosystems are attractive alternative to the traditional number theory based cryptosystems.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Institutional subscriptions

References

  • Alia M, Samsudin A (2007a) New key exchange protocol based on Mandelbrot and Julia Fractal sets. Int J Comput Sci Netw Secur 7(2):302–307

    Google Scholar 

  • Alia M, Samsudin A (2007b) A new public-key cryptosystem based on Mandelbrot and Julia Fractal Sets. Asian J Inf Technol, AJIT 6(5):567–575

    Google Scholar 

  • Alia M, Samsudin A (2007c) Generalized scheme for fractal based digital signature (GFDS). Int J Comput Sci Netw Secur 7(7):99–104

    Google Scholar 

  • Branovic R, Martinelli GE (2003) Memory performance of public-key cryptography methods in mobile environments. ACM SIGARCH workshop on memory performance: dealing with applications, systems and architecture (MEDEA-03), New Orleans, LA, USA pp 24–31

    Google Scholar 

  • Burnett S, Paine S (2001) RSA security’s official guide to cryptography. Osborne/McGraw-Hill, Berkeley

    Google Scholar 

  • David C, Antwerpen HV (1990) Undeniable signatures. Crypto’89, LNCS, vol 435. Springer, Berlin, pp 212–216

    Google Scholar 

  • Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theor IT-22: 644–654

    Google Scholar 

  • ElGamal T (1985) A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theor, IT 31(4):469–472

    Article  MATH  MathSciNet  Google Scholar 

  • Franzblau A (1958) Primer of statistics for non-statisticians, 4th edn. Harcourt, Brace, New York

    Google Scholar 

  • Giffin N (2006) Fractint. TRIUMF Project at the university of British Columbia campus in vancouver B.C. Canada http://spanky.triumf.ca/www/fractint/fractint.html, Accessed 22.02.2014

  • Kaoru K, Ogata W (1999) Efficient rabin-type digital signature scheme. Des, Codes Crypt 16(1):53–64

    Article  MATH  Google Scholar 

  • Koblitz N (1987) Elliptic curve cryptosystems. Math Comput, pp 203–209

    Google Scholar 

  • Law Public (2001) Electronic signatures in global and national commerce act. Weekly Compilation Presidential Doc 36:106–229

    Google Scholar 

  • Lazareck L, Verch G, Peter JF (2001) Fractals in circuits. IEEE Conf 1:589–594

    Google Scholar 

  • Mandelbrot BB (1982) The fractal geometry of nature. W. H. Freeman and Company, New York

    Google Scholar 

  • Menezes A, Van Oorschot P, Vanstone S (1996) Handbook of applied cryptography. CRC Press 516:4–15

    Google Scholar 

  • Michael M (2000) Julia Jewels: an exploration of Julia Sets. McGoodwin net

    Google Scholar 

  • National Security Agency Announcing (2002) The secure hash standard. Federal Information Processing Standards Publication 180-2

    Google Scholar 

  • NIST (1995) Secure hash standard. Federal information processing standard, FIPS-180-1

    Google Scholar 

  • Patrzalek E (2006) Fractals: useful beauty general introduction to fractal geometry. Stan Ackermans Institute, IPO, Centre for User-System Interaction, Eindhoven University of Technology. http://fractal.org/Bewustzijns-Besturings-Model/Fractals-Useful-Beauty.htm. Accessed 25.01.2014

  • Peitgen O, Jrgens H, Saupe D (1992) Fractals for the classroom, part one, introduction to fractals and chaos. Springer, New York

    MATH  Google Scholar 

  • Pete (2007) Mandelbrot and Julia sets, the math forum, http://mathforum.org/dr.math/. Accessed 22.01.2014

  • Rabin MO (1979) Digitalized signatures and public-key functions as intractable as factorization. The ACM Digital Library. Technical Report. UMI Order Number: TR-212., Massachusetts Institute of Technology

    Google Scholar 

  • Rivest R (1992) The MD5 message-digest algorithm. Network information center RFC 1321, Menlo Park, pp 1–21

    Google Scholar 

  • Rivest RA, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126

    Article  MATH  MathSciNet  Google Scholar 

  • Ruhl M, Hartenstein H (1997) Optimal fractal coding is NP-Hard. In: Storer JA, Cohn M (eds) Proceedings DCC97 data compression conference, IEEE Computer Society Press

    Google Scholar 

  • Spencer S (1997) (nd) About fractals. http://avatargraphics.com/fractalland/fractalfaq.html. Accessed 25.01.2014

  • Wang X (2006) Wikipedia, The Free Encyclopedia http://en.wikipedia.org/w/index.php?title=Xiaoyun_Wang&oldid=39379778

  • Wang X, Yin YL, Yu H (2005) Finding collisions in the full SHA-1. In: Shoup V (ed) Advances in cryptology—CRYPTO’05. Lecture notes in computer science, vol 3621. Springer, Berlin, pp 17–36

    Google Scholar 

  • Winter D (2007) The mandelbrot set. Course online. Department of Mathematics. University of Michigan, USA

    Google Scholar 

  • Zheng Y, Pieprzyk J, Haval (1993) A one-way hashing algorithm with variable length of output. In: Advances in cryptology—AUSCRYPT’92. Lecture notes in computer science, vol 718. Springer, Berlin, pp 83–104

    Google Scholar 

Download references

Acknowledgments

The authors would like to thank Al Zaytoonah University of Jordan for supporting this study.

Author information

Authors and Affiliations

  1. Al Zaytoonah University of Jordan, Amman, Jordan

    Mohammad Ahmad Alia

Authors
  1. Mohammad Ahmad Alia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Ahmad Alia .

Editor information

Editors and Affiliations

  1. International Science Association, Ankara, Turkey

    Şefika Şule Erçetin

  2. International Science Association, Serdang, Turkey

    Santo Banerjee

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Alia, M.A. (2015). Cryptosystems Based on Chaos Theory. In: Erçetin, Ş., Banerjee, S. (eds) Chaos, Complexity and Leadership 2013. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-09710-7_11

Download citation

Publish with us

Policies and ethics

Search

Navigation