|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 12 keywords
|
|
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger |
A heterogeneous computing environment to solve the 768-bit RSA challenge.  |
Cluster Computing  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Enge, Pierrick Gaudry, Emmanuel Thomé |
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Thomé |
Function Field Sieve. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Thomé |
Sieving in Function Fields. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann |
Ballot stuffing in a postal voting system. |
REVOTE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann |
Factorization of a 768-bit RSA modulus. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann |
Factorization of a 768-Bit RSA Modulus. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Hanrot, François Morain, Emmanuel Thomé (eds.) |
Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings |
ANTS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé |
Using a grid platform for solving large sparse linear systems over GF(2). |
GRID |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Enge, Pierrick Gaudry, Emmanuel Thomé |
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé |
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. |
IMA Int. Conf. |
2009 |
DBLP DOI BibTeX RDF |
sdhp, ffs, nfs, dlp |
| 1 | Serge Burckel, Emeric Gioan, Emmanuel Thomé |
Mapping Computation with No Memory. |
UC |
2009 |
DBLP DOI BibTeX RDF |
mapping computation, boolean mapping, linear mapping, processor optimization, multistage interconnection network, circuit design, memory optimization, butterfly, program design, rearrangeability |
| 1 | Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé |
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Claus Diem, Emmanuel Thomé |
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three. |
J. Cryptology |
2008 |
DBLP DOI BibTeX RDF |
Index calculus, Non-hyperelliptic curves, Class groups, Jacobians |
| 1 | Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann |
Faster Multiplication in GF(2)[x]. |
ANTS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Joux, David Naccache, Emmanuel Thomé |
When e-th Roots Become Easier Than Factoring. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann |
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem |
A double large prime variation for small genus hyperelliptic index calculus. |
Math. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Joux, David Naccache, Emmanuel Thomé |
When e-th Roots Become Easier Than Factoring. |
ASIACRYPT |
2007 |
DBLP DOI BibTeX RDF |
rsa, factoring, nfs, roots |
| 1 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima |
Time-and space-efficient evaluation of some hypergeometric constants. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
high-precision evaluation, hypergeometric constants |
| 1 | Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem |
A double large prime variation for small genus hyperelliptic index calculus. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Emmanuel Thomé |
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. |
J. Symb. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Thomé |
Computation of Discrete Logarithms in F2607. |
ASIACRYPT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Thomé |
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. |
ISSAC |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")