Thorsten Kleinjung

According to our database, Thorsten Kleinjung authored at least 42 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Computation of a 30750-bit binary field discrete logarithm.

Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel

Math. Comput., 2021

Efficient Modular Multiplication.

Joppe W. Bos, Thorsten Kleinjung, Dan Page

IACR Cryptol. ePrint Arch., 2021

2020

Revisiting ECM on GPUs.

Jonas Wloka, Jan Richter-Brockmann, Colin Stahlke, Thorsten Kleinjung, Christine Priplata, Tim Güneysu

IACR Cryptol. ePrint Arch., 2020

Improved key recovery on the Legendre PRF.

Novak Kaluderovic, Thorsten Kleinjung, Dusan Kostic

IACR Cryptol. ePrint Arch., 2020

A note on the low order assumption in class group of an imaginary quadratic number fields.

Karim Belabas, Thorsten Kleinjung, Antonio Sanso, Benjamin Wesolowski

IACR Cryptol. ePrint Arch., 2020

2019

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic.

Thorsten Kleinjung, Benjamin Wesolowski

IACR Cryptol. ePrint Arch., 2019

CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations.

Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren

IACR Cryptol. ePrint Arch., 2019

2018

A new perspective on the powers of two descent for discrete logarithms in finite fields.

Thorsten Kleinjung, Benjamin Wesolowski

IACR Cryptol. ePrint Arch., 2018

Using the Cloud to Determine Key Strengths - Triennial Update.

Marguerite Delcourt, Thorsten Kleinjung, Arjen K. Lenstra, Shubhojyoti Nath, Dan Page, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2018

Indiscreet logarithms in finite fields of small characteristic.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

Adv. Math. Commun., 2018

2017

A practical analytic method for calculating 휋(x).

Jens Franke, Thorsten Kleinjung, Jan Büthe, Alexander Jost

Math. Comput., 2017

Computation of a 768-bit prime field discrete logarithm.

Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke

IACR Cryptol. ePrint Arch., 2017

2016

Quadratic sieving.

Thorsten Kleinjung

Math. Comput., 2016

Parametrizations for Families of ECM-friendly curves.

Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra

IACR Cryptol. ePrint Arch., 2016

2015

On the discrete logarithm problem in finite fields of fixed characteristic.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2015

The Tower Number Field Sieve.

Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung

IACR Cryptol. ePrint Arch., 2015

2014

Cofactorization on Graphics Processing Units.

Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra

IACR Cryptol. ePrint Arch., 2014

Mersenne factorization factory.

Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra

IACR Cryptol. ePrint Arch., 2014

On the Powers of 2.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2014

Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽_2^4·1223 and 𝔽_2^12·367).

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2014

2013

Universal security; from bits and mips to pools, lakes - and beyond.

Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2013

2012

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction.

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

Int. J. Appl. Cryptogr., 2012

Ron was wrong, Whit is right.

Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter

IACR Cryptol. ePrint Arch., 2012

ECM at Work.

Joppe W. Bos, Thorsten Kleinjung

IACR Cryptol. ePrint Arch., 2012

Finding ECM-Friendly Curves through a Study of Galois Properties.

Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.

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

Clust. Comput., 2012

Public Keys.

Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Using the Cloud to Determine Key Strengths.

Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2011

Degree of regularity for HFE-.

Jintai Ding, Thorsten Kleinjung

IACR Cryptol. ePrint Arch., 2011

2010

Factorization of a 768-bit RSA modulus.

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

IACR Cryptol. ePrint Arch., 2010

ECC2K-130 on Cell CPUs.

Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe

IACR Cryptol. ePrint Arch., 2010

Efficient SIMD arithmetic modulo a Mersenne number.

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2010

Using a grid platform for solving large sparse linear systems over GF(2).

Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé

Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, 2010

On the Use of the Negation Map in the Pollard Rho Method.

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra

Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009

On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2009

Breaking ECC2K-130.

Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer, Luis J. Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, Bo-Yin Yang

IACR Cryptol. ePrint Arch., 2009

The Certicom Challenges ECC2-X.

Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier Van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel

IACR Cryptol. ePrint Arch., 2009

2007

A kilobit special number field sieve factorization.

Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik

IACR Cryptol. ePrint Arch., 2007

2006

On polynomial selection for the general number field sieve.

Thorsten Kleinjung

Math. Comput., 2006

2005

Hardware Factorization Based on Elliptic Curve Method.

Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens Franke, Christine Priplata, Colin Stahlke, Milos Drutarovský, Viktor Fischer

Proceedings of the 13th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2005), 2005

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

Jens Franke, Thorsten Kleinjung, Christof Paar, Jan Pelzl, Christine Priplata, Colin Stahlke

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004

Proving the Primality of Very Large Numbers with fastECPP.

Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004