Efficient Cryptosystem Based on Chaotic Sequences Sorting
| Autor: | J. S. Armand, Maaruf Ali, Eyebe Fouda, J. Yves Effa, Bertrand Bodo |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Theoretical computer science
business.industry Strategy and Management Mechanical Engineering Metals and Alloys Chaotic Lorenz system Encryption Pseudorandom permutation Industrial and Manufacturing Engineering Piecewise linear function Cipher Robustness (computer science) Cryptosystem business Algorithm Computer Science::Cryptography and Security Mathematics |
| Zdroj: | American Journal of Signal Processing. 2:15-22 |
| ISSN: | 2165-9354 |
| DOI: | 10.5923/j.ajsp.20120202.03 |
| Popis: | It is commonly known that mathematical representation of chaotic systems can be used as good candidates for information security. In this paper, we propose an image encryption algorithm based on the use of chaotic sequences sorted by ascending or descending order. The permutation key is defined as a distribution of indices derived from the sorting. This method allows us to easily achieve high performance of pseudorandom permutation through any type of chaotic systems using the true precision of the computer; high-speed encryption algorithm which could meet one of the multimedia encryp- tion specific requirements such as the real-time constraint and high robustness against statistical cryptanalysis. The effi- ciency of the proposed algorithm is studied in the cases of the piecewise linear chaotic map (PWLCM) and the hypercha- otic Lorenz system. Statistical analyses of the simulation results confirm a high security level of the proposed cipher. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|