COMPARISON OF RANDOM S-BOX GENERATION METHODS

被引:24
作者
Lambic, Dragan [1 ]
Zivkovic, Miodrag [2 ]
机构
[1] Univ Novi Sad, Fac Educ, Sombor, Serbia
[2] Univ Belgrade, Matemat Fak, Beograd, Serbia
来源
PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD | 2013年 / 93卷 / 107期
关键词
S-box; random permutation; Walsh transform;
D O I
10.2298/PIM1307109L
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Random bijective S-box generation methods are considered. An alternative S-box generation method by forming compositions of permutations from some fixed set is proposed. Experiments show that the rate of acceptable S-boxes for all the methods considered is essentially the same. The advantage of the composition method is an obvious parametrization, With the potentially large key space.
引用
收藏
页码:109 / 115
页数:7
相关论文
共 19 条
  • [1] ADAMS C, 1990, LECT NOTES COMPUT SC, V435, P612
  • [2] [Anonymous], ART COMPUTER PROGRAM
  • [3] Efficient and simple method for designing chaotic S-boxes
    Asim, Muhammad
    Jeoti, Varun
    [J]. ETRI JOURNAL, 2008, 30 (01) : 170 - 172
  • [4] Biham E., 1991, Journal of Cryptology, V4, P3, DOI 10.1007/BF00630563
  • [5] A novel heuristic method for obtaining S-boxes
    Chen, Guo
    [J]. CHAOS SOLITONS & FRACTALS, 2008, 36 (04) : 1028 - 1036
  • [6] 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
  • [7] Cusick TW., 2009, Cryptographic Boolean Functions and Applications
  • [8] 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
  • [9] Kazlauskas K, 2009, INFORMATICA-LITHUAN, V20, P23
  • [10] Keliher L, 2005, LECT NOTES COMPUT SC, V3373, P42