Approximate integer common divisors
From MaRDI portal
Recommendations
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Approximate common divisors via lattices
- Approximate common divisor problem and continued fractions
- Algorithms for the approximate common divisor problem
- Approximate common divisor problem and lattice sieving
- On the common divisor of discriminants of integers
- Sums Involving Common Divisors
- Integers with a given number of divisors
- Integers with dense divisors
- Divisors of Integers in Arithmetic Progression
Cited in
(49)- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- On the optimality of lattices for the Coppersmith technique
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Algorithms for CRT-variant of approximate greatest common divisor problem
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- TFHE: fast fully homomorphic encryption over the torus
- On the greatest common divisor of shifted sets
- Cryptanalysis of the CLT13 multilinear map
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Towards optimal bounds for implicit factorization problem
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Approximate common divisors via lattices
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Cryptanalysis of a homomorphic encryption scheme over integers
- Approximate common divisor problem and continued fractions
- Approximate common divisor problem and lattice sieving
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Approximate GCD of several univariate polynomials with small degree perturbations
- Finding well approximating lattices for a finite set of points
- The Complexity of Public-Key Cryptography
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Using LLL-reduction for solving RSA and factorization problems
- Approximate Polynomial gcd: Small Degree and Small Height Perturbations
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Minicrypt primitives with algebraic structure and applications
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- Deterministic factoring with oracles
- Homomorphic encryption: a mathematical survey
- Fast practical lattice reduction through iterated compression
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Approximate polynomial GCD over integers
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
- Solving modular linear equations via automated Coppersmith and its applications
- About LLL reduction algorithms when solving the HNP problem and their comparative analysis
- Survey: recovering cryptographic keys from partial information, by example
- On the dangers of RSA exponent transforms
- A new scale-invariant homomorphic encryption scheme
- Approximate polynomial GCD: small degree and small height perturbations
This page was built for publication: Approximate integer common divisors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787198)
