Carl Pomerance

Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski: On the asymptotic effectiveness of Weil descent attacks. J. Mathematical Cryptology 4(2): 175-191 (2010)

Mariana Levin, Carl Pomerance, K. Soundararajan: Fixed Points for Discrete Logarithms. ANTS 2010: 6-15

Juan A. Garay, Carl Pomerance: Timed Fair Exchange of Standard Signatures: [Extended Abstract]. Financial Cryptography 2003: 190-207

Juan A. Garay, Carl Pomerance: Timed Fair Exchange of Standard Signatures. IACR Cryptology ePrint Archive 2003: 42 (2003)

Andrew Granville, Carl Pomerance: Two contradictory conjectures concerning Carmichael numbers. Math. Comput. 71(238): 883-908 (2002)

Carl Pomerance: The expected number of random elements to generate a finite abelian group. Periodica Mathematica Hungarica 43(1-2): 191-198 (2002)

Carl Pomerance, Igor Shparlinski: Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348

John Friedlander, Carl Pomerance, Igor Shparlinski: Period of the power generator and small values of Carmichael's function. Math. Comput. 70(236): 1591-1605 (2001)

Richard E. Crandall, Karl Dilcher, Carl Pomerance: A search for Wieferich and Wilson primes. Math. Comput. 66(217): 433-449 (1997)

Carl Pomerance, John Michael Robson, Jeffrey Shallit: Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997)

Carl Pomerance, Jonathan P. Sorenson: Counting the Integers Factorable via Cyclotomic Methods. J. Algorithms 19(2): 250-265 (1995)

W. R. Alford, Andrew Granville, Carl Pomerance: On the difficulty of finding reliable witnesses. ANTS 1994: 1-16

Pierre Beauchemin, Gilles Brassard, Claude Crépeau, Claude Goutier, Carl Pomerance: The Generation of Random Numbers that Are Probably Prime. J. Cryptology 1(1): 53-64 (1988)

Carl Pomerance, Jeffrey W. Smith, Randy Tuler: A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm. SIAM J. Comput. 17(2): 387-403 (1988)

Carl Pomerance (Ed.): Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. Lecture Notes in Computer Science 293, Springer 1988, isbn 3-540-18796-0

Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour: The smallets n-uniform hypergraph with positive discrepancy. Combinatorica 7(2): 151-160 (1987)

Carl Pomerance: The Quadratic Sieve Factoring Algorithm. EUROCRYPT 1984: 169-182

Carl Pomerance, Jeffrey W. Smith, Samuel S. Wagstaff Jr.: New Ideas for Factoring Large Integers. CRYPTO 1983: 81-85

Carl Pomerance: Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi's Theorem. J. Comb. Theory, Ser. A 28(2): 140-149 (1980)