A forkcipher-based pseudo-random number generator
From MaRDI portal
(Redirected from Publication:6535108)
Recommendations
- Security analysis of NIST CTR-DRBG
- Practical seed-recovery of fast cryptographic pseudo-random number generators
- Seedless fruit is the sweetest: random number generation, revisited
- A robust and sponge-like PRNG with improved efficiency
- Forkcipher: a new primitive for authenticated encryption of very short messages
Cites work
- A Simple Unpredictable Pseudo-Random Number Generator
- An analysis of NIST SP 800-90A
- Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings
- Forkcipher: a new primitive for authenticated encryption of very short messages
- scientific article; zbMATH DE number 2086718 (Why is no real title available?)
- Impossible differential cryptanalysis of reduced-round \texttt{SKINNY}
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Leftover Hash Lemma, Revisited
- Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis
- On recycling the randomness of states in space bounded computation
- Piccolo: An Ultra-Lightweight Blockcipher
- PRESENT: An Ultra-Lightweight Block Cipher
- Related-key impossible-differential attack on reduced-round \textsc{Skinny}
- Security analysis of NIST CTR-DRBG
- The LED block cipher
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
Cited in
(4)
This page was built for publication: A forkcipher-based pseudo-random number generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535108)
