Chaotic Combiner for Linear Feedback Shift Register Sequences
Abstract
Cryptography is widely used by everybody in day-to-day activities. Many cryptographic algorithms rely on pseudorandom number sequences. One of the quickest methods of pseudorandom number generation is using linear feedback shift registers (LFSR) to generate sequences. LFSR sequences exhibit good statistical properties, but alone are not adequately secure due to their low linear complexity. To enhance the security, separate LFSR sequences can be combined into a single pseudorandom string by using a combiner. In this thesis, creating a combiner function using another pseudorandom sequence derived from the chaotic motion of a double pendulum is investigated. Using the information from this driving function, an iterative process occurs whereby certain LFSR sequence blocks are selected and combined. The resultant sequences are sufficiently random as proven by the 15 tests adopted by the National Institute of Standards and Technology to evaluate the randomness of binary strings.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 2020
- Accession Number
- AD1114218
Entities
People
- Alexander Gutzler
Organizations
- Naval Postgraduate School