Advertisement

Efficient Implementation Baptista Type Chaotic Cryptosystem with Encoding Scheme

  • Z. Mahad
  • M. R. K. Ariffin
  • M. A. Daud
Conference paper
Part of the Springer Proceedings in Complexity book series (SPCOM)

Abstract

In 1998, Baptista introduced a chaotic symmetric cryptosystem utilizing the ergodic property of chaotic maps (Baptista, Phys Lett A 240:50, 1998). By using this scheme, it is able to produce different cipher values for the same plaintext values. Since then, many cryptosystems based on Baptista’s work has been proposed. However, over the years research has shown that this cryptosystem is not secure to an attack called the One-Time-Pad (OTP) attack. In between 2008 and 2010, Ariffin attempted to modify the cryptosystem with the theoretical explanation in order to secure it (Ariffin and Noraini, Phys Lett A 327:427–430, 2008; Ariffin and Noraini (2010) Mathematical treatment for constructing a countermeasure against the one time pad attack. In: Chaos synchronization and cryptography for secure communications: applications for encryption. IGI Global, Hershey, pp 463–475). In the work by Ariffin et al. (2012, A new direction in utilization of chaotic fractal functions for cryptosystems. In: Applications of chaos and nonlinear dynamics in science and engineering, vol 2. Understanding complex systems. Springer, pp 233–248) they enhanced their earlier technique to ensure that the Baptista type cryptosystem is not prone towards One-Time-Pad (OTP) attack (Ariffin et al. (2012) A new direction in utilization of chaotic fractal functions for cryptosystems. In: Applications of chaos and nonlinear dynamics in science and engineering, vol 2. Understanding complex systems. Springer, pp 233–248). In this paper, our objective is to enhance the chaotic cryptosystem scheme proposed by Ariffin in 2012 in order to be practically implemented. We will utilize a new encoding scheme to further enhance the mechanism of relaying such data through networks.

Keywords

Chaotic System Matrix Multiplication Code Word Input String Ergodic Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Alvarez G, Montoya F, Romera M, Pastor G (2004) Cryptanalysis of dynamic look-up table based chaotic cryptosystem. Phys Lett A 326:211–218MathSciNetADSCrossRefzbMATHGoogle Scholar
  2. Ariffin MRK, Noraini MSM (2008) Modified Baptista type chaotic cryptosystem via matrix secret key. Phys Lett A 327:427–430Google Scholar
  3. Ariffin MRK, Noraini MSM (2010) Mathematical treatment for constructing a countermeasure against the one time pad attack. In: Chaos synchronization and cryptography for secure communications: applications for encryption. IGI Global, Hershey, pp 463–475Google Scholar
  4. Ariffin MRK, Al-Saidi NMG, Said MRM, Mahad Z, Daud MA (2012) A new direction in utilization of chaotic fractal functions for cryptosystems. In: Applications of chaos and nonlinear dynamics in science and engineering, vol 2. Understanding complex systems. Springer, pp 233–248Google Scholar
  5. Baptista MS (1998) Cryptography with chaos. Phys Lett A 240:50MathSciNetADSCrossRefzbMATHGoogle Scholar
  6. Burrows M, Wheeler DJ (1994) A block-sorting lossless data compression algorithm. SRC Res Rep 124:1–18Google Scholar
  7. Ferreira AJ, Oliveira AL, Figueiredo MAT (2009) On the suitability of suffix arrays for Lempel-Ziv data compression. In: DCC, p 444Google Scholar
  8. Hellebrand S, Wurtenberger A (2002) Alternating run-length coding – a technique for improved test data compression. In: Handout 3rd IEEE international workshop on test resource partitioning, BaltimoreGoogle Scholar
  9. Pathak S, Singh S, Singh S, Jain M, Sharma A (2011) Data compression scheme of dynamic Huffman code for different languages. In: 2011 international conference on information and network technology, vol 4, pp 201–205Google Scholar
  10. Shannon CE (1949) Communication theory of secrecy systems. Bell Syst Tech J 28:656MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Al-Kindi Cryptography Research Laboratory, Institute for Mathematical ResearchUniversiti Putra MalaysiaSerdangMalaysia
  2. 2.Mathematics Department, Faculty of ScienceUniversiti Putra MalaysiaSerdangMalaysia

Personalised recommendations