Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum length. Then, we consider NFSRs with k-monomial feedback functions and focus on two extreme cases where k=4 and k=2n-1. We study construction methods for these special cases.
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
Çağdaş ÇALIK, Meltem SÖNMEZ TURAN, Ferruh ÖZBUDAK, "On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 6, pp. 1226-1231, June 2010, doi: 10.1587/transfun.E93.A.1226.
Abstract: Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum length. Then, we consider NFSRs with k-monomial feedback functions and focus on two extreme cases where k=4 and k=2n-1. We study construction methods for these special cases.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1226/_p
Copy
@ARTICLE{e93-a_6_1226,
author={Çağdaş ÇALIK, Meltem SÖNMEZ TURAN, Ferruh ÖZBUDAK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers},
year={2010},
volume={E93-A},
number={6},
pages={1226-1231},
abstract={Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum length. Then, we consider NFSRs with k-monomial feedback functions and focus on two extreme cases where k=4 and k=2n-1. We study construction methods for these special cases.},
keywords={},
doi={10.1587/transfun.E93.A.1226},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1226
EP - 1231
AU - Çağdaş ÇALIK
AU - Meltem SÖNMEZ TURAN
AU - Ferruh ÖZBUDAK
PY - 2010
DO - 10.1587/transfun.E93.A.1226
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2010
AB - Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum length. Then, we consider NFSRs with k-monomial feedback functions and focus on two extreme cases where k=4 and k=2n-1. We study construction methods for these special cases.
ER -