The search functionality is under construction.

IEICE TRANSACTIONS on Fundamentals

Construction of Permutations and Bent Functions

Shanqi PANG, Miao FENG, Xunan WANG, Jing WANG

  • Full Text Views

    0

  • Cite this

Summary :

Bent functions have been applied to cryptography, spread spectrum, coding theory, and combinatorial design. Permutations play an important role in the design of cryptographic transformations such as block ciphers, hash functions and stream ciphers. By using the Kronecker product this paper presents a general recursive construction method of permutations over finite field. As applications of our method, several infinite classes of permutations are obtained. By means of the permutations obtained and M-M functions we construct several infinite families of bent functions.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.3 pp.604-607
Publication Date
2018/03/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E101.A.604
Type of Manuscript
LETTER
Category
Cryptography and Information Security

Authors

Shanqi PANG
  Henan Normal University
Miao FENG
  Henan Normal University
Xunan WANG
  Henan Normal University
Jing WANG
  Henan Normal University

Keyword