{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/65484"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/65484","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"NON-LINEAR PSEUDORANDOM BIT GENERATION BY COMBINING BLUM BLUM SHUB AND LINEAR FEEDBACK SHIFT REGISTER SEQUENCES","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. 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. We then evaluated their cryptographic suitability with the National Institute of Standards and Technology (NIST) statistical test suite. We identified lower bounds on the input parameters to increase the probability that the combiner would perform well under the NIST test suite. Our scheme produced consistently excellent results under NIST testing but is computationally too slow for many practical uses as a stream cipher. Future work could focus on methods to increase the speed of the generator without a loss of excellent cryptographic properties.","abstract_html":"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. 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. We then evaluated their cryptographic suitability with the National Institute of Standards and Technology (NIST) statistical test suite. We identified lower bounds on the input parameters to increase the probability that the combiner would perform well under the NIST test suite. Our scheme produced consistently excellent results under NIST testing but is computationally too slow for many practical uses as a stream cipher. Future work could focus on methods to increase the speed of the generator without a loss of excellent cryptographic properties.","abstract_has_math":false,"creators":["Cammack, Andrew M."],"institution":"Monterey, CA; Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Applied Mathematics (MA)","school":null,"contributors":[],"advisors":["Stanica, Pantelimon"],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020-06","date_published":"2020-06","updated_at":"2026-07-27T20:26:38Z","subjects":[],"languages":[],"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."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/65484","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Stanica, Pantelimon"]},{"key":"dc:contributor.department","label":"Department","values":["Applied Mathematics (MA)"]},{"key":"dc:creator","label":"Author","values":["Cammack, Andrew M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-08-21T00:25:18Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-08-21T00:25:18Z"]},{"key":"dc:date.issued","label":"Date","values":["2020-06"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, CA; Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["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."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/65484"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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. 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. We then evaluated their cryptographic suitability with the National Institute of Standards and Technology (NIST) statistical test suite. We identified lower bounds on the input parameters to increase the probability that the combiner would perform well under the NIST test suite. Our scheme produced consistently excellent results under NIST testing but is computationally too slow for many practical uses as a stream cipher. Future work could focus on methods to increase the speed of the generator without a loss of excellent cryptographic properties."]},{"key":"dc:title","label":"Title","values":["NON-LINEAR PSEUDORANDOM BIT GENERATION BY COMBINING BLUM BLUM SHUB AND LINEAR FEEDBACK SHIFT REGISTER SEQUENCES"]}]}],"canonical_facts":{"dc:contributor.advisor":["Stanica, Pantelimon"],"dc:contributor.department":["Applied Mathematics (MA)"],"dc:creator":["Cammack, Andrew M."],"dc:date.accessioned":["2020-08-21T00:25:18Z"],"dc:date.available":["2020-08-21T00:25:18Z"],"dc:date.issued":["2020-06"],"dc:description.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. 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. We then evaluated their cryptographic suitability with the National Institute of Standards and Technology (NIST) statistical test suite. We identified lower bounds on the input parameters to increase the probability that the combiner would perform well under the NIST test suite. Our scheme produced consistently excellent results under NIST testing but is computationally too slow for many practical uses as a stream cipher. Future work could focus on methods to increase the speed of the generator without a loss of excellent cryptographic properties."],"dc:identifier.uri":["https://hdl.handle.net/10945/65484"],"dc:publisher":["Monterey, CA; Naval Postgraduate School"],"dc: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."],"dc:title":["NON-LINEAR PSEUDORANDOM BIT GENERATION BY COMBINING BLUM BLUM SHUB AND LINEAR FEEDBACK SHIFT REGISTER SEQUENCES"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:26:38Z"}