arXiv · 0907.3177
Breaking a Chaotic Cryptographic Scheme Based on Composition Maps
Abstract
Recently, a chaotic cryptographic scheme based on composition maps was proposed. This paper studies the security of the scheme and reports the following findings: 1) the scheme can be broken by a differential attack with $6+\lceil\log_L(MN)\rceil$ chosen-plaintext, where $MN$ is the size of plaintext and $L$ is the number of different elements in plain-text; 2) the scheme is not sensitive to the changes of plaintext; 3) the two composition maps do not work well as a secure and efficient random number source.
Explore related subjects
Keep this discovery
Chengqing Li, David Arroyo, Kwok-Tung Lo. 2009-07-18. Breaking a Chaotic Cryptographic Scheme Based on Composition Maps. https://doi.org/10.1142/s0218127410027192
Cite the original work for its findings. Save a collection to share your selection of sources.