TY - JOUR
T1 - Discrete Lyapunov Exponent and Differential Cryptanalysis
AU - Jakimoski, G.
AU - Subbalakshmi, K. P.
PY - 2007/6/7
Y1 - 2007/6/7
N2 - Partly motivated by the developments in chaos-based block cipher design, a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice was recently proposed. We explore the relation between the discrete Lyapunov exponent and the maximum differential probability of a bijective mapping (i.e., an S-box or the mapping defined by a block cipher). Our analysis shows that “good” encryption transformations have discrete Lyapunov exponents close to the discrete Lyapunov exponent of a mapping that has a perfect nonlinearity. The converse does not hold.
AB - Partly motivated by the developments in chaos-based block cipher design, a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice was recently proposed. We explore the relation between the discrete Lyapunov exponent and the maximum differential probability of a bijective mapping (i.e., an S-box or the mapping defined by a block cipher). Our analysis shows that “good” encryption transformations have discrete Lyapunov exponents close to the discrete Lyapunov exponent of a mapping that has a perfect nonlinearity. The converse does not hold.
KW - Block ciphers
KW - Lyapunov exponent
KW - chaotic maps
KW - differential crypt-analysis
KW - discrete chaos
KW - maximum differential probability (DP)
UR - http://www.scopus.com/inward/record.url?scp=34347397153&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34347397153&partnerID=8YFLogxK
U2 - 10.1109/TCSII.2007.892214
DO - 10.1109/TCSII.2007.892214
M3 - Article
AN - SCOPUS:34347397153
SN - 1549-7747
VL - 54
SP - 499
EP - 501
JO - IEEE Transactions on Circuits and Systems II: Express Briefs
JF - IEEE Transactions on Circuits and Systems II: Express Briefs
IS - 6
ER -