On the public citation graph

LLL on the Average

0 signed · 161 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/10722028openalex-snapshot
Algorithmic Number Theory
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-44670-2_8openalex-snapshot
Segment LLL-Reduction with Floating Point Orthogonalization
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7openalex-snapshot
Complexity of Lattice Problems
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/978-3-662-53018-4openalex-snapshot
Advances in Cryptology – CRYPTO 2016
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/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
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/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/s0304-0208(08)70410-9openalex-snapshot
Rational Quadratic Forms
inferredcites →https://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181998openalex-snapshot
Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties
inferredcites →https://doi.org/10.1112/blms/2.3.383bopenalex-snapshot
London Mathematical Society Monographs
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
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.1145/944618.944619openalex-snapshot
Heuristics on lattice basis reduction in practice
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
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.1515/form.2003.009openalex-snapshot
On the equidistribution of Hecke points
inferredcites →https://doi.org/10.2307/1969027openalex-snapshot
A Mean Value Theorem in Geometry of Numbers
inferredcites →https://doi.org/10.48550/arxiv.cs/0505027openalex-snapshot
The Generic Multiple-Precision Floating-Point Addition With Exact Rounding (as in the MPFR Library)
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sec.297openalex-snapshot
A non‐associative lattice‐based public key cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_12openalex-snapshot
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-30530-7_1openalex-snapshot
Quantum LLL with an Application to Mersenne Number Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-32101-7_1openalex-snapshot
Biased Nonce Sense: Lattice Attacks Against Weak ECDSA Signatures in Cryptocurrencies
inferred← citeshttps://doi.org/10.1007/978-3-030-36711-4_51openalex-snapshot
Secure Outsourcing of Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_18openalex-snapshot
A Tale of Three Signatures: Practical Attack of ECDSA with wNAF
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_12openalex-snapshot
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_26openalex-snapshot
Towards Faster Polynomial-Time Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_3openalex-snapshot
Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-93206-0_14openalex-snapshot
Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_6openalex-snapshot
The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_1openalex-snapshot
Fast Practical Lattice Reduction Through Iterated Compression
inferred← citeshttps://doi.org/10.1007/978-3-031-52163-8_5openalex-snapshot
Rational Approximations, Multidimensional Continued Fractions, and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_12openalex-snapshot
On the Possibility of a Backdoor in the Micali-Schnorr Generator
inferred← citeshttps://doi.org/10.1007/978-3-031-62743-9_12openalex-snapshot
Improved Provable Reduction of NTRU and Hypercubic Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-01806-9_1openalex-snapshot
Improved PACD-Based Attacks on RSA-CRT
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_15openalex-snapshot
On the Dangers of RSA Exponent Transforms
inferred← citeshttps://doi.org/10.1007/978-3-319-16745-9_12openalex-snapshot
Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
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-78381-9_4openalex-snapshot
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-79063-3_5openalex-snapshot
Attacks on the AJPS Mersenne-Based Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-540-71039-4_4openalex-snapshot
SWIFFT: A Modest Proposal for FFT Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_8openalex-snapshot
Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003
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-75187-8_4openalex-snapshot
An Efficient LLL Gram Using Buffered Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_17openalex-snapshot
A Digital Signature Scheme Based on CVP ∞
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-79499-8_32openalex-snapshot
Cryptanalysis of General Lu-Lee Type Systems
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-01957-9_28openalex-snapshot
Broadcast Attacks against Lattice-Based Cryptosystems
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-02295-1_2openalex-snapshot
Hermite’s Constant and Lattice Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_3openalex-snapshot
Probabilistic Analyses of Lattice Reduction 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-02295-1_5openalex-snapshot
Floating-Point LLL: Theoretical and Practical Aspects
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_6openalex-snapshot
LLL: A Tool for Effective Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_88openalex-snapshot
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_25openalex-snapshot
Modelling the LLL Algorithm by Sandpiles
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-13190-5_13openalex-snapshot
Lattice Enumeration Using Extreme Pruning
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-17499-5_2openalex-snapshot
NTRU-Like Public Key Cryptosystems beyond Dedekind Domain up to Alternative Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_11openalex-snapshot
Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
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-642-29011-4_30openalex-snapshot
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_18openalex-snapshot
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_28openalex-snapshot
On the Optimality of Lattices for the Coppersmith Technique
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_18openalex-snapshot
Lattice Reduction for Modular Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_8openalex-snapshot
Adaptive Precision Floating Point LLL
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-45239-0_17openalex-snapshot
Estimating Key Sizes for High Dimensional Lattice-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_11openalex-snapshot
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
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_30openalex-snapshot
Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
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-95-5099-9_3openalex-snapshot
Towards a Modern LLL Implementation
inferred← citeshttps://doi.org/10.1007/978-981-96-8731-2_38openalex-snapshot
A PSO-Based Method for Finding Approximately Optimal Order for LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-97-0945-8_12openalex-snapshot
Improved Herrmann-May’s Attack with Merging Variables and Lower LLL Bound
inferred← citeshttps://doi.org/10.1007/978-981-99-8727-6_5openalex-snapshot
Concrete Analysis of Quantum Lattice Enumeration
inferred← citeshttps://doi.org/10.1007/s00145-023-09487-xopenalex-snapshot
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation
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/s00778-024-00852-1openalex-snapshot
Efficient cryptanalysis of an encrypted database supporting data interoperability
inferred← citeshttps://doi.org/10.1007/s10207-017-0374-0openalex-snapshot
Outsourced pattern matching
inferred← citeshttps://doi.org/10.1007/s10207-020-00501-yopenalex-snapshot
Studying lattice reduction algorithms improved by quick reordering technique
inferred← citeshttps://doi.org/10.1007/s10623-014-9918-8openalex-snapshot
PotLLL: a polynomial time version of LLL with deep insertions
inferred← citeshttps://doi.org/10.1007/s10623-014-9957-1openalex-snapshot
LLL for ideal lattices: re-evaluation of the security of Gentry–Halevi’s FHE scheme
inferred← citeshttps://doi.org/10.1007/s10623-016-0273-9openalex-snapshot
Bounding basis reduction properties
inferred← citeshttps://doi.org/10.1007/s10623-020-00729-8openalex-snapshot
Predicting truncated multiple recursive generators with unknown parameters
inferred← citeshttps://doi.org/10.1007/s10623-022-01175-4openalex-snapshot
An improved method for predicting truncated multiple recursive generators with unknown parameters
inferred← citeshttps://doi.org/10.1007/s10623-026-01943-6openalex-snapshot
An improved method for predicting truncated Fibonacci LFSRs over integer residue rings
inferred← citeshttps://doi.org/10.1007/s10878-024-01183-1openalex-snapshot
On the SVP for low-dimensional circulant lattices
inferred← citeshttps://doi.org/10.1007/s11432-009-0159-9openalex-snapshot
Probability method for cryptanalysis of general multivariate modular linear equation
inferred← citeshttps://doi.org/10.1007/s11432-013-4967-6openalex-snapshot
A new parallel lattice reduction algorithm for BKZ reduced bases
inferred← citeshttps://doi.org/10.1007/s11859-017-1258-xopenalex-snapshot
Identity-based blind signature from lattices
inferred← citeshttps://doi.org/10.1007/s13160-025-00713-6openalex-snapshot
On tiny-probability lattice enumeration
inferred← citeshttps://doi.org/10.1007/s13389-025-00382-8openalex-snapshot
Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
inferred← citeshttps://doi.org/10.1016/j.ins.2015.07.021openalex-snapshot
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.laa.2020.12.022openalex-snapshot
Storage efficient algorithm for Hermite Normal Form using LLL
inferred← citeshttps://doi.org/10.1016/j.pnsc.2008.09.013openalex-snapshot
Remarks on the bounds for cryptanalysis of low private key RSA
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.011openalex-snapshot
Lower bounds of shortest vector lengths in random NTRU lattices
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0400openalex-snapshot
Preprocessing optimisation: revisiting recursive‐BKZ lattice reduction algorithm
inferred← citeshttps://doi.org/10.1080/00396265.2016.1230953openalex-snapshot
An effective QR-based reduction algorithm for the fast estimation of GNSS high-dimensional ambiguity resolution
inferred← citeshttps://doi.org/10.1080/09720529.2019.1641268openalex-snapshot
Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
inferred← citeshttps://doi.org/10.1080/10586458.2025.2477565openalex-snapshot
A New Upper Bound on the Smallest Counterexample to the Mertens Conjecture
inferred← citeshttps://doi.org/10.1109/cse.2018.00012openalex-snapshot
Exploring the Performance Envelope of the LLL Algorithm
inferred← citeshttps://doi.org/10.1109/ifost.2014.6991058openalex-snapshot
Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm
inferred← citeshttps://doi.org/10.1109/isemantic67418.2025.11292031openalex-snapshot
Cracking CP256-1299: A Digital Signature on Cubic Pell Cryptosystem
inferred← citeshttps://doi.org/10.1109/isit.2013.6620387openalex-snapshot
On decoding Interleaved Chinese Remainder codes
inferred← citeshttps://doi.org/10.1109/itw55543.2023.10161639openalex-snapshot
Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179290openalex-snapshot
MEGA: Malleable Encryption Goes Awry
inferred← citeshttps://doi.org/10.1109/tit.2011.2162180openalex-snapshot
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
inferred← citeshttps://doi.org/10.1109/tit.2012.2236144openalex-snapshot
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
inferred← citeshttps://doi.org/10.1109/tit.2024.3442870openalex-snapshot
Predicting Truncated Galois Linear Feedback Shift Registers
inferred← citeshttps://doi.org/10.1109/tsp.2011.2123889openalex-snapshot
On the Proximity Factors of Lattice Reduction-Aided Decoding
inferred← citeshttps://doi.org/10.1109/tsp.2017.2708020openalex-snapshot
Boosted KZ and LLL Algorithms
inferred← citeshttps://doi.org/10.1112/s1461157016000218openalex-snapshot
Algorithms for the approximate common divisor problem
inferred← citeshttps://doi.org/10.1145/1277548.1277597openalex-snapshot
Certification of the QR factor R and of lattice basis reducedness
inferred← citeshttps://doi.org/10.1145/1993886.1993914openalex-snapshot
Practical polynomial factoring in polynomial time
inferred← citeshttps://doi.org/10.11591/closer.v2i1.1339openalex-snapshot
Fully Homomorphic Encryption, Approximate Lattice Problem and LWE
inferred← citeshttps://doi.org/10.11591/ijins.v1i4.798openalex-snapshot
Attack on Fully Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1179/1752270611y.0000000004openalex-snapshot
Integer estimation methods for GPS ambiguity resolution: an applications oriented review and improvement
inferred← citeshttps://doi.org/10.1186/1687-6180-2013-137openalex-snapshot
Experimental quality evaluation of lattice basis reduction methods for decorrelating low-dimensional integer least squares problems
inferred← citeshttps://doi.org/10.1504/ijact.2008.021085openalex-snapshot
Efficient lattice-based signature scheme
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.e96.a.150openalex-snapshot
Random Sampling Reduction with Precomputation
inferred← citeshttps://doi.org/10.2140/obs.2013.1.271openalex-snapshot
Approximate common divisors via lattices
inferred← citeshttps://doi.org/10.21468/scipostphys.16.2.041openalex-snapshot
Integrability and complexity in quantum spin chains
inferred← citeshttps://doi.org/10.23919/cje.2022.00.387openalex-snapshot
A Lattice-Based Method for Recovering the Unknown Parameters of Truncated Multiple Recursive Generators with Constant
inferred← citeshttps://doi.org/10.26083/tuprints-00002829openalex-snapshot
Computing Shortest Lattice Vectors on Special Hardware
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/e23111509openalex-snapshot
Random Integer Lattice Generation via the Hermite Normal Form
inferred← citeshttps://doi.org/10.3390/math12020173openalex-snapshot
An Improved Coppersmith Algorithm Based on Block Preprocessing
inferred← citeshttps://doi.org/10.3390/s23208568openalex-snapshot
Improved GNSS Ambiguity Fast Estimation Reduction Algorithm
inferred← citeshttps://doi.org/10.4230/dagsemproc.09221.4openalex-snapshot
Probabilistic Analysis of LLL Reduced Bases
inferred← citeshttps://doi.org/10.46298/dmtcs.3549openalex-snapshot
Lattice reduction in two dimensions: analyses under realistic probabilistic models
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.1307.7534openalex-snapshot
PotLLL : a polynomial time version of LLL with deep insertions
inferred← citeshttps://doi.org/10.48550/arxiv.1804.03285openalex-snapshot
LLL and stochastic sandpile models
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701183openalex-snapshot
Certification of the QR factor R, and of lattice basis reducedness
inferred← citeshttps://doi.org/10.62056/aevuommolopenalex-snapshot
A Greedy Global Framework for Lattice Reduction Using Deep Insertions
inferred← citeshttps://doi.org/10.62056/ahjbksdjaopenalex-snapshot
Survey: Recovering cryptographic keys from partial information, by example
inferred← citeshttps://doi.org/10.70675/03e70022z3b51z4264z86ffz300c571650d3openalex-snapshot
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks
inferred← citeshttps://doi.org/10.70675/0c2517b1z7d0fz45c9zada8z5e86a7130a01openalex-snapshot
Algorithmic aspects of algebraic lattices
inferred← citeshttps://doi.org/10.70675/56bcc9fcz1508z4cc9zac79ze1fe4f9403a5openalex-snapshot
A journey towards practical fully homomorphic encryption
inferred← citeshttps://doi.org/10.70675/e4216984z79fbz4861za70cz2a2caeeba98dopenalex-snapshot
Robust tools for weighted Chebyshev approximation and applications to digital filter design
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.