The Great Trinomial Hunt

The Great Trinomial Hunt

ID:37583267

大小:234.38 KB

页数:7页

时间:2019-05-25

The Great Trinomial Hunt_第1页
The Great Trinomial Hunt_第2页
The Great Trinomial Hunt_第3页
The Great Trinomial Hunt_第4页
The Great Trinomial Hunt_第5页
资源描述:

《The Great Trinomial Hunt》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库

1、TheGreatTrinomialHuntRichardP.BrentandPaulZimmermannIntroductionwhererandsaregivenpositiveintegers,r>s>0,Atrinomialisapolynomialinonevariablewiththreeandtheinitialvaluesz0;z1;:::;zr1arealsogiven.73Therecurrencethende nesalltheremainingtermsnonzeroterms,forexampleP=6x+3x5.Ifthe

2、coecientsofapolynomialP(inthiscase6;3;5)arezr;zr+1;:::inthesequence.insomeringor eldF,wesaythatPisapolynomialItiseasytobuildhardwaretoimplementtheoverF,andwriteP2F[x].Theoperationsofadditionrecurrence(1).AllweneedisashiftregistercapableofandmultiplicationofpolynomialsinF[x]are

3、de nedstoringrbits,andacircuitcapableofcomputingtheintheusualway,withtheoperationsoncoecientsadditionmod2(equivalently,theexclusiveor")oftwoperformedinF.bitsseparatedbyrspositionsintheshiftregisterClassicallythemostcommoncasesareF=Z;Q;Randfeedingtheoutputbackintotheshiftregis

4、ter.ThisorC,respectivelytheintegers,rationals,realsorisillustratedinFigure1forr=7,s=3.complexnumbers.However,polynomialsover nite eldsarealsoimportantinapplications.Werestrictourattentiontopolynomialsoverthesimplest nite!!!!!! eld:the eldGF(2)oftwoelements,usuallywrittenas0and1.

5、The eldoperationsofadditionand!!!multiplicationarede nedasforintegersmodulo2,so!+!0+1=1,1+1=0,01=0,11=1,etc.Animportantconsequenceofthede nitionsisthat,!forpolynomialsP;Q2GF(2)[x],wehaveOutput222(P+Q)=P+QFigure1:Hardwareimplementationofbecausethecrossterm"2PQvanishes.Highscho

6、olzn=zn3+zn7mod2.algebrawouldhavebeenmucheasierifwehadusedpolynomialsoverGF(2)insteadofoverR!Therecurrence(1)lookssimilartothewell-knownTrinomialsoverGF(2)areimportantincryptogra-Fibonaccirecurrencephyandrandomnumbergeneration.Toillustratewhythismightbetrue,considerasequence(z

7、0;z1;z2;:::)Fn=Fn1+Fn2;satisfyingtherecurrenceindeedtheFibonaccinumbersmod2satisfyourre-(1)zn=zns+znrmod2;currencewithr=2,s=1.Thisgivesasequence(0;1;1;0;1;1;:::)withperiod3:notveryinteresting.RichardBrentisaprofessorattheMathematicalSciencesHowever,ifwetakerlargerwecangetmuc

8、hlongerInstituteoftheAustralianNationalUniversi

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。