The following pages link to (Q4787198):
Displaying 36 items.
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem (Q2025379) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents (Q2170085) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic (Q2229267) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- On the greatest common divisor of shifted sets (Q2343172) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- Towards Optimal Bounds for Implicit Factorization Problem (Q2807227) (← links)
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem (Q2946396) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Задача о приближенном общем делителе и цепные дроби (Q3381824) (← links)
- Approximate common divisor problem and lattice sieving (Q3382022) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- Finding well approximating lattices for a finite set of points (Q4683170) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Approximate Polynomial gcd: Small Degree and Small Height Perturbations (Q5458535) (← links)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Deterministic factoring with oracles (Q6115442) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
