An ultrafast cryptographically secure pseudorandom number generator

DOI10.1007/978-3-031-29371-9_14MaRDI QIDQ6134224zbMATH OpenFDO

Authors Jianliang Zheng, Jie Li

Publication date 21 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-29371-9_14

zbMATH Keywords

cryptanalysishigh performancepseudorandom mappingpseudorandom number generatorpseudorandom permutationunpredictability

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A Practical Attack on the Fixed RC4 in the WEP Mode
• Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
• Dragon: A Fast Word Based Stream Cipher
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 1583765 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 1942441 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• Improved Linear Distinguishers for SNOW 2.0
• ISAAC
• MARC: modified ARC4
• Practical next bit test for evaluating pseudorandom sequences
• Selected Areas in Cryptography
• TestU01
• The Stream Cipher HC-128
• Universal tests for nonuniform distributions

Cited in

(3)

• Bootstrapping Obfuscators via Fast Pseudorandom Functions
• scientific article; zbMATH DE number 16481 (Why is no real title available?)
• On a decentralized trustless pseudo-random number generation algorithm

This page was built for publication: An ultrafast cryptographically secure pseudorandom number generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134224)