Overview
- Presents the theoretical basis and intuition of various random number generators without overly detailed proofs
- Enables readers to design, develop, modify, or experiment with new random number generators
- Provides comprehensive coverage of random number generation for both simulation and cryptographic applications
Part of the book series: Synthesis Lectures on Mathematics & Statistics (SLMS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This book discusses the theory and practice of random number generators that are useful for computer simulation and computer security applications. Random numbers are ubiquitous in computation. They are used in randomized algorithms to perform sampling or choose randomly initialized parameters or perform Markov Chain Monte Carlo (MCMC). They are also used in computer security applications for various purposes such as cryptographic nuances or in authenticators. In practice, the random numbers used by any of these applications are from a pseudo-random sequence. These pseudo-random sequences are generated by RNGs (random number generators). This book discusses the theory underlying such RNGs, which are used by all programmers. However, few try to understand the theory behind them. This topic is an active area of research, particularly when the generators are used for cryptographic applications. The authors introduce readers to RNGs, how they are judged for quality, the mathematical and statistical theory behind them, as well as provide details on how these can be implemented in any programming language. The book discusses non-linear transformations that use classical linear generators for cryptographic applications and how to optimize to make such generators more efficient. In addition, the book provides up-to-date research on RNGs including a modern class of efficient RNGs and shows how to search for new RNGs with good quality and how to parallelize these RNGs.
Keywords
Table of contents (18 chapters)
-
Front Matter
-
Classical Random Number Generators
-
Front Matter
-
-
Quality Assessment for Random Number Generators
-
Front Matter
-
-
Parallelization of Random Number Generators
-
Front Matter
-
-
Secure Random Number Generators
-
Front Matter
-
Authors and Affiliations
About the authors
Lih-Yuan Deng, PhD, is a Professor in the Department of Mathematical Sciences at the University of Memphis. His research focuses on random number generators and has published several papers on the topic, as well as in other areas of statistics and data science.
Nirman Kumar, PhD, is currently a Consulting Member of Technical Staff at Oracle America, Inc. Prior to this, he was an Assistant Professor of Computer Science at the University of Memphis. His research work has focused on theoretical computer science and machine learning and he has several publications in the areas of computational geometry, randomized algorithms, and machine learning.
Henry Horng-Shing Lu, PhD, is a Professor in the Institute of Statistics at the National Yang Ming Chiao Tung University. His research focuses on statistics, image science, and bioinformatics with publications on related topics for scientific and industrial applications.
Ching-Chi Yang, PhD, is an Assistant Professor in the Department of Mathematical Sciences at the University of Memphis. His research focuses on statistical applications and has published several papers in the areas of statistical dimensional analysis.
Bibliographic Information
Book Title: Random Number Generators for Computer Simulation and Cyber Security
Book Subtitle: Design, Search, Theory, and Application
Authors: Lih-Yuan Deng, Nirman Kumar, Henry Horng-Shing Lu, Ching-Chi Yang
Series Title: Synthesis Lectures on Mathematics & Statistics
DOI: https://doi.org/10.1007/978-3-031-76722-7
Publisher: Springer Cham
eBook Packages: Synthesis Collection of Technology (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2025
Hardcover ISBN: 978-3-031-76721-0Published: 08 March 2025
Softcover ISBN: 978-3-031-76724-1Due: 22 March 2026
eBook ISBN: 978-3-031-76722-7Published: 07 March 2025
Series ISSN: 1938-1743
Series E-ISSN: 1938-1751
Edition Number: 1
Number of Pages: XIV, 260
Number of Illustrations: 17 b/w illustrations, 5 illustrations in colour
Topics: Applications of Mathematics, Computational Mathematics and Numerical Analysis, Statistics and Computing/Statistics Programs, Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences, Mathematics of Computing, Discrete Mathematics in Computer Science