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)

First Page		Document Content
Date: 2006-04-19 03:56:50 Cryptography Integer factorization algorithms Weizmann Institute of Science Computational hardness assumptions TWINKLE TWIRL General number field sieve Integer factorization Factor base RSA World records		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) Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 570,20 KB Share Document on Facebook

	Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with: DocID: 1r2Hf - View Document
	Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 DocID: 1qjra - View Document
	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 DocID: 1q2Qr - View Document
	Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger DocID: 1pMu4 - View Document
	Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda DocID: 1mJoe - View Document