A cryptographically secure pseudorandom number generator is a pseudo-random number generator with properties that make it suitable for use in cryptography.

learn more… | top users | synonyms

3
votes
0answers
41 views

How to break this PRNG encryption scheme?

Suppose we have the following symmetric algorithm: key = random bits G = PRNG(seed: key) input = [0,1,1,0,1,0,0,0, 0,1,1,0,1,0,0,1] // "hi" in ascii The key can ...
1
vote
0answers
44 views

Hardening of random number generators

Boxcryptor uses various CSPRNGs and apparently hashes the output using PBKDF2 to derive the final key. Even though the choice of ...
1
vote
0answers
350 views

Random Number Generation with a Entropy pool versus Seed

To give a little background I'm currently implementing a crypto library in JavaScript. I have started porting across Linux's random number generator because its both publicly scrutinized, it is ...
0
votes
0answers
29 views

Hokkaido (proof-of-Work system) and pseudo-random permutation table

This question is regarding a proof-of-work system suggested in this article "Cryptology ePrint Archive: Report 2005/356". The outset goal of the Hokkaido algorithm is to provide a task to somebody's ...
0
votes
0answers
49 views

Test framework for hash functions for collision resistance?

I have two questions about the assessment of collision resistance in hash functions. Given a hash-function what would be the next step to inquiry about it's collision resistance / probability of ...