On Generalized Carmichael Numbers (2000)

Cached

Download Links

by Lorenz Halbeisen , Norbert Hungerbühler
Citations:2 - 2 self

Active Bibliography

Breaking a Cryptographic Protocol with – Daniel Bleichenbacher
unknown title – unknown authors - 711
unknown title – unknown authors - 711
2 Building Pseudoprimes With A Large Number Of Prime Factors – D. Guillaume, F. Morain - 1995
ON THE NUMBER OF PRIME DIVISORS OF – Oleg Eterevsky, Maxim Vsemirnov - 2001
Carmichael numbers and pseudoprimes Notes by G.J.O. Jameson – unknown authors
Notes by G.J.O. Jameson – unknown authors
GENERATING M-STRONG FIBONACCI PSEUDOPRIMES Adina Di Porto and – unknown authors - 1991
ON THE GENERALIZED FIBONACCI PSEUDOPRIMES – Emilio Montolivo, Fondazione Ugo Bordoni - 1988
Improved Bounds for Goldback Conjecture – Yannick Saouter
unknown title – unknown authors
unknown title – unknown authors
3 Some Primality Testing Algorithms – R.G.E. Pinch - 1993
Computations on Normal Families of Primes – Erick Wong - 1997
6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
18 The Carmichael Numbers up to 10^15 – R.G.E. Pinch - 1992
6 A survey of results relating to Giuga's conjecture on primality – Jonathan M. Borwein, Erick Wong - 1995
12 It Is Easy to Determine Whether a Given Integer Is Prime – Andrew Granville - 2004
2 On using Carmichael numbers for public key encryption systems – R.G.E. Pinch - 1997