On the public citation graph
Floating-Point LLL Revisited
0 signed · 190 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/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-13345-3_40openalex-snapshot
Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
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-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/3-540-44670-2_7openalex-snapshot
Segment LLL-Reduction of Lattice Bases
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/3-540-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://doi.org/10.1007/3-540-48405-1_18openalex-snapshot
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97
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-54458-5_51openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7openalex-snapshot
Complexity of Lattice Problems
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-540-24847-7_26openalex-snapshot
Low-Dimensional Lattice Basis Reduction Revisited
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
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-48000-7openalex-snapshot
Advances in Cryptology -- CRYPTO 2015
inferredcites →https://doi.org/10.1007/978-3-662-53018-4openalex-snapshot
Advances in Cryptology – CRYPTO 2016
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/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
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/bfb0055731openalex-snapshot
Cryptanalysis of the Ajtai-Dwork cryptosystem
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/j.ic.2005.04.004openalex-snapshot
Fast LLL-type lattice reduction
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.1109/sfcs.1992.267808openalex-snapshot
Fast unimodular reduction: planar integer lattices
inferredcites →https://doi.org/10.1137/1.9781611971217openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.1137/1.9781611971484openalex-snapshot
Numerical Methods for Least Squares Problems
inferredcites →https://doi.org/10.1145/120694.120711openalex-snapshot
Fast reduction and composition of binary quadratic forms
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
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.3929/ethz-a-006651659openalex-snapshot
Faster algorithms for integer lattice basis reduction
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.5860/choice.34-1602openalex-snapshot
Numerical methods for least squares problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11593447_3openalex-snapshot
Adapting Density Attacks to Low-Weight Knapsacks
inferred← citeshttps://doi.org/10.1007/11761679_15openalex-snapshot
Symplectic Lattice Reduction and NTRU
inferred← citeshttps://doi.org/10.1007/11792086_17openalex-snapshot
Practical Lattice Basis Sampling Reduction
inferred← citeshttps://doi.org/10.1007/11792086_19openalex-snapshot
On the Randomness of Bits Generated by Sufficiently Smooth Functions
inferred← citeshttps://doi.org/10.1007/11818175_7openalex-snapshot
Rankin’s Constant and Blockwise Lattice Reduction
inferred← citeshttps://doi.org/10.1007/11935230_18openalex-snapshot
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
inferred← citeshttps://doi.org/10.1007/11935230_8openalex-snapshot
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_35openalex-snapshot
Certifying Variant of RSA with Generalized Moduli
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-56880-1_6openalex-snapshot
Fast Reduction of Algebraic Lattices over Cyclotomic Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_25openalex-snapshot
Lattice Reduction with Approximate Enumeration Oracles
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-030-95312-6_8openalex-snapshot
Lattice-Based Fault Attacks on Deterministic Signature Schemes of ECDSA and EdDSA
inferred← citeshttps://doi.org/10.1007/978-3-031-12244-6_38openalex-snapshot
Computational Number Theory, Past, Present, and Future
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_11openalex-snapshot
Further Improvement of Factoring RSA Moduli with Implicit Hint
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-23021-4_10openalex-snapshot
A New Partial Key Exposure Attack on Multi-power RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_6openalex-snapshot
Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-45744-4_13openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1007/978-3-319-61982-8_16openalex-snapshot
A Vectorized, Cache Efficient LLL Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-71667-1_2openalex-snapshot
A Note on Ring-LWE Security in the Case of Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-93563-8_5openalex-snapshot
An Improved Algorithm to Solve the Systems of Univariate Modular Equations
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_14openalex-snapshot
Integer Programming and Algorithmic Geometry of Numbers
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_21openalex-snapshot
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_22openalex-snapshot
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_9openalex-snapshot
Extended Hidden Number Problem and Its Cryptanalytic Applications
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-78440-1_3openalex-snapshot
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_26openalex-snapshot
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
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-85521-7_7openalex-snapshot
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
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-540-89255-7_24openalex-snapshot
Rigorous and Efficient Short Lattice Vectors Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_25openalex-snapshot
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_1openalex-snapshot
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_3openalex-snapshot
A New Lattice Construction for Partial Key Exposure Attack for RSA
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_10openalex-snapshot
Using LLL-Reduction for Solving RSA and Factorization Problems
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_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-02295-1_9openalex-snapshot
The LLL Algorithm and Integer Programming
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-10366-7_29openalex-snapshot
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_47openalex-snapshot
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
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-13013-7_5openalex-snapshot
Implicit Factoring with Shared Most Significant and Middle Bits
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-21031-0_12openalex-snapshot
Improving BDD Cryptosystems in General Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-24650-0_4openalex-snapshot
Improving the Parallel Schnorr-Euchner LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_17openalex-snapshot
Attacking (EC)DSA Given Only an Implicit Hint
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-54631-0_26openalex-snapshot
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_9openalex-snapshot
Solving Linear Equations Modulo Unknown Divisors: Revisited
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/jhep06(2024)046openalex-snapshot
More on G-flux and general hodge cycles on the Fermat sextic
inferred← citeshttps://doi.org/10.1007/s00145-006-0433-6openalex-snapshot
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
inferred← citeshttps://doi.org/10.1007/s00200-026-00751-8openalex-snapshot
Message recovery attack in NTRU via knapsack
inferred← citeshttps://doi.org/10.1007/s00453-011-9500-yopenalex-snapshot
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-020-00750-2openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1007/s10207-011-0129-2openalex-snapshot
Generalizing cryptosystems based on the subset sum problem
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-013-9803-xopenalex-snapshot
List decoding of number field codes
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-024-01554-zopenalex-snapshot
Fault attacks on multi-prime RSA signatures
inferred← citeshttps://doi.org/10.1007/s11401-011-0680-1openalex-snapshot
Greedy algorithm computing minkowski reduced lattice bases with quadratic bit complexity of input vectors
inferred← citeshttps://doi.org/10.1007/s11432-009-0014-zopenalex-snapshot
Cryptanalysis of RSA for a special case with d >e
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/s40819-014-0023-5openalex-snapshot
An Experimental Comparison of Some LLL-Type Lattice Basis Reduction Algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.029openalex-snapshot
An efficient lattice reduction using reuse technique blockwisely on NTRU
inferred← citeshttps://doi.org/10.1016/j.ic.2005.04.004openalex-snapshot
Fast LLL-type lattice reduction
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2007.11.016openalex-snapshot
Higher-dimensional 3-adic CM construction
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.010openalex-snapshot
Modular Las Vegas algorithms for polynomial absolute factorization
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.2011.12.011openalex-snapshot
A public key cryptosystem based on three new provable problems
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/00207160.2012.716199openalex-snapshot
A complete algorithm to find exact minimal polynomial by approximations
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.1090/conm/587/11674openalex-snapshot
Some comments about Indefinite LLL
inferred← citeshttps://doi.org/10.1090/s0025-5718-2012-02545-2openalex-snapshot
Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
inferred← citeshttps://doi.org/10.1109/arith.2005.24openalex-snapshot
Gal's Accurate Tables Method Revisited
inferred← citeshttps://doi.org/10.1109/arith.2007.38openalex-snapshot
Floating-point L^2 -approximations to functions
inferred← citeshttps://doi.org/10.1109/cse.2018.00012openalex-snapshot
Exploring the Performance Envelope of the LLL Algorithm
inferred← citeshttps://doi.org/10.1109/csie.2009.890openalex-snapshot
Remarks on Cryptanalysis of RSA Using Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1109/iccsn.2017.8230188openalex-snapshot
Reducing lattice bases with Bergman exchange
inferred← citeshttps://doi.org/10.1109/ieeestd.2009.4800404openalex-snapshot
IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices
inferred← citeshttps://doi.org/10.1109/isit.2007.4557226openalex-snapshot
Effective LLL Reduction for Lattice Decoding
inferred← citeshttps://doi.org/10.1109/itw.2009.5351253openalex-snapshot
A unified view of sorting in lattice reduction: From V-BLAST to LLL and beyond
inferred← citeshttps://doi.org/10.1109/tcomm.2012.010313.120072openalex-snapshot
Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications
inferred← citeshttps://doi.org/10.1109/tifs.2019.2895545openalex-snapshot
Determining the Optimal Random-Padding Size for Rabin Cryptosystems
inferred← citeshttps://doi.org/10.1109/tsp.2019.2959194openalex-snapshot
On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
inferred← citeshttps://doi.org/10.1112/s1461157000001406openalex-snapshot
Finding Integral Linear Dependencies of Algebraic Numbers and Algebraic Lie Algebras
inferred← citeshttps://doi.org/10.1145/1073884.1073899openalex-snapshot
A BLAS based C library for exact linear algebra on integer matrices
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/1504347.1504365openalex-snapshot
Factoring univariate polynomials over the rationals
inferred← citeshttps://doi.org/10.1145/1597036.1597050openalex-snapshot
Low-dimensional lattice basis reduction revisited
inferred← citeshttps://doi.org/10.1145/1993886.1993914openalex-snapshot
Practical polynomial factoring in polynomial time
inferred← citeshttps://doi.org/10.14264/uql.2014.506openalex-snapshot
On the number field sieve: polynomial selection and smooth elements in number fields
inferred← citeshttps://doi.org/10.14288/1.0319170openalex-snapshot
A framework for approximating qubit unitaries
inferred← citeshttps://doi.org/10.1504/ijact.2008.021085openalex-snapshot
Efficient lattice-based signature scheme
inferred← citeshttps://doi.org/10.1515/jmc-2017-0040openalex-snapshot
Estimation of the hardness of the learning with errors problem with a restricted number of samples
inferred← citeshttps://doi.org/10.1515/jmc.2008.015openalex-snapshot
Identification and signatures based on NP-hard problems of indefinite quadratic forms
inferred← citeshttps://doi.org/10.1587/transfun.2021cip0021openalex-snapshot
Revisiting the Orthogonal Lattice Algorithm in Solving General Approximate Common Divisor Problem
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.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.32657/10220/47353openalex-snapshot
Group signatures with advanced features and lattices
inferred← citeshttps://doi.org/10.3390/a3030224openalex-snapshot
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
inferred← citeshttps://doi.org/10.3390/s18010283openalex-snapshot
N-Dimensional LLL Reduction Algorithm with Pivoted Reflection
inferred← citeshttps://doi.org/10.4230/dagsemproc.09221.4openalex-snapshot
Probabilistic Analysis of LLL Reduced Bases
inferred← citeshttps://doi.org/10.48550/arxiv.0906.4917openalex-snapshot
Simultaneous Integer Relation Detection and Its an Application
inferred← citeshttps://doi.org/10.48550/arxiv.0911.5024openalex-snapshot
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1006.1661openalex-snapshot
Variants of the LLL Algorithm in Digital Communications: Complexity Analysis and Fixed-Complexity Implementation
inferred← citeshttps://doi.org/10.48550/arxiv.1109.6398openalex-snapshot
On nonlinear polynomial selection for the number field sieve
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5100openalex-snapshot
A Polynomial Time Version of LLL With Deep Insertions
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.1912.04586openalex-snapshot
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
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.48550/arxiv.math/0503148openalex-snapshot
The $p$-adic CM-method for genus 2
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611414openalex-snapshot
Constructing algebraic Lie algebras
inferred← citeshttps://doi.org/10.5802/jtnb.655openalex-snapshot
Factoring polynomials over global fields
inferred← citeshttps://doi.org/10.5802/xups.2005-02openalex-snapshot
L’algorithmique de la théorie algébrique des nombres
inferred← citeshttps://doi.org/10.62056/anjbhey6bopenalex-snapshot
Implicit Factorization with Shared Any Bits
inferred← citeshttps://doi.org/10.70675/56bcc9fcz1508z4cc9zac79ze1fe4f9403a5openalex-snapshot
A journey towards practical fully homomorphic encryption
inferred← citeshttps://doi.org/10.70675/88bcb1d4z5aa0z4af1z9e3fz60f4ae5aa0a5openalex-snapshot
Tools for the Design of Reliable and Efficient Functions Evaluation Libraries
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.