On the public citation graph
Efficient, perfect polynomial random number generators
0 signed · 53 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-34799-2_14openalex-snapshot
Efficient, Perfect Random Number Generators
inferredcites →https://doi.org/10.1007/bf01298835openalex-snapshot
Statistical independence of nonlinear congruential pseudorandom numbers
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.72openalex-snapshot
How to generate cryptographically strong sequences of pseudo random bits
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1984.715945openalex-snapshot
Generating Quasi-Random Sequences From Slightly-Random Sources
inferredcites →https://doi.org/10.1109/sfcs.1984.715947openalex-snapshot
RSA/Rabin Bits are 1/2 + 1 / Poly (Log N) Secure
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0215025openalex-snapshot
A Simple Unpredictable Pseudo-Random Number Generator
inferredcites →https://doi.org/10.1137/0217013openalex-snapshot
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11935230_13openalex-snapshot
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_7openalex-snapshot
An Improved Pseudorandom Generator Based on Hardness of Factoring
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_14openalex-snapshot
The Hidden Number Problem in Extension Fields and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_33openalex-snapshot
Local Randomness in Candidate One-Way Functions
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_20openalex-snapshot
Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_36openalex-snapshot
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-58108-1_23openalex-snapshot
Cryptographic pseudo-random numbers in simulation
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_19openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_12openalex-snapshot
On the Possibility of a Backdoor in the Micali-Schnorr Generator
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_45openalex-snapshot
Statistical Properties of Short RSA Distribution and Their Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-322-88782-5_22openalex-snapshot
Der „Digital Signature Standard“: Aufwand, Implementierung und Sicherheit
inferred← citeshttps://doi.org/10.1007/978-3-642-04642-1_5openalex-snapshot
Chosen-Ciphertext Secure RSA-Type Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_57openalex-snapshot
Time/Memory/Data Tradeoffs for Variants of the RSA Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-45239-0_10openalex-snapshot
Recovering Private Keys Generated with Weak PRNGs
inferred← citeshttps://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferred← citeshttps://doi.org/10.1007/s00145-004-0215-yopenalex-snapshot
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/s001459900041openalex-snapshot
Zero-Knowledge Authentication Scheme with Secret Key Exchange
inferred← citeshttps://doi.org/10.1007/s001459910008openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferred← citeshttps://doi.org/10.1109/49.223871openalex-snapshot
Immunizing public key cryptosystems against chosen ciphertext attacks
inferred← citeshttps://doi.org/10.1109/csp66295.2025.00020openalex-snapshot
Further Attacks on the Micali-Schnorr Pseudorandom Generator
inferred← citeshttps://doi.org/10.1109/eurospw55150.2022.00011openalex-snapshot
SP 800–22 and GM/T 0005–2012 Tests: Clearly Obsolete, Possibly Harmful
inferred← citeshttps://doi.org/10.1109/ieeestd.2000.92292openalex-snapshot
IEEE Standard Specifications for Public-Key Cryptography
inferred← citeshttps://doi.org/10.1137/0222045openalex-snapshot
Local Randomness in Polynomial Random Number and Random Function Generators
inferred← citeshttps://doi.org/10.1145/2503778.2503784openalex-snapshot
Splittable pseudorandom number generators using cryptographic hashing
inferred← citeshttps://doi.org/10.1145/2578854.2503784openalex-snapshot
Splittable pseudorandom number generators using cryptographic hashing
inferred← citeshttps://doi.org/10.1145/380752.380803openalex-snapshot
Sparse polynomial approximation in finite fields
inferred← citeshttps://doi.org/10.1155/2018/3295148openalex-snapshot
Multidevice Authentication with Strong Privacy Protection
inferred← citeshttps://doi.org/10.11606/d.45.2011.tde-14032012-213011openalex-snapshot
Segurança do bit menos significativo no RSA e em curvas elípticas
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.24200/squjs.vol7iss1pp147-156openalex-snapshot
Simulation of m-Sequence’s Properties Through MATLAB-SIMULINK
inferred← citeshttps://doi.org/10.3390/math11234812openalex-snapshot
Cryptographically Secured Pseudo-Random Number Generators: Analysis and Testing with NIST Statistical Test Suite
inferred← citeshttps://doi.org/10.3745/kipstd.2003.10d.3.541openalex-snapshot
Practically Secure and Efficient Random Bit Generator Using Digital Fingerprint Image for The Source of Random
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01086openalex-snapshot
Computational Limitations in Robust Classification and Win-Win Results
inferred← citeshttps://doi.org/10.6109/jicce.2010.8.5.539openalex-snapshot
Fingerprint Image for the Randomness Algorithm
inferred← citeshttps://doi.org/10.82308/49952openalex-snapshot
Survey of computational assumptions used in cryptography broken or not by Shor's algorithm
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.