Algorithm research of generating S-box based on chaotic system

被引:0
|
作者
Zang, Hongyan [1 ]
Min, Lequan [1 ]
Wong, Kwok-Wo [2 ]
机构
[1] Univ Sci & Technol Beijing, Dept Math & Mech, Beijing 100083, Peoples R China
[2] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China
关键词
chaotic system; S-box; linear probability; differential probability; MAPS; CIPHERS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
S-boxes are the only nonlinear components in many encryption algorithms, whose intension decides the security strength of the whole algorithm. By theoretical analysis and statistic tests, there is evidence showing that large S-boxes have better cryptographic properties than small ones. But they are harder to design and implement. Now the 8x8 S-box is popular.. This paper proposes a dynamic S box generation algorithm based on chaotic maps. Theoretical analysis and statistic tests show that designed S-boxes have sound linear probability and differential probability. These S-boxes offer the nonlinear resouce for further design of cryptographic algorithms.
引用
收藏
页码:319 / 322
页数:4
相关论文
共 12 条
  • [1] Biham E., 1991, Journal of Cryptology, V4, P3, DOI 10.1007/BF00630563
  • [2] An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps
    Chen, Guo
    Chen, Yong
    Liao, Xiaofeng
    [J]. CHAOS SOLITONS & FRACTALS, 2007, 31 (03) : 571 - 579
  • [3] Chaos and cryptography: Block encryption ciphers based on chaotic maps
    Jakimoski, G
    Kocarev, L
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2001, 48 (02) : 163 - 169
  • [4] Kocarev L., 2001, IEEE Circuits and Systems Magazine, V1, P6, DOI 10.1109/7384.963463
  • [5] Kocarev L., 2006, DISCRETE CHAOS I THE, V53, P1302
  • [6] Chaotic block ciphers: From theory to practical algorithms
    Masuda, Naoki
    Jakimoski, Goce
    Aihara, Kazuyuki
    Kocarev, Ljupco
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2006, 53 (06) : 1341 - 1352
  • [7] Mataui M, 1998, LINEAR CRYPTANALYSIS, P386
  • [8] Ou C-M, 2008, IEEE COMPUTATION MAY, P54
  • [9] Cryptographically secure substitutions based on the approximation of mixing maps
    Szczepanski, J
    Amigó, JM
    Michalek, T
    Kocarev, L
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (02) : 443 - 453
  • [10] A method for designing dynamical S-boxes based on discretized chaotic map
    Tang, GP
    Liao, XF
    [J]. CHAOS SOLITONS & FRACTALS, 2005, 23 (05) : 1901 - 1909