CHAOTIC COMBINER FOR LINEAR FEEDBACK SHIFT REGISTER SEQUENCES
Loading...
Authors
Gutzler, Alexander
Subjects
cryptography
pseudorandom number generation
linear feedback shift register
combiner
hybrid
linear complexity
pseudorandom number generation
linear feedback shift register
combiner
hybrid
linear complexity
Advisors
Martinsen, Thor
Date of Issue
2020-03
Date
Publisher
Monterey, CA; Naval Postgraduate School
Language
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.
Type
Thesis
Description
Series/Report No
Department
Applied Mathematics (MA)
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.