scientific article; zbMATH DE number 1259076
From MaRDI portal
Publication:4231021
zbMath0995.11072MaRDI QIDQ4231021
Carl B. Pomerance, Richard E. Crandall
Publication date: 8 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
elliptic curve arithmeticprimality provingexponential factoring algorithmspast algorithms for large-integer arithmeticsubexponential factoring algorithmsubiquity of prime numbers
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization; primality (11A51) Primes (11A41) Elliptic curves over local fields (11G07) Factorization (11Y05) Primality (11Y11) Computational number theory (11Yxx)
Related Items (11)
Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ Clustering models ⋮ Strong pseudoprimes to twelve prime bases ⋮ Polynomial interpolation and identity testing from high powers over finite fields ⋮ The implementation of cubic public keys based on a new family of algebraic graphs ⋮ Unnamed Item ⋮ On the binary expansions of algebraic numbers ⋮ Two algorithms to find primes in patterns ⋮ On the security properties of Russian standardized elliptic curves ⋮ Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem ⋮ How to use CAS (Maple) to help students learn number theory
This page was built for publication:
