| Autor: |
Verma, Deepak Kumar, Rani, Mamta, Tyagi, Rajesh Kumar, Sagar, Bharat Bhushan |
| Zdroj: |
Journal of Discrete Mathematical Sciences and Cryptography; November 2019, Vol. 22 Issue: 8 p1383-1392, 10p |
| Abstrakt: |
AbstractChaotic cryptosystems are using for securing text data and images over the network. In 1998, M S Baptista suggested a chaotic cryptosystem based on partitioning the visiting interval of chaotic orbits of the logistic map, which attracted much attention. In 2002, K W Wong presented a prompt chaotic cryptosystem based onthe dynamic lookup table using a logistic maptoimprove the security in Baptista type cryptosystem. In 2004, Alvarezet al. [1] found that Wong’s cryptosystem [15] is not resistant tochosen-plaintext and known-plaintext attacks. To improve the security of the dynamic lookup table, weintroduce an alternate dynamic lookup table that will be more secure in context to the existing system. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
