On Random Number Generation for Kernel Applications

DOI10.3233/FI-222111MaRDI QIDQ5089678

Prakash Raj E. George Dharma, Kunal Abhishek

Publication date: 14 July 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.06882

zbMATH Keywords

elliptic curverandom number generatorLFSRCSPRNGkernel applications

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete logarithm problem on elliptic curves of trace one
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• Practical next bit test for evaluating pseudorandom sequences
• The NSA Back Door to NIST
• TestU01
• Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms
• Hard Problems of Algebraic Geometry Codes
• Reducing elliptic curve logarithms to logarithms in a finite field
• Cryptanalytic Attacks on Pseudorandom Number Generators
• On the efficient generation of prime-order elliptic curves