Skip to search formSkip to main contentSkip to account menu

Cryptographically secure pseudorandom number generator

Known as: Cryptographically secure pseudo-random number generator, CPRNG, CSPRNG 
A cryptographically secure pseudo-random number generator (CSPRNG) or cryptographic pseudo-random number generator (CPRNG) is a pseudo-random number… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Block cipherBlock cipher mode of operationBlum Blum ShubChallenge–response authentication

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Cryptographically Secure Pseudorandom Number Generators
Cryptographically secure pseudorandom number generators (CSPRNGs) are pseudorandom number generators that protect against attack… 
2014
2014
Efficient and cryptographically secure pseudorandom number generators based on chains of hybrid cellular automata maps
In this paper we consider several solutions for designing cryptographically good pseudo random number generators (PRNG) with low… 
2014
2014
Performance Comparison Of Evolutionary Techniques Enhanced By Lozi Chaotic Map In The Task Of Reactor Geometry Optimization
In this study the performance of two popular evolutionary computational techniques (particle swarm optimization and differential… 
2013
2013
Efficient deterministic approximate counting for low-degree polynomial threshold functions
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-d polynomial threshold function… 
Highly Cited
2012
Highly Cited
2012
Emergence of Randomness from Chaos
In systems theory and science, emergence is the way complex systems and patterns arise out of a multiplicity of relatively simple… 
2010
2010
Cryptographically secure pseudo-random bit generator for RFID tags
In RFID protocols, random numbers are mainly required to anonymize tag answers in order to guarantee the privacy of the owner of… 
2006
2006
Cryptographically secure pseudorandom number generator
The "quality" of the randomness required for these applications varies. For example creating a nonce in some protocols needs only… 
Highly Cited
2004
Highly Cited
2004
Algebraic signatures for scalable distributed data structures
Signatures detect changes to data objects. Numerous schemes are in use, especially the cryptographically secure standards SHA-1… 
2003
2003
A cryptographically secure pseudorandom number generator
Highly Cited
2000
Highly Cited
2000
Exposure-Resilient Functions and All-or-Nothing Transforms
We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)