On the public citation graph
Cryptanalysis of the Ajtai-Dwork cryptosystem
0 signed · 72 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.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferredcites →https://doi.org/10.1007/bf01201999openalex-snapshot
Improved low-density subset sum algorithms
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1007/bfb0052230openalex-snapshot
Eliminating decryption errors in the Ajtai-Dwork Cryptosystem
inferredcites →https://doi.org/10.1007/bfb0052236openalex-snapshot
Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
inferredcites →https://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferredcites →https://doi.org/10.1007/s001459900042openalex-snapshot
Lattice Reduction: A Toolbox for the Cryptanalyst
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1109/sfcs.1982.5openalex-snapshot
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
inferredcites →https://doi.org/10.1109/sfcs.1982.55openalex-snapshot
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
inferredcites →https://doi.org/10.1109/sfcs.1983.70openalex-snapshot
Solving low density subset sum problems
inferredcites →https://doi.org/10.1109/sfcs.1987.51openalex-snapshot
Secret linear congruential generators are not cryptographically secure
inferredcites →https://doi.org/10.1109/sfcs.1997.646135openalex-snapshot
An improved worst-case to average-case connection for lattice problems
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258604openalex-snapshot
A public-key cryptosystem with worst-case/average-case equivalence
inferredcites →https://doi.org/10.1145/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
inferredcites →https://doi.org/10.1145/800061.808771openalex-snapshot
On breaking generalized knapsack public key cryptosystems
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/11941378_12openalex-snapshot
Another Look at “Provable Security”. II
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_3openalex-snapshot
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_18openalex-snapshot
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_17openalex-snapshot
Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC ’97
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_7openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-12942-2_3openalex-snapshot
Post-quantum Cryptography and a (Qu)Bit More
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_1openalex-snapshot
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-70881-8_11openalex-snapshot
Error-Free Lattice-Based Key Encapsulation Mechanism Based on Ring-LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_11openalex-snapshot
A Public-Key Encryption Scheme Based on Non-linear Indeterminate Equations
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_29openalex-snapshot
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_21openalex-snapshot
Multi-bit Cryptosystems Based on Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_10openalex-snapshot
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-88702-7_5openalex-snapshot
Lattice-based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_28openalex-snapshot
Broadcast Attacks against Lattice-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_11openalex-snapshot
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_13openalex-snapshot
Cryptographic Functions from Worst-Case Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-14712-8_8openalex-snapshot
Accelerating Lattice Reduction with FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_21openalex-snapshot
Recursive Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-21031-0_12openalex-snapshot
Improving BDD Cryptosystems in General Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-25513-7_10openalex-snapshot
A New Lattice-Based Public-Key Cryptosystem Mixed with a Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-27890-7_9openalex-snapshot
A General NTRU-Like Framework for Constructing Lattice-Based Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_2openalex-snapshot
Another Look at Provable Security
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_40openalex-snapshot
A Thirty Year Old Conjecture about Promise Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-34129-8_5openalex-snapshot
Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-642-35404-5_4openalex-snapshot
Cryptanalysis of a Lattice-Knapsack Mixed Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-662-49890-3_31openalex-snapshot
Practical, Predictable Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1007/978-981-96-7520-3_6openalex-snapshot
Contemporary Cryptography Against Quantum Computing and LBC on Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-981-97-9743-1_3openalex-snapshot
Guarding Against Quantum Threats: A Survey of Post-Quantum Cryptography Standardization, Techniques, and Current Implementations
inferred← citeshttps://doi.org/10.1007/978-981-99-1912-3_1openalex-snapshot
Post Quantum Cryptography Algorithms: A Review and Applications
inferred← citeshttps://doi.org/10.1007/978-981-99-8661-3_2openalex-snapshot
Future of Cryptography in the Era of Quantum Computing
inferred← citeshttps://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00037-015-0107-6openalex-snapshot
A thirty Year old conjecture about promise problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.060openalex-snapshot
Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
inferred← citeshttps://doi.org/10.1049/ip-ifs:20060075openalex-snapshot
Cryptanalysis of a public key cryptosystem based on two cryptographic assumptions
inferred← citeshttps://doi.org/10.1109/icirca65293.2025.11089519openalex-snapshot
Advancing Post-Quantum Cryptography: A Hybrid Lattice- Hash Approach
inferred← citeshttps://doi.org/10.1109/icoin56518.2023.10048976openalex-snapshot
Post Quantum Cryptography: A Review of Techniques, Challenges and Standardizations
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743500openalex-snapshot
Oblivious transfer with a memory-bounded receiver
inferred← citeshttps://doi.org/10.1109/tit.2010.2103790openalex-snapshot
A Ciphertext-Only Attack Against the Cai-Cusick Lattice-Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1134/s1990478923040087openalex-snapshot
Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems
inferred← citeshttps://doi.org/10.14569/ijacsa.2018.090354openalex-snapshot
The Impact of Quantum Computing on Present Cryptography
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.470openalex-snapshot
Dihedral Hidden Subgroup Problem: A Survey
inferred← citeshttps://doi.org/10.3390/iot2010005openalex-snapshot
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
inferred← citeshttps://doi.org/10.5772/56687openalex-snapshot
Homomorphic Encryption — Theory and Application
inferred← citeshttps://doi.org/10.70675/a4c4e8d2z5e4cz4eafzbf6bzfb9b77e3cfb7openalex-snapshot
Authentication and encryption protocols : design, attacks and algorithmic improvements
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.