scientific article; zbMATH DE number 2206373

Carl B. Pomerance, Richard E. Crandall

Publication date: 20 September 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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 (only showing first 100 items - show all)

Statistics of Primes (and Probably Twin Primes) Satisfy Taylor's Law from Ecology ⋮ The twenty-fourth Fermat number is composite ⋮ A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ Sharpening ``Primes is in P for a large family of numbers ⋮ A hidden number problem in small subgroups ⋮ DENSITY AND DISTRIBUTION OF PRIMES ⋮ On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits ⋮ It is easy to determine whether a given integer is prime ⋮ Generalised Mersenne numbers revisited ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ On a modification of the Lucas primality test ⋮ Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test? ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Deterministic factoring with oracles ⋮ An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ On a combined primality test ⋮ Unnamed Item ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ Balanced non-adjacent forms ⋮ On the key generation in $\mathbf{SQISign}$ ⋮ Fermat's method of factorisation ⋮ A Prime-Representing Constant ⋮ ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES ⋮ Unnamed Item ⋮ Bitcoin Crypto–Bounties for Quantum Capable Adversaries ⋮ ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE ⋮ Series representation of the Riemann zeta function and other results: Complements to a paper of Crandall ⋮ Notes on some new kinds of pseudoprimes ⋮ On multiple base discrete logarithm problem in $\mathbb {G}_m^{n}$ and $E_d^{n}$ ⋮ Finding the group structure of elliptic curves over finite fields ⋮ Finding 𝐶₃-strong pseudoprimes ⋮ Accelerating the CM method ⋮ Improved Primality Proving with Eisenstein Pseudocubes ⋮ The Lucas-Pratt primality tree ⋮ Divisors in residue classes, constructively ⋮ The continuing search for Wieferich primes ⋮ 64-bit and 128-bit DX random number generators ⋮ An exponent one-fifth algorithm for deterministic integer factorisation ⋮ Unnamed Item ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus ⋮ Lower Bound for the Least Common Multiple ⋮ Unnamed Item ⋮ Quadratic Frobenius pseudoprimes with respect to $x^{2}+5x+5$ ⋮ Strengthening the Baillie-PSW primality test ⋮ Estimating the counts of Carmichael and Williams numbers with small multiple seeds ⋮ A primality test for 𝐾𝑝ⁿ+1 numbers ⋮ Classical and Quantum Algorithms for Exponential Congruences ⋮ Deterministic factorization of sums and differences of powers ⋮ On invariable generation of alternating groups by elements of prime and prime power order ⋮ On Group Structures Realized by Elliptic Curves over a Fixed Finite Field ⋮ The least inert prime in a real quadratic field ⋮ Generating random factored Gaussian integers, easily ⋮ Compositeness test with nodal curves ⋮ Even faster integer multiplication ⋮ On the number of strong primes ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ Pseudoprimality related to the generalized Lucas sequences ⋮ Few Product Gates But Many Zeros ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ The reciprocal sum of primitive nondeficient numbers ⋮ Fonctions arithmétiques et formes binaires irréductibles de degré 3 ⋮ Computational Number Theory and Cryptography ⋮ A survey on delegated computation ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Tight upper and lower bounds for the reciprocal sum of Proth primes ⋮ A Superpowered Euclidean Prime Generator ⋮ If the Primes are Finite, Then All of Them Divide the Number One ⋮ Prime chains and Pratt trees ⋮ Looking for Fibonacci base-2 pseudoprimes ⋮ On Williams numbers with three prime factors ⋮ Mechanisation of AKS Algorithm: Part 1 – The Main Theorem ⋮ Computing Dirichlet character sums to a power-full modulus ⋮ Squarefree smooth numbers and Euclidean prime generators ⋮ Running Time Predictions for Factoring Algorithms ⋮ Functional graphs of polynomials over finite fields ⋮ Algorithms for the Multiplication Table Problem ⋮ The least modulus for which consecutive polynomial values are distinct ⋮ Binomial coefficients, Catalan numbers and Lucas quotients ⋮ The distribution of the number of points modulo an integer on elliptic curves over finite fields ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting) ⋮ On sharp transitions in making squares ⋮ On oracle factoring of integers ⋮ Modulated string searching ⋮ On practical aspects of the Miller-Rabin primality test ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ On functions taking only prime values ⋮ On some new arithmetic properties of the generalized Lucas sequences ⋮ Towards a generic view of primality through multiset decompositions of natural numbers ⋮ Proof of three conjectures on congruences ⋮ Deterministic primality tests based on tori and elliptic curves ⋮ Improved Bounds on Brun’s Constant ⋮ Codes correcting restricted errors ⋮ Unnamed Item ⋮ On the complexity of matrix reduction over finite fields ⋮ Pi on earth, or mathematics in the real world ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ Calculation of Bezout coefficients for a $k$-ary GCD algorithm

This page was built for publication: