On the public citation graph

Practical Lattice Basis Sampling Reduction

0 signed · 38 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-36494-3_14openalex-snapshot
Lattice Reduction by Random Sampling and Birthday Methods
inferredcites →https://doi.org/10.1007/3-540-44670-2openalex-snapshot
Cryptography and Lattices
inferredcites →https://doi.org/10.1007/3-540-44670-2_11openalex-snapshot
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
inferredcites →https://doi.org/10.1007/3-540-69053-0_5openalex-snapshot
Lattice Attacks on NTRU
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/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/bfb0052231openalex-snapshot
Public-key cryptosystems from lattice reduction problems
inferredcites →https://doi.org/10.1007/bfb0054868openalex-snapshot
NTRU: A ring-based public key cryptosystem
inferredcites →https://doi.org/10.1007/s00145-001-0009-4openalex-snapshot
Selecting Cryptographic Key Sizes
inferredcites →https://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferredcites →https://doi.org/10.1109/jproc.2004.840301openalex-snapshot
The Design and Implementation of FFTW3

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-30619-9_12openalex-snapshot
An Enumeration-Like Vector Sampling Method for Solving Approximate SVP
inferred← citeshttps://doi.org/10.1007/978-3-030-58208-1_9openalex-snapshot
Optimization of Search Space for Finding Very Short Lattice Vectors
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_3openalex-snapshot
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
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-319-76578-5_15openalex-snapshot
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-88403-3_6openalex-snapshot
Explicit Hard Instances of the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_1openalex-snapshot
Secure Parameters for SWIFFT
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_4openalex-snapshot
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_11openalex-snapshot
Random Sampling for Short Lattice Vectors on Graphics Cards
inferred← citeshttps://doi.org/10.1007/978-3-642-42001-6_6openalex-snapshot
Factoring Integers by CVP Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-49890-3_30openalex-snapshot
Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
inferred← citeshttps://doi.org/10.1109/access.2017.2748179openalex-snapshot
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis
inferred← citeshttps://doi.org/10.1109/ewdts.2019.8884427openalex-snapshot
Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition
inferred← citeshttps://doi.org/10.1109/hpcc64274.2024.00089openalex-snapshot
High-Speed Implementation of Lattice Enumeration with Discrete Pruning for Solving the SVP
inferred← citeshttps://doi.org/10.1109/infocommst.2017.8246411openalex-snapshot
Morden attacks analysis for NTRU-similar algorithms
inferred← citeshttps://doi.org/10.1145/1151030.1151055openalex-snapshot
Perspectives for cryptographic long-term security
inferred← citeshttps://doi.org/10.1145/3327958.3329543openalex-snapshot
Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption
inferred← citeshttps://doi.org/10.1515/jmc-2016-0008openalex-snapshot
Analysis of decreasing squared-sum of Gram–Schmidt lengths for short lattice vectors
inferred← citeshttps://doi.org/10.2197/ipsjjip.20.785openalex-snapshot
Finding a Very Short Lattice Vector in the Extended Search Space
inferred← citeshttps://doi.org/10.23919/isita.2018.8664341openalex-snapshot
An Observation on the Randomness Assumption over Lattices
inferred← citeshttps://doi.org/10.26083/tuprints-00002387openalex-snapshot
Towards Efficient Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.26083/tuprints-00002829openalex-snapshot
Computing Shortest Lattice Vectors on Special Hardware
inferred← citeshttps://doi.org/10.26421/qic18.3-4-7openalex-snapshot
Space-efficient classical and quantum algorithms for the shortest vector problem
inferred← citeshttps://doi.org/10.37135/unach.ns.001.04.06openalex-snapshot
Graphic User Interface for Synchrotron Beamline
inferred← citeshttps://doi.org/10.5815/ijcnis.2018.09.02openalex-snapshot
Using Progressive Success Probabilities for Sound-pruned Enumerations in BKZ Algorithm
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.