m序列在GFq与GFq^n上关系研究一.pdfVIP

  • 0
  • 0
  • 约2.41万字
  • 约 28页
  • 2026-01-14 发布于北京
  • 举报

RelationshipsBetween푚-SequencesoverGF(푞)and

GF(푛

푞)(I)

BasicsofLFSRSequences

KefeiChen

LabofCryptographyInformationSecurity

ShanghaiJiaotongUniversity

E-mail:kfchen@

Introduction

∙Pseudo-randomsequencehavebeenwidelyusedin

communicationandcryptology.

∙Any(pseudo-)randomsequenceusedinpracticalsystemis

generatedbyamachine,acomputeroradevice,

∙thosedevicesarecalled(pseudo-)randomsequence

generator,orPRSG

∙PRSGmaybelinearfeedbackshiftregister,finiteautomata

orsomefeedbackmodeusingblockcipher.

ModelofStreamCipher

∙Thedesignofstreamciphercryptosystemsistodesignthe

pseudorandomsequencegeneratorswithgood

randomnessproperties,orequivalently,unpredictability.

∙Modelforastreamcipher:

∘originally,bothand

arelinesofbits.So,this

isabitbybitencryption

model.

∘newtechnologyallows

thatonemayuseeitherthebuffertechniqueorakey

streamconsistingofbytes,orwords,orany

-ary

signals.

∙Thesecurityofstreamcipherisdeterminedbythe

randomnesspropertiesoftheemployedPSG.

푚-

GolombsRandomnessPostulates

G1:Forbinarysequences,thenumberofzerosandthenumber

ofonesareasequalaspossibleperperiod,i.e.,bothare

/2ifisevenand

文档评论(0)

1亿VIP精品文档

相关文档