On Searching Maximal-Period Dynamic LFSRs With at Most Four Switches

Lin WANG  Zhi HU  Deng TANG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.1   pp.152-154
Publication Date: 2019/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.152
Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)
dynamic linear feedback shift register,  maximal period,  switch,  probabilistic algorithm,  

Full Text: PDF>>
Buy this Article

Dynamic linear feedback shift registers (DLFSRs) are a scheme to transfer from one LFSR to another. In cryptography each LFSR included in a DLFSR should generate maximal-length sequences, and the number of switches transferring LFSRs should be small for efficient performance. This corresponding addresses on searching such conditioned DLFSRs. An efficient probabilistic algorithm is given to find such DLFSRs with two or four switches, and it is proved to succeed with nonnegligible probability.