Sponge-based pseudo-random number generators, CHES (S. Mangard and F.-X. Standaert, eds.), Lecture Notes in Computer Science, vol. 6225, Springer, August 2010, pp. 33-47.Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge-based pseudo- random number generators. In: ...
Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge-based pseudo- random number generators. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 33–47. Springer, Heidelberg (2010) 26. Bellare, M., Rogaway, P.: The security of triple ...
Sponge-based pseudo-random num- ber generators. CHES 2010, pages 33-47, 2010.Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: Sponge-based pseudo-random number generators. In Mangard, S., Standaert, F.X., eds.: CHES 2010. Volume 6225 of LNCS., Springer (2010) 33-47...
Typically, software-based pseudorandom number generators (PRNGs) collect entropy from system events into a so-called entropy pool, and then apply cryptographic algorithms (hash functions, block ciphers, PRFs, etc.) to extract pseudorandom bits from this pool. These are also often referred to as...
(pseudorandom function security for the former and privacy and authenticity for the latter), assuming a limit ofon online complexity, but are additionally restricted by the key sizeto. The permutation-based CAESAR candidates are no exception and recommend parameters based on either theorbound, as ...
Guido Bertoni, Joan Daemen, Michael Peeters and Gilles Van Assche, "Sponge Based Pseudo Random Number Generators", Proceedings of the 12th International Conference on Cryptographic Hardware and Embedded Systems, pp. 33-47, 2010.Sponge-based pseudo-random number generators, CHES (S. Mangard and F...
Sponge-Based Pseudo-Random Number Generators Guido Bertoni1, Joan Daemen1, Micha¨el Peeters2, and Gilles Van Assche1 1 STMicroelectronics 2 NXP Semiconductors Abstract. This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functions...
This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functions and is suitable for embedded security devices as it requires few resources. We propose a model for such generators and expla
SpongePseudo-random number generator (PRNG)Patarin's H-coefficient techniqueRobustnessKeccakSHA-3Ideal permutation modelEver since Keccak won the SHA3 competition, sponge-based constructions are being suggested for many different applications, including pseudo-random number generators (PRNGs). Sponges are ...