Constructing New NLFSR Functions with Optimal Periods
- 1 April 2020
- journal article
- research article
- Published by IGI Global in International Journal of Interdisciplinary Telecommunications and Networking
- Vol. 12 (2), 71-80
- https://doi.org/10.4018/ijitn.2020040106
Abstract
Pseudorandom bit generators are essential components in many security applications. The security of the system relies on the security of its components. Feedback shift registers are commonly used to generate pseudorandom bits. Nonlinear feedback shift registers (NLFSRs) are known to be more secure than the linear ones. However, there is no mathematical foundation on how to construct NLFSR feedback functions with optimal periods. This article considers a new type of NLFSR capable of constructing feedback functions of degree 3 with optimal periods. Using their construction method, the authors propose new functions of this type. Request access from your librarian to read this article's full text.Keywords
This publication has 13 references indexed in Scilit:
- Secure dynamic authentication of passive assets and passive IoTs using self-powered timersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- DEVELOPMENT OF THE SEARCH METHOD FOR NON-LINEAR SHIFT REGISTERS USING HARDWARE, IMPLEMENTED ON FIELD PROGRAMMABLE GATE ARRAYSEUREKA: Physics and Engineering, 2017
- Enhancement of GSM Stream Cipher Security Using Variable Taps Mechanism and Nonlinear Combination Functions on Linear Feedback Shift RegistersProceedings of International Scientific Conference on Telecommunications, Computing and Control, 2016
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic propertiesCryptography and Communications, 2016
- Generation of full cycles by a composition of NLFSRsDesigns, Codes and Cryptography, 2014
- Ring Generators—New Devices for Embedded Test ApplicationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- Introduction to Finite Fields and their ApplicationsPublished by Cambridge University Press (CUP) ,1994
- Linear spans of modified de Bruijn sequencesIEEE Transactions on Information Theory, 1990
- A Survey of Full Length Nonlinear Shift Register Cycle AlgorithmsSIAM Review, 1982
- Normal Recurring DecimalsJournal of the London Mathematical Society, 1946