Lots of cryptography algorithms rely on pseudorandom number generators. Sometimes, given a plaintext, you need to generate a pseudorandom number from it. What are some fast algorithms that do so?
I’ve seen one that uses SHA256 and other that uses AES, but I couldn’t find any literature about them or some implementation that I can use. They should be fast because processors nowadays have hardware support for them.
on page 8 of this paper: dl.acm.org/doi/10.1145/2808425.2808431 it says