Published: August 02, 2010
Citation: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences no. 6, (June 1, 2010) pp. 1226-1231
Author(s)
Çağdaş Çalık, Meltem Sönmez Turan, F. Özbudak
Announcement
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 2^n. 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 = 2^(n-1). We study construction methods for these special cases.
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...
See full 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 2^n. 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 = 2^(n-1). We study construction methods for these special cases.
Hide full abstract
Keywords
de Bruijn sequences; maximal length sequences; nonlinear feedback shift registers
Control Families
None selected
) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)
