Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Chaotic Cipher Using Arnolds and Duffings Map
verfasst von : Mina Mishra, V. H. Mankar
Erschienen in: Advances in Computer Science, Engineering & Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper deals with the application of concept of identifiability based on output equality approach on chaotic ciphers developed using 2-D chaotic maps, Duffings and Arnolds Cat map and they are named as Duffings and Arnold’s Cat, according to the map used. Due to the less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. Thus, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is an exhaustive search. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values. The ciphers are also analyzed for plaintext sensitivity and key sensitivity for its validity to provide security.