On the public citation graph

Rankin’s Constant and Blockwise Lattice Reduction

0 signed · 86 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/11426639_13openalex-snapshot
Floating-Point LLL Revisited
inferredcites →https://doi.org/10.1007/3-540-44670-2openalex-snapshot
Cryptography and Lattices
inferredcites →https://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/3-540-48910-xopenalex-snapshot
Advances in Cryptology — EUROCRYPT ’99
inferredcites →https://doi.org/10.1007/3-540-48910-x_1openalex-snapshot
Cryptanalysis of RSA with Private Key d Less than N 0.292
inferredcites →https://doi.org/10.1007/3-540-49264-xopenalex-snapshot
Advances in Cryptology — EUROCRYPT ’95
inferredcites →https://doi.org/10.1007/3-540-49264-x_1openalex-snapshot
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7openalex-snapshot
Complexity of Lattice Problems
inferredcites →https://doi.org/10.1007/978-1-4757-6568-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-0348-8037-4_17openalex-snapshot
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
inferredcites →https://doi.org/10.1007/978-3-642-88330-9openalex-snapshot
Symmetric Bilinear Forms
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/b136415openalex-snapshot
Advances in Cryptology-- EUROCRYPT 2005 : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques : Aarhus, Denmark, May 22-26, 2005 : proceedings
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/s00145-002-0021-3openalex-snapshot
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
inferredcites →https://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferredcites →https://doi.org/10.1016/0196-6774(88)90004-1openalex-snapshot
A more efficient algorithm for lattice basis reduction
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.1016/s0166-218x(00)00341-3openalex-snapshot
Radon transforms and packings
inferredcites →https://doi.org/10.1016/s0304-0208(08)70410-9openalex-snapshot
Rational Quadratic Forms
inferredcites →https://doi.org/10.1023/a:1011214926272openalex-snapshot
Lattice Attacks on Digital Signature Schemes
inferredcites →https://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.850673openalex-snapshot
Cryptanalysis of RSA with private key d less than N/sup 0.292/
inferredcites →https://doi.org/10.1112/blms/2.3.383bopenalex-snapshot
London Mathematical Society Monographs
inferredcites →https://doi.org/10.1112/jlms/s1-28.3.309openalex-snapshot
On Positive Definite Quadratic Forms
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
inferredcites →https://doi.org/10.1145/380752.380857openalex-snapshot
A sieve algorithm for the shortest lattice vector problem
inferredcites →https://doi.org/10.1145/780542.780602openalex-snapshot
The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
inferredcites →https://doi.org/10.1307/mmj/1030132184openalex-snapshot
Higher-dimensional analogs of Hermite's constant.
inferredcites →https://doi.org/10.1515/crll.1850.40.279openalex-snapshot
Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres. (Continuation).
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.

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-030-56880-1_10openalex-snapshot
Slide Reduction, Revisited—Filling the Gaps in SVP Approximation
inferred← citeshttps://doi.org/10.1007/978-3-031-26553-2_24openalex-snapshot
Subfield Attacks on HSVP in Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_1openalex-snapshot
Second Order Statistical Behavior of LLL and BKZ
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-74143-5_9openalex-snapshot
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_3openalex-snapshot
Predicting Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_24openalex-snapshot
Rigorous and Efficient Short Lattice Vectors Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_2openalex-snapshot
Hermite’s Constant and Lattice Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_4openalex-snapshot
Progress on LLL and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_2openalex-snapshot
Lattice Reduction Algorithms: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_10openalex-snapshot
Algorithms for the Shortest and Closest Lattice Vector Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_25openalex-snapshot
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_1openalex-snapshot
BKZ 2.0: Better Lattice Security Estimates
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_2openalex-snapshot
A Three-Level Sieve Algorithm for the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-49890-3_31openalex-snapshot
Practical, Predictable Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1007/jhep01(2026)014openalex-snapshot
Analytic regression of Feynman integrals from high-precision numerical sampling
inferred← citeshttps://doi.org/10.1007/jhep11%282017%29036openalex-snapshot
Systematics of aligned axions
inferred← citeshttps://doi.org/10.1007/jhep11(2017)036openalex-snapshot
Systematics of aligned axions
inferred← citeshttps://doi.org/10.1007/s00145-024-09527-0openalex-snapshot
A Complete Analysis of the BKZ Lattice Reduction Algorithm
inferred← citeshttps://doi.org/10.1007/s10623-016-0273-9openalex-snapshot
Bounding basis reduction properties
inferred← citeshttps://doi.org/10.1007/s10623-022-01048-wopenalex-snapshot
Sharper bounds on four lattice constants
inferred← citeshttps://doi.org/10.1007/s10623-025-01654-4openalex-snapshot
About the Rankin and Bergé-Martinet constants from a coding theory view point
inferred← citeshttps://doi.org/10.1007/s10623-025-01772-zopenalex-snapshot
On the ability to approximate k-DSP of HKZ, BKZ and Slide reduction
inferred← citeshttps://doi.org/10.1007/s42979-026-05231-xopenalex-snapshot
Survey of Integer Factorization Using Lattice-Based Algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.017openalex-snapshot
Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.022openalex-snapshot
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
inferred← citeshttps://doi.org/10.1017/s0004972713000257openalex-snapshot
SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS
inferred← citeshttps://doi.org/10.1109/focs.2011.31openalex-snapshot
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
inferred← citeshttps://doi.org/10.1109/tit.2008.924662openalex-snapshot
NTRUSign With a New Perturbation
inferred← citeshttps://doi.org/10.1109/tit.2022.3143620openalex-snapshot
An Algorithmic Reduction Theory for Binary Codes: LLL and More
inferred← citeshttps://doi.org/10.1109/tsp.2017.2708020openalex-snapshot
Boosted KZ and LLL Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2020.3036647openalex-snapshot
Lattice Reduction Over Imaginary Quadratic Fields
inferred← citeshttps://doi.org/10.1112/s1461157014000229openalex-snapshot
A sieve algorithm based on overlattices
inferred← citeshttps://doi.org/10.1112/s1461157014000333openalex-snapshot
Approximating the densest sublattice from Rankin’s inequality
inferred← citeshttps://doi.org/10.1137/070705702openalex-snapshot
An LLL Algorithm with Quadratic Complexity
inferred← citeshttps://doi.org/10.1142/s0219498825503803openalex-snapshot
Some upper bounds on dense module sublattices from number fields
inferred← citeshttps://doi.org/10.1145/1374376.1374408openalex-snapshot
Finding short lattice vectors within mordell's inequality
inferred← citeshttps://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferred← citeshttps://doi.org/10.1145/2930889.2930917openalex-snapshot
Faster LLL-type Reduction of Lattice Bases
inferred← citeshttps://doi.org/10.1145/3087604.3087665openalex-snapshot
Lattice Reduction Algorithms
inferred← citeshttps://doi.org/10.1145/3452143.3465517openalex-snapshot
On the Smallest Ratio Problem of Lattice Bases
inferred← citeshttps://doi.org/10.1155/2021/8852497openalex-snapshot
Three Strategies for Improving Shortest Vector Enumeration Using GPUs
inferred← citeshttps://doi.org/10.11591/ijins.v1i4.798openalex-snapshot
Attack on Fully Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1515/jmc.2008.009openalex-snapshot
Sieve algorithms for the shortest vector problem are practical
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.1091openalex-snapshot
Explicit Relation between Low-Dimensional LLL-Reduced Bases and Shortest Vectors
inferred← citeshttps://doi.org/10.3166/tsi.29.115-144openalex-snapshot
Analyse numérique et réduction de réseaux
inferred← citeshttps://doi.org/10.3390/cryptography10010010openalex-snapshot
Some Mathematical Problems Behind Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.4018/979-8-3693-2786-9.ch018openalex-snapshot
Lattice-Aided Delay Phase Precoding for 6G THz Massive MIMO
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3331openalex-snapshot
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases
inferred← citeshttps://doi.org/10.48550/arxiv.1605.03613openalex-snapshot
On the Lattice Distortion Problem
inferred← citeshttps://doi.org/10.62056/ae0fhsfgopenalex-snapshot
Lattice Reduction via Dense Sublattices: A Cryptanalytic No-Go
inferred← citeshttps://doi.org/10.70675/b4984555z93b2z4d09z96ddz34e19b9207d3openalex-snapshot
Contributions to the hardness foundations of lattice-based 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.