The search functionality is under construction.
The search functionality is under construction.

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

Lin WANG, Zhi HU, Deng TANG

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.1 pp.152-154
Publication Date
2019/01/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E102.A.152
Type of Manuscript
Special Section LETTER (Special Section on Cryptography and Information Security)
Category

Authors

Lin WANG
  Science and Technology on Communication Security Laboratory
Zhi HU
  Central South University
Deng TANG
  Southwest Jiaotong University,the Guangxi Key Laboratory of Cryptography and Information Security

Keyword