A pseudorandom number generator (PRNG) is an algorithm that produces a sequence of numbers which emulates the characteristics of a random sequence. In comparison to its genuine counterpart, PRNGs are considered more suitable for computing devices in that they do not consume a lot of resources (in terms of memory) and their portability; they can also be used on a wide range of devices. Cryptographically Secure PRNGs (CSPRNGs) are the only type of PRNGs suitable for cryptographic applications. They are specially designed to withstand security attacks. In this thesis, we provide descriptions of two CSPRNGs: Trivium, a hardware-based stream cipher designed for constrained computing environments, and OpenJDK SecureRandom, a traditional CSPRNG recommended for Java programs that include a cryptographic algorithm. Our contributions are Quadrivium, a PRNG inspired by Trivium and analysis results comparing statistical properties of SecureRandom, Trivium and Quadrivium.
","abstract_html":"<p>A pseudorandom number generator (PRNG) is an algorithm that produces a sequence of numbers which emulates the characteristics of a random sequence. In comparison to its genuine counterpart, PRNGs are considered more suitable for computing devices in that they do not consume a lot of resources (in terms of memory) and their portability; they can also be used on a wide range of devices. Cryptographically Secure PRNGs (CSPRNGs) are the only type of PRNGs suitable for cryptographic applications. They are specially designed to withstand security attacks. In this thesis, we provide descriptions of two CSPRNGs: Trivium, a hardware-based stream cipher designed for constrained computing environments, and OpenJDK SecureRandom, a traditional CSPRNG recommended for Java programs that include a cryptographic algorithm. Our contributions are Quadrivium, a PRNG inspired by Trivium and analysis results comparing statistical properties of SecureRandom, Trivium and Quadrivium.</p>","abstract_has_math":false,"creators":["Jackson, Latoya Niesha"],"institution":null,"degree_name":"Computer Science - Applied Computing Track","degree_level":"Thesis","degree_discipline":"TSYS School of Computer Science","degree_department":null,"school":null,"contributors":["Yesem Kurt-Peker","Radhouane Chouchane","Rodrigo Obando"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-05-01T07:00:00Z","date_published":"2017-05-01T07:00:00Z","updated_at":"2026-07-24T01:44:55Z","subjects":["Trivium","Lightweight Cryptography","SecureRandom","Cryptographically Secure Pseudorandom Number Generators","Computer Sciences","Theory and Algorithms"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://csuepress.columbusstate.edu/theses_dissertations/353","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Yesem Kurt-Peker","Radhouane Chouchane","Rodrigo Obando"]},{"key":"dc:creator","label":"Author","values":["Jackson, Latoya Niesha"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2020-01-30T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["TSYS School of Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Computer Science - Applied Computing Track"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Trivium","Lightweight Cryptography","SecureRandom","Cryptographically Secure Pseudorandom Number Generators","Computer Sciences","Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://csuepress.columbusstate.edu/theses_dissertations/353"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A pseudorandom number generator (PRNG) is an algorithm that produces a sequence of numbers which emulates the characteristics of a random sequence. In comparison to its genuine counterpart, PRNGs are considered more suitable for computing devices in that they do not consume a lot of resources (in terms of memory) and their portability; they can also be used on a wide range of devices. Cryptographically Secure PRNGs (CSPRNGs) are the only type of PRNGs suitable for cryptographic applications. They are specially designed to withstand security attacks. In this thesis, we provide descriptions of two CSPRNGs: Trivium, a hardware-based stream cipher designed for constrained computing environments, and OpenJDK SecureRandom, a traditional CSPRNG recommended for Java programs that include a cryptographic algorithm. Our contributions are Quadrivium, a PRNG inspired by Trivium and analysis results comparing statistical properties of SecureRandom, Trivium and Quadrivium.
"]},{"key":"dc:title","label":"Title","values":["A Trivium-Inspired Pseudorandom Number Generator with a Statistical Comparison to the Randomness of SecureRandom and Trivium"]}]}],"canonical_facts":{"dc:contributor":["Yesem Kurt-Peker","Radhouane Chouchane","Rodrigo Obando"],"dc:creator":["Jackson, Latoya Niesha"],"dc:date.available":["2020-01-30T08:00:00Z"],"dc:description.abstract":["A pseudorandom number generator (PRNG) is an algorithm that produces a sequence of numbers which emulates the characteristics of a random sequence. In comparison to its genuine counterpart, PRNGs are considered more suitable for computing devices in that they do not consume a lot of resources (in terms of memory) and their portability; they can also be used on a wide range of devices. Cryptographically Secure PRNGs (CSPRNGs) are the only type of PRNGs suitable for cryptographic applications. They are specially designed to withstand security attacks. In this thesis, we provide descriptions of two CSPRNGs: Trivium, a hardware-based stream cipher designed for constrained computing environments, and OpenJDK SecureRandom, a traditional CSPRNG recommended for Java programs that include a cryptographic algorithm. Our contributions are Quadrivium, a PRNG inspired by Trivium and analysis results comparing statistical properties of SecureRandom, Trivium and Quadrivium.
"],"dc:identifier":["https://csuepress.columbusstate.edu/theses_dissertations/353"],"dc:language":["English"],"dc:subject":["Trivium","Lightweight Cryptography","SecureRandom","Cryptographically Secure Pseudorandom Number Generators","Computer Sciences","Theory and Algorithms"],"dc:title":["A Trivium-Inspired Pseudorandom Number Generator with a Statistical Comparison to the Randomness of SecureRandom and Trivium"],"thesis:degree_discipline":["TSYS School of Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Computer Science - Applied Computing Track"]},"updated_at":"2026-07-24T01:44:55Z"}