Symmetric cryptosystem based on skew tent map
| Autor: | Ruben Vazquez-Medina, Jose Alejandro Diaz-Mendez, Leonardo Palacios-Luengas, Guillermo Delgado-Gutiérrez |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Computer Networks and Communications Computer science 02 engineering and technology Encryption 01 natural sciences 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Media Technology Cryptosystem Randomness tests Security level 010301 acoustics Avalanche effect Computer Science::Cryptography and Security Symmetric cryptosystem Pseudorandom number generator business.industry Key space Hardware and Architecture Known-plaintext attack Personal computer 020201 artificial intelligence & image processing Confusion and diffusion business Algorithm Software |
| Zdroj: | Multimedia Tools and Applications. 77:2739-2770 |
| ISSN: | 1573-7721 1380-7501 |
| DOI: | 10.1007/s11042-017-4375-9 |
| Popis: | This paper presents an efficient symmetric cryptosystem based on a non–scaled nor discretized skew tent map (STM); this system is implemented in a USB device interacting with a software module in a personal computer. The USB device uses a dedicated processor that contains a pseudorandom numbers generator (PRNG) to generate uniformly distributed chaotic sequences that satisfy the randomness tests defined in the NIST 800–22SP guide. The software module uses these sequences with substitution and rotation functions to produce cryptograms with confusion and diffusion properties, high level of security, high avalanche effect and high encryption and decryption speed. A variety of analysis and tests has been carried out to prove the security and the validity of the algorithm. Some of the evaluated characteristics are the statistical behavior, correlation, strength against differential attack, entropy, key space, key sensitivity, mutual information, encryption and decryption speed, and randomness test. Additionally, we analyze the structure of the proposed cryptosystem to find some security vulnerabilities; in this part, the analysis are based on known plaintext attack used in the literature on chaotic cryptosystems. In this way, the realized analysis shows that the performance of the proposed algorithm offers a high security level. Mutual information is calculated as evidence of this level of security. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink