Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2022.02.005 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the expected cost of solving uSVP and applications to LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concrete hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in nearest neighbor searching with applications to lattice sieving / rank
 
Normal rank
Property / cites work
 
Property / cites work: FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: BKZ 2.0: Better Lattice Security Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomophic Encryption over the Integers Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate common divisors via lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Multilinear Maps over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Multilinear Maps Over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-Invariant Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers with Shorter Public Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Factoring with Shared Most Significant and Middle Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the approximate common divisor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LLL algorithm. Survey and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LLL-reduction algorithm with quasi-linear time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Integer Common Divisor Problem Relates to Implicit Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: LLL reducing with the most significant bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.02.005 / rank
 
Normal rank

Latest revision as of 04:09, 17 December 2024

scientific article
Language Label Description Also known as
English
Revisiting orthogonal lattice attacks on approximate common divisor problems
scientific article

    Statements

    Revisiting orthogonal lattice attacks on approximate common divisor problems (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    approximate common divisor problem
    0 references
    lattice
    0 references
    orthogonal lattice attack
    0 references
    lattice reduction algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers