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

	PDF Document DocID: 17o88 - View Document
	Optimization of Primality Testing Methods by GPU Evolutionary Search Steve Worley∗ Worley Laboratories Abstract Modern fast primality testing uses a combination of Strong Probable Prime (SPRP) rejection tests. We find DocID: 15rmy - View Document
	Non-Adaptive Complex Group Testing with Multiple Positive Sets Francis Y.L. Chin, Henry C.M. Leung, S.M. Yiu Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong Abstract DocID: 14Mmy - View Document
	A Simplied Quadratic Frobenius Primality Test by Martin Seysen December 20, 2005 Giesecke & Devrient GmbH Prinzregentenstr. 159, DMunich, Germany DocID: 14DbH - View Document
	Seminar Report on Riemann hypothesis and its Impact on RSA - Chauthaiwale Atharva Shriram (2008H103422) DocID: 125Py - View Document