On the public citation graph

The Discrete Logarithm Hides $O(\log n)$ Bits

0 signed · 67 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/3-540-39805-8_8openalex-snapshot
Simultaneous Security of Bits in the Discrete Log
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
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/tit.1976.1055638openalex-snapshot
New directions in cryptography
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/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_6openalex-snapshot
Remove key Escrow from the Identity-Based Encryption System
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-44750-4_27openalex-snapshot
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_28openalex-snapshot
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
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-56939-1_78openalex-snapshot
Secure and efficient off-line digital money (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_56openalex-snapshot
A practical digital multisignature scheme based on discrete logarithms (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_8openalex-snapshot
How to construct a family of strong one way permutations
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_22openalex-snapshot
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
inferred← citeshttps://doi.org/10.1007/3-540-68697-5_10openalex-snapshot
All Bits in ax + b mod p are Hard
inferred← citeshttps://doi.org/10.1007/978-3-031-68397-8_4openalex-snapshot
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes
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-540-24632-9_13openalex-snapshot
Short Exponent Diffie-Hellman Problems
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-642-00457-5_28openalex-snapshot
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_18openalex-snapshot
A New Hard-Core Predicate of Paillier’s Trapdoor Function
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/bf01096271openalex-snapshot
Mathematical problems in cryptology
inferred← citeshttps://doi.org/10.1007/bfb0055737openalex-snapshot
An efficient discrete log pseudo random generator
inferred← citeshttps://doi.org/10.1007/s00145-002-0038-7openalex-snapshot
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/s11432-011-4269-9openalex-snapshot
Paillier’s trapdoor function hides Θ(n) bits
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90038-xopenalex-snapshot
The discrete logarithm modulo a composite hides 0(n) Bits
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00010-0openalex-snapshot
Stream cipher design
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00013-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-12-811129-1.00007-9openalex-snapshot
Stream Cipher Design
inferred← citeshttps://doi.org/10.1016/b978-0-12-811129-1.00016-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50018-7openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.1016/s0924-6509(04)80025-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0960129512000825openalex-snapshot
Quantum attacks on pseudorandom generators
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00935-1openalex-snapshot
Gauss periods: orders and cryptographical applications
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1109/49.223871openalex-snapshot
Immunizing public key cryptosystems against chosen ciphertext attacks
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743502openalex-snapshot
The security of individual RSA bits
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238189openalex-snapshot
Proving hard-core predicates using list decoding
inferred← citeshttps://doi.org/10.1145/100216.100271openalex-snapshot
The discrete log is very discreet
inferred← citeshttps://doi.org/10.1145/1400751.1400856openalex-snapshot
Mobile proactive secret sharing
inferred← citeshttps://doi.org/10.1145/972639.972642openalex-snapshot
The security of all RSA and discrete log bits
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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.