Nonlinear Congruential Pseudorandom Number Generation
β Scribed by Weingartner A.
- Year
- 1994
- Tongue
- English
- Leaves
- 79
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been
Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic
Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic
<p><P>The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation.</P><P>Key topics and features:</P><P>- various lower bounds on the complexity of some number theoretic and cryptographic problems, assoc