scientific article

zbMath0707.11001MaRDI QIDQ3995106

David M. Bressoud

Publication date: 17 September 1992

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

zbMATH Keywords

elliptic curvesEuclidean algorithmcomputational number theoryprimality testingFactorizationsieve of EratosthenesFermat's algorithmundergraduate textRSA public key cryptosystemsContinued Fraction factorization algorithmPollard \(\rho \)Pollard p-1Quadratic Sieve

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Primes (11A41) Factorization (11Y05) Primality (11Y11) Elementary number theory (11Axx)

Related Items (15)

A one-way function from thermodynamics and applications to cryptography ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Ternary arithmetic, factorization, and the class number one problem ⋮ Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\). ⋮ Change-of-bases abstractions for non-linear hybrid systems ⋮ Circle map, Fermat's little theorem, primes and pseudoprimes. ⋮ Factoring Integers with Large-Prime Variations of the Quadratic Sieve ⋮ The density of primes \(P\), such that \(-1\) is a residue modulo \(P\) of two consecutive Fibonacci numbers, is \(2/3\) ⋮ Generating all polynomial invariants in simple loops ⋮ Elimination Techniques for Program Analysis ⋮ A new public key cryptosystem based on Edwards curves ⋮ \(\pi\)-formulas and Gray code ⋮ Primitive Polynomials Over Finite Fields ⋮ Unnamed Item ⋮ A one-parameter quadratic-base version of the Baillie-PSW probable prime test

Uses Software

• REXX

This page was built for publication: