Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

CryptGenRandom

Cryptographic Algorithm

CryptGenRandom is a cryptographically secure pseudorandom number generator function included in the Microsoft CryptoAPI, which Microsoft long recommended for any random number generation in Win32 programs. It is now deprecated together with the CryptoAPI and replaced by BCryptGenRandom in the Cryptography API: Next Generation; RtlGenRandom is the equivalent lower level function. Before Windows Vista its output followed FIPS 186-2 with SHA-1 and was seeded from many system sources such as process and thread identifiers, the tick count, performance counters and CPU counters. From Windows Vista on it uses AES-CTR-DRBG as specified in FIPS SP800-90, with a hierarchy in which a root generator seeds one generator per logical processor and each process in turn. A 2007 analysis by Leo Dorrendorf and colleagues found weaknesses in the Windows 2000 implementation, which was based on the RC4 stream cipher and ran in user mode, and Microsoft fixed the problem for Windows XP in Service Pack 3. Several programming language facilities, such as the Python os.urandom function on Windows, call it.

Facts
Problem Solved
Cryptographically secure pseudorandom number generation 1
Connections

In Field

Cryptography, Fields
Source CryptGenRandom (Wikipedia)
In the Other Atlases

Developed By

Also in Business Atlas: the developer of this subject.

Source CryptGenRandom (Wikipedia)Lead
Quote, Lead
CryptGenRandom is a cryptographically secure pseudorandom number generator function that is included in Microsoft CryptoAPI.
Sources
1. CryptGenRandom (Wikipedia)
  • Lead
    CryptGenRandom is a cryptographically secure pseudorandom number generator function that is included in Microsoft CryptoAPI.
  • In Group: Applied Cryptography, Lead, group placement
    CryptGenRandom is a cryptographically secure pseudorandom number generator function that is included in Microsoft CryptoAPI.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.