Special Section on Cryptography and Information Security
On Searching Maximal-Period Dynamic LFSRs With at Most Four Switches
2019 年 E102.A 巻 1 号 p. 152-154
詳細
2019 年 E102.A 巻 1 号 p. 152-154
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.
