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

	Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows. Given a prime p ≡ DocID: 1s8Dx - View Document
	Double Circulant Quadratic Residue Codes ∗ Tor Helleseth † DocID: 1rXXC - View Document
	ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over DocID: 1roCB - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of DocID: 1rfno - View Document