CONSTRUCTION OF SAC PERMUTATIONS

作     者：GONG Guang (Department of Applied Mathematics, University of Electronic Science and Technology of China, Chengdu 610054,China) DAI Zongduo (State Key Laborotory of Infrmation Security, the Graduate School,Academia Sinica, Beijing 100039, China) 

作者机构：电子科技大学应用数学系 四川 成都 中国科学技术大学北京研究生院 信息安全国家重点实验室 北京 

出 版 物：《Systems Science and Mathematical Sciences》 (系统科学与复杂性学报(英文版))

年 卷 期：1997年第10卷第2期

页      面：120-121,123-128页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：国家自然科学基金 

主　　题：The Strict Avalanche Criterion Dickson polynomial GMW function exponential function. 

摘      要：Nonlinear permutations of GF(2n) with strong cryptographic properties have important applications in cryptology such as DES-like block ciphers, hush functions and stream ciphers. In paPer [1], we proved that the exponential function can provide a class of permutations satisfying the Strict Avalanche Criterion (SAC permutations) with algebraic nonlinear degree 2. In this paper, we further construct three classes of SAC permutations that are derived from the Dickson polynomials, GMW functions and the exponential functions with maximal algebraic nonlinear degree, respectively.