For cryptography, you need very strong properties for your random numbers. Most of the literature focuses on such requirements. A typical solution would be to plant SHA-256 iterated applications using environmental noise (hard disk delays, network packets, mouse movements, RDRAND, HAVEGE, ...).
- . , . - , , ( , , 70- 80- , , - ). Mersenne Twister . ++: . std:: mt19937.