On the public citation graph
“Pseudo-random” number generation within cryptographic algorithms: The DDS case
0 signed · 80 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-34805-0_14openalex-snapshot
How to Predict Congruential Generators
inferredcites →https://doi.org/10.1007/3-540-39568-7_2openalex-snapshot
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_32openalex-snapshot
Inferring a Sequence Generated by a Linear Congruence
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.73openalex-snapshot
Inferring a sequence generated by a linear congruence
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1984.715950openalex-snapshot
Linear Congruential Generators Do Not Produce Random Sequences
inferredcites →https://doi.org/10.1109/sfcs.1987.51openalex-snapshot
Secret linear congruential generators are not cryptographically secure
inferredcites →https://doi.org/10.1109/tit.1985.1056997openalex-snapshot
Deciphering a linear congruential encryption
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/22145.22184openalex-snapshot
The cryptographic security of truncated linearly related variables
inferredcites →https://doi.org/10.1145/58562.59305openalex-snapshot
Inferring sequences produced by pseudo-random number generators
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_31openalex-snapshot
Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_7openalex-snapshot
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_20openalex-snapshot
Bandwidth-Optimal Kleptographic Attacks
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_3openalex-snapshot
On Sufficient Randomness for Secure Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_2openalex-snapshot
Enhancing an Attack to DSA Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-33491-8_35openalex-snapshot
New Class of Non-binary Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_23openalex-snapshot
The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA
inferred← citeshttps://doi.org/10.1007/978-3-319-04852-9_9openalex-snapshot
On the Practical Security of a Leakage Resilient Masking Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_16openalex-snapshot
Efficient Masked S-Boxes Processing – A Step Forward –
inferred← citeshttps://doi.org/10.1007/978-3-319-69284-5_4openalex-snapshot
Security of Pseudo-Random Number Generators with Input
inferred← citeshttps://doi.org/10.1007/978-3-322-89817-3_21openalex-snapshot
Benutzerüberwachte Erzeugung von DSA-Schlüsseln in Chipkarten
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_31openalex-snapshot
Attacking DSA Under a Repeated Bits Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_31openalex-snapshot
The Insecurity of Esign in Practical Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_29openalex-snapshot
Periodical Multi-secret Threshold Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_9openalex-snapshot
Extended Hidden Number Problem and Its Cryptanalytic Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-88625-9_18openalex-snapshot
Pseudo-randomness Inside Web Browsers
inferred← citeshttps://doi.org/10.1007/978-3-642-04138-9_23openalex-snapshot
The Frequency Injection Attack on Ring-Oscillator-Based True Random Number Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-16626-6_20openalex-snapshot
Trident, a New Pseudo Random Number Generator Based on Coupled Chaotic Maps
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_17openalex-snapshot
Attacking (EC)DSA Given Only an Implicit Hint
inferred← citeshttps://doi.org/10.1007/978-3-642-40663-8_13openalex-snapshot
Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm
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/978-3-662-48324-4_15openalex-snapshot
Practical Key Recovery for Discrete-Logarithm Based Authentication Schemes from Random Nonce Bits
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_20openalex-snapshot
Polynomial Evaluation and Side Channel Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_3openalex-snapshot
Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-981-10-5421-1_5openalex-snapshot
Rounding Technique’s Application in Schnorr Signature Algorithm: Known Partially Most Significant Bits of Nonce
inferred← citeshttps://doi.org/10.1007/s00200-011-0154-4openalex-snapshot
Some lattice attacks on DSA and ECDSA
inferred← citeshttps://doi.org/10.1007/s10207-018-0422-4openalex-snapshot
Double-spending prevention for Bitcoin zero-confirmation transactions
inferred← citeshttps://doi.org/10.1007/s10623-008-9246-yopenalex-snapshot
A variant of Digital Signature Algorithm
inferred← citeshttps://doi.org/10.1023/a:1025436905711openalex-snapshot
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
inferred← citeshttps://doi.org/10.1080/01611194.2014.915262openalex-snapshot
Accelerating DSA Signature Generation
inferred← citeshttps://doi.org/10.1080/09720529.2019.1675300openalex-snapshot
Meta-heuristic approaches to solve shortest lattice vector problem
inferred← citeshttps://doi.org/10.1080/09720529.2020.1796335openalex-snapshot
A DSA-like digital signature protocol
inferred← citeshttps://doi.org/10.1103/physreva.99.052305openalex-snapshot
Analysis of the effects of imperfections in an optical heterodyne quantum random-number generator
inferred← citeshttps://doi.org/10.1109/access.2021.3082704openalex-snapshot
An Efficient Double Parameter Elliptic Curve Digital Signature Algorithm for Blockchain
inferred← citeshttps://doi.org/10.1109/aina.2009.61openalex-snapshot
Tracking Anonymous Sinks in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00037openalex-snapshot
Formal Analysis of Random Nonce Misuses in Cryptographic Protocols
inferred← citeshttps://doi.org/10.1109/eiconrus49466.2020.9039349openalex-snapshot
New Class of Pseudorandom Number Generators for Logic Encryption Realization
inferred← citeshttps://doi.org/10.1109/icsp62122.2024.10743464openalex-snapshot
A Highly Secure Digital Signature Algorithm Without Modulo Inverse Operations
inferred← citeshttps://doi.org/10.1109/isca66397.2026.00086openalex-snapshot
$\mu$RNG: A Framework for Assessing Randomness in Intermittent Computing Devices
inferred← citeshttps://doi.org/10.1109/lpt.2024.3522239openalex-snapshot
Parametric Study of Chaotic Combs for High-Rate Random Number Generation
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743432openalex-snapshot
The shortest vector in a lattice is hard to approximate to within some constant
inferred← citeshttps://doi.org/10.1109/sp.2007.14openalex-snapshot
DSSS-Based Flow Marking Technique for Invisible Traceback
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3615713openalex-snapshot
Blockchain-Assisted Weighted Threshold EdDSA With Rational Identifiable Aborts
inferred← citeshttps://doi.org/10.1109/temc.2022.3189372openalex-snapshot
Electromagnetic Side-Channel Analysis Against TERO-Based TRNG
inferred← citeshttps://doi.org/10.1109/tpds.2008.255openalex-snapshot
An Invisible Localization Attack to Internet Threat Monitors
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase.2019.00115openalex-snapshot
Secure Data Streaming to Untrusted Road Side Units in Intelligent Transportation System
inferred← citeshttps://doi.org/10.1145/2508859.2516738openalex-snapshot
More efficient oblivious transfer and extensions for faster secure computation
inferred← citeshttps://doi.org/10.1145/3607199.3607230openalex-snapshot
How (Not) to Build Threshold EdDSA
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.1587/transfun.2019eap1130openalex-snapshot
A True Random Number Generator Method Embedded in Wireless Communication Systems
inferred← citeshttps://doi.org/10.20868/upm.thesis.15395openalex-snapshot
Contribución al estudio del criptoanálisis y diseño de los criptosistemas caóticos
inferred← citeshttps://doi.org/10.21681/2311-3456-2019-3-45-50openalex-snapshot
Way to Ensure Universal Protection of Information Transmitted via Communication Channels
inferred← citeshttps://doi.org/10.3390/e27030299openalex-snapshot
Hyperchaotic System-Based PRNG and S-Box Design for a Novel Secure Image Encryption
inferred← citeshttps://doi.org/10.4213/mvk269openalex-snapshot
Применение теории решеток к анализу схем цифровой подписи
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0212055openalex-snapshot
Mathematical foundations of modern cryptography: computational complexity perspective
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
inferred← citeshttps://doi.org/10.5220/0006394200310042openalex-snapshot
A Lightweight Integrity Protection Scheme for Fast Communications in Smart Grid
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.