A chaotic encryption algorithm: Robustness against brute-force attack

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An encryption method is proposed that uses self-invertible matrix, modular function, Non-Linear shift register and the chaotic map known as Logistic. Parameter of Logistic map act as secret key. As chaotic system used in this algorithm is 1-D system, the key space is lesser than 2 100 which shows that the method is weak against Brute-force attack but identifiability property of the selected key from key space assures its strength against the attack. Key sensitivity and plaintext sensitivity of the key chosen from key space for the algorithm is analyzed and its strength against known-plaintext attack is also tested and conclusions are derived. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Mishra, M., & Mankar, V. H. (2012). A chaotic encryption algorithm: Robustness against brute-force attack. In Advances in Intelligent and Soft Computing (Vol. 167 AISC, pp. 169–179). https://doi.org/10.1007/978-3-642-30111-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free