Miller test - Document - PDFSEARCH.IO - Document Search Engine

First Page		Document Content
Date: 2007-08-07 12:51:16 Integer sequences Modular arithmetic Quadratic residue Integers Repunit Miller–Rabin primality test Prime number Mersenne prime Primality test Mathematics Abstract algebra Number theory		Add to Reading List Source URL: www.maths.tcd.ie Download Document from Source Website File Size: 181,51 KB Share Document on Facebook

	Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers Thorsten Kleinjung University of Bonn, Department of Mathematics, Beringstraße 1, DBonn, DocID: 1xUNM - View Document
	SHARK A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers Jens Franke1 , Thorsten Kleinjung1 , Christof Paar2 , Jan Pelzl2 , Christine Priplata3 , Colin Stahlke3 1 DocID: 1xUHC - View Document
	An Evaluation of the Sieving Device YASD for 1024-bit Integers* SHARCS 2006, Cologne, Germany April 4, 2006 Naoyuki Hirota (UEC), ○Tetsuya Izu (FUJITSU), Noboru Kunihiro (UEC), Kazuo Ohta (UEC) DocID: 1xUG6 - View Document
	A polynomial time algorithm for computing the HNF of a module over the integers of a number field Jean-François Biasse Claus Fieker DocID: 1xU1I - View Document
	An Evaluation of the Sieving Device YASD for 1024-bit Integers ? (Extended Abstract) Naoyuki Hirota1 , Tetsuya Izu2 , Noboru Kunihiro1 and Kazuo Ohta1 1 DocID: 1xTTr - View Document