On the public citation graph

An efficient discrete log pseudo random generator

0 signed · 78 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-387-34805-0_13openalex-snapshot
Bit Commitment Using Pseudo-Randomness
inferredcites →https://doi.org/10.1007/3-540-39805-8_8openalex-snapshot
Simultaneous Security of Bits in the Discrete Log
inferredcites →https://doi.org/10.1007/3-540-47721-7_7openalex-snapshot
A Pseudo-Random Bit Generator Based on Elliptic Logarithms
inferredcites →https://doi.org/10.1007/3-540-68339-9_29openalex-snapshot
On Diffie-Hellman Key Agreement with Short Exponents
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(93)90038-xopenalex-snapshot
The discrete logarithm modulo a composite hides 0(n) Bits
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
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.1109/sfcs.1984.715948openalex-snapshot
Efficient And Secure Pseudo-Random Number Generation
inferredcites →https://doi.org/10.1109/sfcs.1989.63521openalex-snapshot
Minimum resource zero knowledge proofs
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
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/0217021openalex-snapshot
The Discrete Logarithm Hides $O(\log n)$ Bits
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/800061.808773openalex-snapshot
On the cryptographic security of single RSA bits
inferredcites →https://doi.org/10.2307/2006496openalex-snapshot
Monte Carlo Methods for Index Computation (mod p)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11556992_4openalex-snapshot
“Trust Engineering:” From Requirements to System Design and Maintenance – A Working National Lottery System Experience
inferred← citeshttps://doi.org/10.1007/11780656_22openalex-snapshot
Efficient Primitives from Exponentiation in ℤ p
inferred← citeshttps://doi.org/10.1007/11787006_21openalex-snapshot
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
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-44598-6_29openalex-snapshot
An Improved Pseudo-random Generator Based on Discrete Log
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_15openalex-snapshot
The Bit Security of Paillier’s Encryption Scheme and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_32openalex-snapshot
Fixed Points and Two-Cycles of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-031-14791-3_1openalex-snapshot
Decoding McEliece with a Hint – Secret Goppa Key Parts Reveal Everything
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_18openalex-snapshot
A Survey of Hard Core Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_14openalex-snapshot
The Discrete-Logarithm Problem with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-319-89500-0_6openalex-snapshot
Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_13openalex-snapshot
Short Exponent Diffie-Hellman Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_22openalex-snapshot
Secure Hashed Diffie-Hellman over Non-DDH Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-30574-3_15openalex-snapshot
Hard Bits of the Discrete Log with Applications to Password Authentication
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_28openalex-snapshot
Efficient Pseudorandom Generators Based on the DDH Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_4openalex-snapshot
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_22openalex-snapshot
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_34openalex-snapshot
Cryptographic Extraction and Key Derivation: The HKDF Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_34openalex-snapshot
Tightly Secure Signatures From Lossy Identification Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-34704-7_26openalex-snapshot
Pseudorandom Generators Based on Subcovers for Finite Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-36095-4_3openalex-snapshot
Fair Exchange of Short Signatures without Trusted Third Party
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_19openalex-snapshot
Tighter Reductions for Forward-Secure Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_6openalex-snapshot
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_18openalex-snapshot
The Magic of ELFs
inferred← citeshttps://doi.org/10.1007/978-88-470-2481-6_3openalex-snapshot
Randomicità e pseudorandomicità
inferred← citeshttps://doi.org/10.1007/s00145-002-0112-1openalex-snapshot
Paillier's Trapdoor Function Hides up to O(n) Bits
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/s00145-006-0224-0openalex-snapshot
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
inferred← citeshttps://doi.org/10.1007/s00145-018-9283-2openalex-snapshot
On the Tightness of Forward-Secure Signature Reductions
inferred← citeshttps://doi.org/10.1007/s00145-018-9289-9openalex-snapshot
The Magic of ELFs
inferred← citeshttps://doi.org/10.1007/s00145-022-09422-6openalex-snapshot
Non-Malleable Functions and their Applications
inferred← citeshttps://doi.org/10.1007/s10623-009-9329-4openalex-snapshot
More efficient DDH pseudorandom generators
inferred← citeshttps://doi.org/10.1007/s10623-009-9339-2openalex-snapshot
Short cycles in repeated exponentiation modulo a prime
inferred← citeshttps://doi.org/10.1007/s10623-018-0492-3openalex-snapshot
A variant of the Galbraith–Ruprai algorithm for discrete logarithms with improved complexity
inferred← citeshttps://doi.org/10.1007/s10623-025-01738-1openalex-snapshot
Sneaking up the ranks: Partial key exposure attacks on rank-based schemes
inferred← citeshttps://doi.org/10.1007/s12095-024-00743-wopenalex-snapshot
Provable randomness over lightweight permutations
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00010-0openalex-snapshot
Stream cipher design
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.114047openalex-snapshot
An alternative practical public-key cryptosystems based on the Dependent RSA Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106225openalex-snapshot
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103430openalex-snapshot
A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm
inferred← citeshttps://doi.org/10.1016/j.jnt.2014.04.010openalex-snapshot
Distribution of exponential functions modulo a prime power
inferred← citeshttps://doi.org/10.1017/s0960129512000825openalex-snapshot
Quantum attacks on pseudorandom generators
inferred← citeshttps://doi.org/10.1090/fic/041/20openalex-snapshot
New conjectures and results for small cycles of the discrete logarithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-2012-02641-xopenalex-snapshot
Computing discrete logarithms in an interval
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206689openalex-snapshot
Building Hard Problems by Combining Easy Ones
inferred← citeshttps://doi.org/10.1109/nca.2009.48openalex-snapshot
A Collusion-Resistant Distributed Scalar Product Protocol with Application to Privacy-Preserving Computation of Trust
inferred← citeshttps://doi.org/10.1145/1060328.1060329openalex-snapshot
Distribution of the error in estimated numbers of fixed points of the discrete logarithm
inferred← citeshttps://doi.org/10.1145/1229285.1266995openalex-snapshot
Efficient and secure self-escrowed public-key infrastructures
inferred← citeshttps://doi.org/10.1145/2414456.2414480openalex-snapshot
Practical client puzzles in the standard model
inferred← citeshttps://doi.org/10.1371/journal.pone.0240248openalex-snapshot
Decryption speed up of ElGamal with composite modulus
inferred← citeshttps://doi.org/10.15587/2312-8372.2013.18390openalex-snapshot
Pseudo-random number generators based on discrete logarithm
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.2431openalex-snapshot
An Efficient Signature Scheme with Fast Online Signing
inferred← citeshttps://doi.org/10.22028/d291-25748openalex-snapshot
Secure group key agreement
inferred← citeshttps://doi.org/10.46586/tosc.v2016.i1.114-133openalex-snapshot
Is AEZ v4.1 Sufficiently Resilient Against Key-Recovery Attacks?
inferred← citeshttps://doi.org/10.5555/984720.984752openalex-snapshot
An efficient anonymous group identification scheme with human memorizable secret keys
inferred← citeshttps://doi.org/10.62056/aee0fhsfgopenalex-snapshot
An Asymmetric Diffie-Hellman Protocol with Enhanced Efficiency through Parallelization
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.