文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Strict Avalanche Criterion over Finite Fields”, submitted
侵权投诉

Strict Avalanche Criterion over Finite Fields”, submitted

Abstract. Boolean functions on GF (2) which satisfy the Strict Avalanche Criterion (SAC) play an important role in the art of information security. In this paper, we extend the conception SAC to finite fields GF (p). A necessary and sufficient condition is

STRICTAVALANCHECRITERIONOVERFINITEFIELDS

YUANLIANDT.W.CUSICK

Abstract.BooleanfunctionsonGF(2)whichsatisfytheStrictAvalancheCriterion(SAC)playanimportantroleintheartofinformationsecurity.Inthispaper,weextendtheconceptionSACto nite eldsGF(p).Anecessaryandsu cientconditionisgivenbyusingspectralanalysis.Also,basedonaninterestingpermutationpolynomialtheorem,weprovevariousfactsabout(n 1)-thorderSACfunctionsonGF(p).Wealsoconstructmanysuchfunctions.

1.Introduction

Resilientfunctions,bentfunctionsandfunctionswhichsatisfySAChaveim-portantcryptographicapplications.SACwasintroducedbyWebsterandTavares[16]inconnectionwithastudyofthedesignofS-boxes.ABooleanfunctioninnvariablesissaidtosatisfySACifcomplementinganyoneoftheninputbitsresultsinchangingtheoutputbitwithprobabilityexactlyonehalf.Forr´e[5]extendedthisconceptionbyde ningthehigherorderSAC.ABooleanfunctionofnvariablessatis estheSACoforderk(SAC(k)),0≤k≤n 2,ifwheneverkinputbitsare xedarbitrarily,theresultingfunctionofn kvariablessatis esSAC.ThepropertiesofSACfunctionshavebeenwellstudied(see[1],[2],[3],[8],[9],[17]).Recently,CusickandYuan[4]describedamethodto ndk-thordersymmetricSACfunctionsforanyk,k≤n 2.Ontheotherhand,it’snaturaltoextendthevariouscryptographicconceptionsfromGF(2)toGF(p)orGF(p)n.Forexample,[14]and[19]studiedtheresilientfunctionsonGF(p).Also,[7],[11],[12]investi-gatedthegeneralizedbentfunctionsonGF(p)n.Inthispaper,we rstlyintroducethede nitionofSAConGF(p).Similarto[5],wegiveaspectralanalysis,andanecessaryandsu cientconditionforSACisgiven.Basedonaninterestingresultwhichwasindependentlyprovedbythreeresearchgroupsbetween1989and1990,weprovevariousfactsabout(n 1)-orderSAConGF(p).Incontrust,onGF(2)thehighestorderofSACisonlyn 2.Usingsomeelementarynumbertheory,weconstructmanySAC(n 1)functions.Section2willlistsomewellknownre-sultsaboutFouriertransform.Section3willintroducethede nitionofSACanddiscussitsspectralanalysis.Insection4,anexplanationofSACisgivenfromadi erentpointofview.Wegivethede nitionofhigherorderSACinsection5andaspectralanalysisisprovidedforSAC(1).Insection6weconstructmanySAC(n 1)functions.Someopenquestionsarelistedinsection7.

Keywordsandphrases.Fouriertransform,cryptography,Booleanfunctions,algebraicnormalform,strictavalanchecriterion,resilience,bentfunctions,permutationpolynomials, nite eld,quadraticresidue,Legendresymbol,

1

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email