J. Cryptology[removed]:[removed]Journal of Cryptology[removed]International Association for Cryptologic Research

First Page		Document Content
Date: 2010-11-16 14:00:41 Modular arithmetic Primality tests Euclidean algorithm Prime number Quadratic residue Randomized algorithm Factorization of polynomials over a finite field and irreducibility tests Miller–Rabin primality test Mathematics Number theory Abstract algebra		J. Cryptology[removed]:[removed]Journal of Cryptology[removed]International Association for Cryptologic Research Add to Reading List Source URL: www.math.dartmouth.edu Download Document from Source Website File Size: 660,18 KB Share Document on Facebook

	02157 Functional Programming - Sequences DocID: 1rsIU - View Document
	Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands) DocID: 1r1GB - View Document
	Algorithmic Number Theory MSRI Publications Volume 44, 2008 Four primality testing algorithms RENE´ SCHOOF DocID: 1qY4T - View Document
	DIMACS Technical ReportJuly 1995 A Formal Framework for Evaluating Heuristic Programs 1 by DocID: 1qhCO - View Document
	The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://www DocID: 1q9Fs - View Document