Cryptanalysis of a cryptosystem based on chaotic Baker map | ||||
| The International Conference on Mathematics and Engineering Physics | ||||
| Article 4, Volume 4, International Conference on Mathematics and Engineering Physics (ICMEP-4), May 2008, Page 1-9 PDF (930.95 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/icmep.2008.29848 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Hassan El-Hamouly; Gamal Mabrouk; Haitham Shabana | ||||
| Abstract | ||||
| Abstract Recently, the idea of using chaos to design digital ciphers and analog secure communication systems has provoked a great deal of research efforts since early 1990s. Meanwhile, security analysis of various proposed chaotic cryptosystems also attracts increasing attention, and some chaotic cryptosystems have been found insecure. This paper discusses the security weaknesses of a proposed cryptographic algorithm with chaos at the physical level. Some simple linear maps have a well known chaotic behavior in specific interval. But when studding their long-time dynamics with computers, the result is different from the true long-time chaotic dynamics, even in a high-precision floating-point arithmetic. This phenomenon will affect the security of a proposed cryptosystem for practical implementation with finite computing precision and for the use of the iteration number n as the secret key. In addition, we present some possible improvements to the encryption scheme to obtain higher security. | ||||
|
Statistics Article View: 112 PDF Download: 180 |
||||
