On the public citation graph
Integer programming and cryptography
0 signed · 20 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/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf03023055openalex-snapshot
A new linear programming algorithm — better or worse than the Simplex Method?
inferredcites →https://doi.org/10.1007/bf03028244openalex-snapshot
Cryptology: The Mathematics of Secure Communication
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/tit.1978.1055927openalex-snapshot
Hiding information and signatures in trapdoor knapsacks
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/978-3-662-45670-5_16openalex-snapshot
The 0-1 Knapsack Polytope – A Starting Point for Cryptanalysis of Knapsack Ciphers?
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90042-0openalex-snapshot
Lower time bounds for integer programming with two variables
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.110168openalex-snapshot
Optimizing the selection of the secret parameters for public key cryptosystems by using interval linear programming and fully fuzzy linear programming
inferred← citeshttps://doi.org/10.1051/ps:2008012openalex-snapshot
On the reduction of a random basis
inferred← citeshttps://doi.org/10.1137/s0036141000367977openalex-snapshot
Self-Similar Lattice Tilings and Subdivision Schemes
inferred← citeshttps://doi.org/10.3390/math7080752openalex-snapshot
Development of Public Key Cryptographic Algorithm Using Matrix Pattern for Tele-Ultrasound Applications
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604331openalex-snapshot
On the reduction of a random basis
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/eddd8ffazdcb3z4837z8bf7z30902ba105e6openalex-snapshot
Integrity, authentication and confidentiality in public-key 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.