Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers.

J. Franke, T. Kleinjung, C. Paar, J. Pelzl, C. Priplata, and C. Stahlke. CHES, volume 3659 of Lecture Notes in Computer Science, page 119-130. Springer, (2005)

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.

Thorsten Pape University of Stuttgart

Thorsten Herrmann

Thorsten Bieser University of Stuttgart

Thorsten Markert University of Stuttgart

Dr. phil. Thorsten Braun University of Stuttgart

Other publications of authors with the same name

Quadratic sieving.T. Kleinjung. Math. Comput., (2016)A new perspective on the powers of two descent for discrete logarithms in finite fields.T. Kleinjung, and B. Wesolowski. IACR Cryptology ePrint Archive, (2018)Finding ECM-Friendly Curves through a Study of Galois Properties.R. Barbulescu, J. Bos, C. Bouvier, T. Kleinjung, and P. Montgomery. IACR Cryptology ePrint Archive, (2012)Parametrizations for Families of ECM-friendly curves.A. Gélin, T. Kleinjung, and A. Lenstra. IACR Cryptology ePrint Archive, (2016)Public Keys.A. Lenstra, J. Hughes, M. Augier, J. Bos, T. Kleinjung, and C. Wachter. CRYPTO, volume 7417 of Lecture Notes in Computer Science, page 626-642. Springer, (2012)A heterogeneous computing environment to solve the 768-bit RSA challenge.T. Kleinjung, J. Bos, A. Lenstra, D. Osvik, K. Aoki, S. Contini, J. Franke, E. Thomé, P. Jermini, M. Thiémard and 4 other author(s). Cluster Computing, 15 (1): 53-68 (2012)Hardware Factorization Based on Elliptic Curve Method.M. Simka, J. Pelzl, T. Kleinjung, J. Franke, C. Priplata, C. Stahlke, M. Drutarovský, and V. Fischer. FCCM, page 107-116. IEEE Computer Society, (2005)Degree of regularity for HFE-.J. Ding, and T. Kleinjung. IACR Cryptology ePrint Archive, (2011)Proving the Primality of Very Large Numbers with fastECPP.J. Franke, T. Kleinjung, F. Morain, and T. Wirth. ANTS, volume 3076 of Lecture Notes in Computer Science, page 194-207. Springer, (2004)On the Use of the Negation Map in the Pollard Rho Method.J. Bos, T. Kleinjung, and A. Lenstra. ANTS, volume 6197 of Lecture Notes in Computer Science, page 66-82. Springer, (2010)