scientific article; zbMATH DE number 1142300
From MaRDI portal
Publication:4385516
zbMath0900.68250MaRDI QIDQ4385516
Arjen K. Lenstra, Hendrik W. jun. Lenstra
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Algorithms in Algebraic Number Theory ⋮ An efficient approach for secure multi-party computation without authenticated channel ⋮ A strategy for elliptic curve primality proving ⋮ Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences ⋮ Inversion of circulant matrices over $\mathbf{Z}_m$ ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ The Factorization of the Ninth Fermat Number ⋮ Elliptic Curves and Primality Proving ⋮ Elliptic periods and primality proving ⋮ An efficient threshold RSA digital signature scheme ⋮ On the ultimate complexity of factorials ⋮ A fast, rigorous technique for computing the regulator of a real quadratic field ⋮ The complexity of class polynomial computation via floating point approximations ⋮ A Rigorous Time Bound for Factoring Integers ⋮ One-way permutations on elliptic curves ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Factoring with Two Large Primes ⋮ A Rigorous Subexponential Algorithm For Computation of Class Groups ⋮ Quadratic class numbers and character sums ⋮ Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects ⋮ Exploiting functional dependencies in declarative problem specifications ⋮ From decomposable to residual theories ⋮ Proving primality in essentially quartic random time ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm ⋮ Short vectors of planar lattices via continued fractions
