History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 | next | last

Result 1 to 8 of 8 total

Number field sieve for factoring (English)
Encyclopedia of Cryptography and Security (2nd Ed.), 862-867 (2011).
1
Factorization of a 768-bit RSA modulus. (English)
Rabin, Tal (ed.), Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14622-0/pbk). Lecture Notes in Computer Science 6223, 333-350 (2010).
2
Factorization of a 768-bit RSA modulus (English)
IACR Cryptology ePrint Archive 2010, 6 (2010).
3
Factorization of a 768-bit RSA modulus (English)
CRYPTO, 333-350 (2010).
4
Improved stage 2 to P $\pm 1$ factoring algorithms. (English)
van der Poorten, Alfred J. (ed.) et al., Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17‒22, 2008 Proceedings. Berlin: Springer (ISBN 978-3-540-79455-4/pbk). Lecture Notes in Computer Science 5011, 180-195 (2008).
5
Improved stage 2 to P$\pm 1$ factoring algorithms (English)
ANTS, 180-195 (2008).
6
A GMP-based implementation of Schönhage-Strassen’s large integer multiplication algorithm. (English)
Brown, C. W. (ed.), ISSAC 2007. Proceedings of the 32nd international symposium on symbolic and algebraic computation (ISSAC 2007), Waterloo, ON, Canada, July 29‒August 1, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-743-8). 167-174 (2007).
7
A GMP-based implementation of schönhage-strassen’s large integer multiplication algorithm (English)
ISSAC, 167-174 (2007).
8
first | previous | 1 | next | last

Result 1 to 8 of 8 total