Electronic Theses and Dissertations

Date

2021

Document Type

Dissertation

Degree Name

Doctor of Philosophy

Department

Mathematical Sciences

Committee Chair

Lih-Yuan Deng

Committee Member

Ching Chi Yang

Committee Member

Dale Bowman

Committee Member

Su Chen

Abstract

Pseudo-random number generators (PRNGs) play an important role in both areas of computersimulation and computer security. For PRNGs in computer security applications, the securityconcern is extremely important. In recent years, there have been many PRNGs proposed in the areaof computer simulation satisfying the nice properties. However, most of them are linear generators,thus sharing the same weakness in predictability. The major aim of this study is to propose threegeneral class of secure generators, called RCF(Random Coupling with Future), Dual RCF, RCFShufflinggenerators, to obtain a secure generator that would inherit the nice properties.Proposed generators are suitable for both simulation and security applications. The keyfeature is to break the linearity structure of some classical linear generators based on coupling thecurrent value with a future value that is random steps away. We provide some justificationsand discuss the security, efficiency, and distributional properties of RCF generators. Steps andguidelines on choosing appropriate parameters for creating RCF generators are provided. Severalexamples of well chosen parameters are presented. Finally, some potential extensions for furtherenhancement are briefly discussed.

Comments

Data is provided by the student.

Library Comment

Dissertation or thesis originally submitted to ProQuest

Notes

embargoed

Download

Share

COinS