On Bent and Hyper-bent Multiple-valued Functions

被引:0
|
作者
Moraga, Claudio [1 ]
Stankovic, Milena [2 ]
Stankovic, Radomir [2 ]
Stojkovic, Suzana [2 ]
机构
[1] TU Dortmund Univ, D-44221 Dortmund, Germany
[2] Univ Nis, Fac Elect Engn, Nish 18000, Serbia
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper is a contribution to the study of multiple-valued bent and hyper-bent functions in GF(p), p prime, p > 2. Special care has been given to the introduction of a sound formalism to allow giving formal proof of some properties and to characterize bent and hyper-bent functions. It is shown that multiple-valued bent functions, unlike in the binary case, may have an odd or an even number of arguments. A class of bent functions, called strict bent is introduced and its characterization is given. Hyper-bent functions are even more non-linear than bent functions. Hyper-bent p-valued functions are studied and their characterization is formalized using only simple algebra and basics of finite fields. Special classes of hyper-bent functions, called strict hyper-bent and strong hyper-bent are defined. A new representation of the Maiorana theorem is introduced, which allows an efficient generation of bent functions with a large even number of arguments. It is shown that there are at least 708,588 four place ternary strict bent functions, 486 two place ternary strict bent, 18 of which are hyper-bent, and the 100 one place five-valued functions that are bent, are also strict bent, and 20 are both strict and strong hyper-bent.
引用
收藏
页码:327 / 354
页数:28
相关论文
共 50 条
  • [11] Hyper-bent Boolean Functions and Evolutionary Algorithms
    Mariot, Luca
    Jakobovic, Domagoj
    Leporati, Alberto
    Picek, Stjepan
    [J]. GENETIC PROGRAMMING, EUROGP 2019, 2019, 11451 : 262 - 277
  • [12] A new class of bent and hyper-bent Boolean functions in polynomial forms
    Mesnager, Sihem
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2011, 59 (1-3) : 265 - 279
  • [13] New characterizations and construction methods of bent and hyper-bent Boolean functions
    Mesnager, Sihem
    Mandal, Bimal
    Tang, Chunming
    [J]. DISCRETE MATHEMATICS, 2020, 343 (11)
  • [14] A new class of bent and hyper-bent Boolean functions in polynomial forms
    Sihem Mesnager
    [J]. Designs, Codes and Cryptography, 2011, 59 : 265 - 279
  • [15] A class of hyper-bent functions and Kloosterman sums
    Tang, Chunming
    Qi, Yanfeng
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (05): : 647 - 664
  • [16] A class of hyper-bent functions and Kloosterman sums
    Chunming Tang
    Yanfeng Qi
    [J]. Cryptography and Communications, 2017, 9 : 647 - 664
  • [17] Recent Results on Bent and Hyper-bent Functions and Their Link With Some Exponential Sums
    Mesnager, Sihem
    [J]. 2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
  • [18] Bent and hyper-bent functions over a field of 2l elements
    Kuzmin, A. S.
    Markov, V. T.
    Nechaev, A. A.
    Shishkin, V. A.
    Shishkov, A. B.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2008, 44 (01) : 12 - 33
  • [19] Generalized hyper-bent functions over GF(p)
    Youssef, A. M.
    [J]. DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) : 1066 - 1070
  • [20] An efficient characterization of a family of hyper-bent functions with multiple trace terms
    Flori, Jean-Pierre
    Mesnager, Sihem
    [J]. JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2013, 7 (01) : 43 - 68