PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Thomé, Emmanuel"

Author of the publication

copydeleteadd this publication to your clipboard
A heterogeneous computing environment to solve the 768-bit RSA challenge.

, , , , , , , , , , , , , and . Cluster Computing, 15 (1): 53-68 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Thomé, Emmanuel
add a person with the name Thomé, Emmanuel
 

Other publications of authors with the same name

A double large prime variation for small genus hyperelliptic index calculus., , , and . Math. Comput., 76 (257): 475-492 (2007)A modified block Lanczos algorithm with fewer vectors.. IACR Cryptology ePrint Archive, (2016)Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms., , , and . IACR Cryptology ePrint Archive, (2008)Faster Multiplication in GF(2)x., , , and . ANTS, volume 5011 of Lecture Notes in Computer Science, page 153-166. Springer, (2008)When e-th Roots Become Easier Than Factoring., , and . ASIACRYPT, volume 4833 of Lecture Notes in Computer Science, page 13-28. Springer, (2007)Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm.. J. Symb. Comput., 33 (5): 757-775 (2002)Sieving in Function Fields.. Encyclopedia of Cryptography and Security (2nd Ed.), Springer, (2011)Fast arithmetic for faster integer multiplication., and . CoRR, (2015)A kilobit hidden SNFS discrete logarithm computation., , , and . IACR Cryptology ePrint Archive, (2016)A double large prime variation for small genus hyperelliptic index calculus., , , and . IACR Cryptology ePrint Archive, (2004)