摘要
Klapper(1994)showedthatthereexistsaclassofgeometricsequenceswiththemaximalpossiblelinearcomplexitywhenconsideredassequencesoverGF(2),butthesesequenceshaveverylowlinearcomplexitieswhenconsideredassequencesoverGF(p)(pisanoddprime).ThislinearcomplexityofabinarysequencewhenconsideredasasequenceoverGF(p)iscalledGF(p)complexity.ThisindicatesthatthebinarysequenceswithhighGF(2)linearcomplexitiesareinadequateforsecurityinthepracticalapplication,while,theirGF(p)linearcomplexitiesarealsoequallyimportant,evenwhentheonlyconcerniswithattacksusingtheBerlekamp-Masseyalgorithm[Massey,J.L.,Shift-registersynthesisandbchdecoding,IEEETransactionsonInformationTheory,15(1),1969,122–127].Fromthisperspective,inthispapertheauthorsstudytheGF(p)linearcomplexityofHall’ssexticresiduesequencesandsomeknowncyclotomic-set-basedsequences.
出版日期
2016年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
