World Library  
Flag as Inappropriate
Email this Article

Nonlinear feedback shift register

Article Id: WHEBN0002613481
Reproduction Date:

Title: Nonlinear feedback shift register  
Author: World Heritage Encyclopedia
Language: English
Subject: Stream ciphers, Radio-frequency identification
Collection: Radio-Frequency Identification, Stream Ciphers
Publisher: World Heritage Encyclopedia

Nonlinear feedback shift register

A NLFSR (Non-Linear Feedback Shift Register) is a common component in modern stream ciphers, especially in RFID and smartcard applications. NLFSRs are known to be more resistant to cryptanalytic attacks than Linear Feedback Shift Registers (LFSRs). It is known how to generate a n-bit NLFSR of maximal length 2n, generating a De Bruijn sequence, by extending a maximal-length LFSR with n stages;[1] but the construction of other large NLFSRs with guaranteed long periods remains an open problem.[2] Using bruteforce methods, a list of maximum-period n-bit NLFSRs for n < 25 has been made[3] as well as for n=25 and n=27.[4]

New methods suggests usage evolutionary algorithm in order to introduce non-linearity.[5] In these works, an evolutionary algorithm learn, how to apply different operation on strings from LFSR to enhance their quality to meet the criteria of a fitness function, here NIST protocol[6] effectively.

See also

NLFSR-based ciphers:


  1. ^ C.G. Günther, "Alternating Step Generator Controlled by de Bruijn Sequence", Advances in Cryptology — EUROCRYPT’ 87,
  2. ^ On analysis and synthesis of (n, k)-non-linear feedback shift registers, 2008.
  3. ^ E. Dubrova, "A List of Maximum Period NLFSRs", Cryptology ePrint Archive, Report 2012/166, March 2012,
  4. ^ Tomasz Rachwalik, Janusz Szmidt, Robert Wicik, and Janusz Zablocki, "A Generation of Nonlinear Feedback Shift Registers with special-purpose hardware", Cryptology ePrint Archive, Report 2012/314, June 2012,
  5. ^ A. Poorghanad, A. Sadr, A. Kashanipour" Generating High Quality Pseudo Random Number Using Evolutionary Methods", IEEE Congress on Computational Intelligence and Security, vol. 9, pp. 331-335 , May,2008 [2]
  6. ^ NIST." A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications". NIST, Special Publication April 2010

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.