On Random Number Generation for Kernel Applications

DOI10.3233/FI-222111MaRDI QIDQ5089678zbMATH OpenFDO

Authors Kunal Abhishek, Prakash Raj E. George Dharma

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)

Recommendations

• Cryptanalytic attacks on pseudorandom number generators
• scientific article; zbMATH DE number 1440878
• Secure simultaneous bit extraction from Koblitz curves
• scientific article; zbMATH DE number 2086718
• Generating and testing cryptographically secure random numbers

Cites work

• scientific article; zbMATH DE number 1972840 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• scientific article; zbMATH DE number 1440878 (Why is no real title available?)
• Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms
• Cryptanalytic attacks on pseudorandom number generators
• Hard Problems of Algebraic Geometry Codes
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• On the efficient generation of prime-order elliptic curves
• Practical next bit test for evaluating pseudorandom sequences
• Reducing elliptic curve logarithms to logarithms in a finite field
• TestU01
• The NSA back door to NIST
• The discrete logarithm problem on elliptic curves of trace one

This page was built for publication: On Random Number Generation for Kernel Applications

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