首页 | 本学科首页   官方微博 | 高级检索  
     检索      

CONSTRUCTION OF SAC PERMUTATIONS
作者姓名:GONG  Guang
作者单位: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)
摘    要:1.Intr0ductionandPreliminariesNonlinearpermutations0fGF(2")withstrongcryptographicpropertieshaveimportantaPplicationsincryptol0gysuchasDES-likeblockciphers,hushfunctionsandstreamciphers.TheStrictAvalancheCriterion(SAC)wasiotroducedbyWebsterandTaVresl2]inc…


CONSTRUCTION OF SAC PERMUTATIONS
GONG Guang.CONSTRUCTION OF SAC PERMUTATIONS[J].Journal of Systems Science and Complexity,1997(2).
Authors:GONG Guang
Abstract: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.
Keywords:The Strict Avalanche Criterion  Dickson polynomial  GMW function  exponential function  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号