On the public citation graph

On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem

https://doi.org/10.1137/0215038
0 signed · 61 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/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1109/tit.1978.1055927openalex-snapshot
Hiding information and signatures in trapdoor knapsacks
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0093openalex-snapshot
Basis Reduction Methods
inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/scj.4690210201openalex-snapshot
An Algorithm Using Modular Arithmetic for the Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/11538462_32openalex-snapshot
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem
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-46416-6_4openalex-snapshot
An Improved Low-Density Subset Sum Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_51openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_70openalex-snapshot
Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_178openalex-snapshot
Two notes on low-density subset sum algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-78679-2_10openalex-snapshot
Subset-Optimized BLS Multi-signature with Key Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-319-53518-0_7openalex-snapshot
A Review of Modern Cryptography: From the World War II Era to the Big-Data Era
inferred← citeshttps://doi.org/10.1007/978-3-319-74325-7_4openalex-snapshot
Solutions of Hard Knapsack Problems Using Extreme Pruning
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_25openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_31openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_23openalex-snapshot
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_11openalex-snapshot
Semi-homomorphic Encryption and Multiparty Computation
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-39212-2_48openalex-snapshot
Outsourced Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_23openalex-snapshot
Solving Random Subset Sum Problem by l p -norm SVP Oracle
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-49384-7_2openalex-snapshot
Chosen-Ciphertext Security from Subset Sum
inferred← citeshttps://doi.org/10.1007/978-88-470-2481-6_9openalex-snapshot
Reticoli e crittografia
inferred← citeshttps://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferred← citeshttps://doi.org/10.1007/bf01201999openalex-snapshot
Improved low-density subset sum algorithms
inferred← citeshttps://doi.org/10.1007/bf01571276openalex-snapshot
Lattice points in high-dimensional spheres
inferred← citeshttps://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/s001459900042openalex-snapshot
Lattice Reduction: A Toolbox for the Cryptanalyst
inferred← citeshttps://doi.org/10.1007/s00493-024-00119-xopenalex-snapshot
Reconstruction in One Dimension from Unlabeled Euclidean Lengths
inferred← citeshttps://doi.org/10.1007/s10207-017-0374-0openalex-snapshot
Outsourced pattern matching
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.09.006openalex-snapshot
Safer parameters for the Chor–Rivest cryptosystem
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.004openalex-snapshot
Random knapsack in expected polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.015openalex-snapshot
Tightly secure signature schemes from the LWE and subset sum assumptions
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00162-xopenalex-snapshot
Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
inferred← citeshttps://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
inferred← citeshttps://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferred← citeshttps://doi.org/10.1109/isit.2019.8849681openalex-snapshot
High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm
inferred← citeshttps://doi.org/10.1109/isita.2010.5649321openalex-snapshot
On the critical density associated with the matrix type knapsack cryptosystem
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63484openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
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/tit.2021.3113921openalex-snapshot
Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection
inferred← citeshttps://doi.org/10.1137/0218037openalex-snapshot
Succinct Certificates for Almost All Subset Sum Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973075.100openalex-snapshot
Basis Reduction and the Complexity of Branch-and-Bound
inferred← citeshttps://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
inferred← citeshttps://doi.org/10.1145/1122018.1122057openalex-snapshot
Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations
inferred← citeshttps://doi.org/10.1145/780542.780578openalex-snapshot
Random knapsack in expected polynomial time
inferred← citeshttps://doi.org/10.1146/annurev.cs.02.060187.001311openalex-snapshot
Algorithmic Geometry of Numbers
inferred← citeshttps://doi.org/10.17615/jgnj-9667openalex-snapshot
Topics in basis reduction and integer programming
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2411586/v1openalex-snapshot
Provably Solving the Subset Sum Problem by lp-norm SVP Oracle
inferred← citeshttps://doi.org/10.32657/10356/146200openalex-snapshot
Post quantum cryptographic constructions
inferred← citeshttps://doi.org/10.3934/amc.2018026openalex-snapshot
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
inferred← citeshttps://doi.org/10.4086/cjtcs.2006.002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0023openalex-snapshot
Branching proofs of infeasibility in low density subset sum problems
inferred← citeshttps://doi.org/10.48550/arxiv.1803.06716openalex-snapshot
High Dimensional Linear Regression using Lattice Basis Reduction
inferred← citeshttps://doi.org/10.48550/arxiv.2106.10744openalex-snapshot
On the Cryptographic Hardness of Learning Single Periodic Neurons
inferred← citeshttps://doi.org/10.70675/b78e77c5za6bfz41eezb3b7z8734d9cf32feopenalex-snapshot
Using signature and Topology of Data for anomaly detection and signal processing
inferred← citeshttps://doi.org/10.7273/000006208openalex-snapshot
A knapsack-type cryptographic system using algebraic number rings
inferred← citeshttps://doi.org/10.7916/d8-178q-4v02openalex-snapshot
Cryptographic approaches to security and optimization in machine learning
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.