Security Evaluation for a Class of Block Ciphers Based on Chaotic Maps
Wen Zhang
Abstract
Wen Zhang
Abstract
The security evaluation of a class of block ciphers based on chaotic maps against differential and linear attacks is studied. If the round function is bijective and its maximum differential and linear characteristic probabilities are p and q respectively, the upper bounds of maximum differential and linear characteristic probabilities for r rounds are pr-1and qr-1 respectively.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The security evaluation of a class of block ciphers based on chaotic maps against differential and linear attacks is studied. If the round function is bijective and its maximum differential and linear characteristic probabilities are p and q respectively, the upper bounds of maximum differential and linear characteristic probabilities for r rounds are pr-1and qr-1 respectively.
Key concepts: Block cipher, Computer science, Differential (mechanical device), S-box, Linear cryptanalysis, Bijection, Differential cryptanalysis, Class (philosophy)