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.
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
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Lin WANG, Zhi HU, Deng TANG, "On Searching Maximal-Period Dynamic LFSRs With at Most Four Switches" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 1, pp. 152-154, January 2019, doi: 10.1587/transfun.E102.A.152.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.152/_p
Copy
@ARTICLE{e102-a_1_152,
author={Lin WANG, Zhi HU, Deng TANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Searching Maximal-Period Dynamic LFSRs With at Most Four Switches},
year={2019},
volume={E102-A},
number={1},
pages={152-154},
abstract={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.},
keywords={},
doi={10.1587/transfun.E102.A.152},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - On Searching Maximal-Period Dynamic LFSRs With at Most Four Switches
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 152
EP - 154
AU - Lin WANG
AU - Zhi HU
AU - Deng TANG
PY - 2019
DO - 10.1587/transfun.E102.A.152
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2019
AB - 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.
ER -