Future work could focus on methods to increase the speed of the generator without a loss of excellent cryptographic properties. Our scheme produced consistently excellent results under NIST testing but is computationally too slow for many practical uses as a stream cipher. A wide variety of applications has been made of these sequences. We identified lower bounds on the input parameters to increase the probability that the combiner would perform well under the NIST test suite. Shift registers have been used to generate sequences of 0s and 1s for over thirty years. We then evaluated their cryptographic suitability with the National Institute of Standards and Technology NIST statistical test suite. Linear feed back shift registers (LFSR) are one of the most ecient waysto step through all possible 2n1 non-zeron-long bit patterns in a randomfashion. ![]() We sought to answer the questions 1 What are the strengths and weaknesses of this type of combiner 2 What constraints must be placed on the input parameters to ensure good cryptographic properties of the output sequence We generated sequences using variations of this combiner. ![]() Abstract: The purpose of this thesis is to analyze the cryptographic properties of a pseudorandom bit generator that combines Blum Blum Shub and linear feedback shift register sequences using a shrinking generator configuration.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |