Fast practical lattice reduction through iterated compression (Q6145939)

scientific article; zbMATH DE number 7799250

Language	Label	Description	Also known as
English	Fast practical lattice reduction through iterated compression	scientific article; zbMATH DE number 7799250

Statements

instance of

scholarly article

0 references

title

Fast practical lattice reduction through iterated compression (English)

0 references

DOI

10.1007/978-3-031-38548-3_1

0 references

0 references

0 references

Advances in Cryptology – CRYPTO 2023

0 references

publication date

2 February 2024

0 references

Mathematics Subject Classification ID

0 references

0 references

lattice basis reduction algorithm

0 references

precision management techniques

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-38548-3_1

0 references

OpenAlex ID

W4385654471

0 references

cites work

Lattice Attacks on NTRU and LWE: A History of Refinements

0 references

Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild

0 references

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

0 references

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

0 references

Subexponential time relations in the class group of large degree number fields

0 references

Subexponential class group and unit group computation in large degree number fields

0 references

Q4474164

0 references

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction

0 references

BKZ 2.0: Better Lattice Security Estimates

0 references

Batch Fully Homomorphic Encryption over the Integers

0 references

Approximate common divisors via lattices

0 references

Small solutions to polynomial equations, and low exponent RSA vulnerabilities

0 references

Q4787196

0 references

Practical Multilinear Maps over the Integers

0 references

Scale-Invariant Fully Homomorphic Encryption over the Integers

0 references

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

0 references

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

0 references

NTRU Fatigue: How Stretched is Overstretched?

0 references

Algorithms for the approximate common divisor problem

0 references

Fully homomorphic encryption using ideal lattices

0 references

Implementing Gentry’s Fully-Homomorphic Encryption Scheme

0 references

On the equidistribution of Hecke points

0 references

Accuracy and Stability of Numerical Algorithms

0 references

Q4400575

0 references

Q4787198

0 references

Fast reduction of algebraic lattices over cyclotomic fields

0 references

Towards faster polynomial-time lattice reduction

0 references

Revisiting Lattice Attacks on Overstretched NTRU Parameters

0 references

Q4787200

0 references

Factoring polynomials with rational coefficients

0 references

Using LLL-Reduction for Solving RSA and Factorization Problems

0 references

Lattice-based Cryptography

0 references

H-LLL

0 references

Faster LLL-type Reduction of Lattice Bases

0 references

Q4736443

0 references

Hermite’s Constant and Lattice Algorithms

0 references

Algorithmic Number Theory

0 references

An LLL Algorithm with Quadratic Complexity

0 references

An LLL-reduction algorithm with quasi-linear time complexity

0 references

LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme

0 references

LLL reducing with the most significant bits

0 references

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

0 references

Q4237380

0 references

Q3998482

0 references

Fully Homomorphic Encryption over the Integers

0 references

Cryptanalysis of elliptic curve hidden number problem from PKC 2017

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6145939