Deakin University
Browse

Security Analysis of Some Diffusion Mechanisms Used in Chaotic Ciphers

Version 2 2024-06-06, 03:12
Version 1 2017-10-27, 10:24
journal contribution
posted on 2024-06-06, 03:12 authored by Leo ZhangLeo Zhang, Y Zhang, Y Liu, A Yang, G Chen
As a variant of the substitution–permutation network, the permutation–diffusion structure has received extensive attention in the field of chaotic cryptography over the last three decades. Because of the high implementation speed and nonlinearity over GF([Formula: see text]), the Galois field of two elements, mixing modulo addition/multiplication and Exclusive OR becomes very popular in various designs to achieve the desired diffusion effect. This paper reports that some diffusion mechanisms based on modulo addition/multiplication and Exclusive OR are not resistant to plaintext attacks as claimed. By cracking several recently proposed chaotic ciphers as examples, it is demonstrated that a good understanding of the strength and weakness of these crypto-primitives is crucial for designing more practical chaotic encryption algorithms in the future.

History

Journal

International Journal of Bifurcation and Chaos

Volume

27

Article number

ARTN 1750155

Pagination

1 - 13

Location

Singapore

ISSN

0218-1274

eISSN

1793-6551

Language

English

Publication classification

C Journal article, C1 Refereed article in a scholarly journal

Copyright notice

2017, World Scientific Publishing Company

Issue

10

Publisher

WORLD SCIENTIFIC PUBL CO PTE LTD