Publication:4787198
From MaRDI portal
zbMath1006.94528MaRDI QIDQ4787198
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460051
94A60: Cryptography
11J70: Continued fractions and generalizations
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Related Items
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, Deterministic factoring with oracles, 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, Approximate GCD of several univariate polynomials with small degree perturbations, Approximate polynomial GCD over integers, A new scale-invariant homomorphic encryption scheme, Approximate polynomial GCD: small degree and small height perturbations, 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, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, 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 lattice sieving, Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
