Thorsten Kleinjung

Publication Activity (10 Years)

Years Active: 2004-2021
Publications (10 Years): 20

Top Topics

Ridgelet Transform

Binary Representation

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Joppe W. Bos, Thorsten Kleinjung, Dan Page
Efficient Modular Multiplication. IACR Cryptol. ePrint Arch. 2021 (2021)
Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90 (332) (2021)
Jonas Wloka, Jan Richter-Brockmann, Colin Stahlke, Thorsten Kleinjung, Christine Priplata, Tim Güneysu
Revisiting ECM on GPUs. IACR Cryptol. ePrint Arch. 2020 (2020)
Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel
Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. 2020 (2020)
Karim Belabas, Thorsten Kleinjung, Antonio Sanso, Benjamin Wesolowski
A note on the low order assumption in class group of an imaginary quadratic number fields. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonas Wloka, Jan Richter-Brockmann, Colin Stahlke, Thorsten Kleinjung, Christine Priplata, Tim Güneysu
Revisiting ECM on GPUs. CANS (2020)
Novak Kaluderovic, Thorsten Kleinjung, Dusan Kostic
Improved key recovery on the Legendre PRF. IACR Cryptol. ePrint Arch. 2020 (2020)
Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren
CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations. ASIACRYPT (1) (2019)
Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren
CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations. IACR Cryptol. ePrint Arch. 2019 (2019)
Thorsten Kleinjung, Benjamin Wesolowski
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2019 (2019)
Thorsten Kleinjung, Benjamin Wesolowski
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. CoRR (2019)
Thorsten Kleinjung, Benjamin Wesolowski
A new perspective on the powers of two descent for discrete logarithms in finite fields. IACR Cryptol. ePrint Arch. 2018 (2018)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
Indiscreet logarithms in finite fields of small characteristic. Adv. Math. Commun. 12 (2) (2018)
Marguerite Delcourt, Thorsten Kleinjung, Arjen K. Lenstra, Shubhojyoti Nath, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths - Triennial Update. IACR Cryptol. ePrint Arch. 2018 (2018)
Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) (2017)
Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke
Computation of a 768-bit prime field discrete logarithm. IACR Cryptol. ePrint Arch. 2017 (2017)
Jens Franke, Thorsten Kleinjung, Jan Büthe, Alexander Jost
A practical analytic method for calculating 휋(x). Math. Comput. 86 (308) (2017)
Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Parametrizations for Families of ECM-Friendly Curves. ISSAC (2017)
Thorsten Kleinjung
Quadratic sieving. Math. Comput. 85 (300) (2016)
Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra
Parametrizations for Families of ECM-friendly curves. IACR Cryptol. ePrint Arch. 2016 (2016)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. 2015 (2015)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
On the discrete logarithm problem in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2015 (2015)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. ASIACRYPT (2) (2015)
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
Mersenne Factorization Factory. ASIACRYPT (1) (2014)
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra
Mersenne factorization factory. IACR Cryptol. ePrint Arch. 2014 (2014)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
). IACR Cryptol. ePrint Arch. 2014 (2014)
Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
Cofactorization on Graphics Processing Units. CHES (2014)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
). CoRR (2014)
Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
Cofactorization on Graphics Processing Units. IACR Cryptol. ePrint Arch. 2014 (2014)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
). CRYPTO (2) (2014)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
On the Powers of 2. IACR Cryptol. ePrint Arch. 2014 (2014)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. 2013 (2013)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography (2013)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties CoRR (2012)
Joppe W. Bos, Thorsten Kleinjung
ECM at Work. IACR Cryptol. ePrint Arch. 2012 (2012)
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Cryptogr. 2 (3) (2012)
Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
Public Keys. CRYPTO (2012)
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths. INDOCRYPT (2012)
Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter
Ron was wrong, Whit is right. IACR Cryptol. ePrint Arch. 2012 (2012)
Joppe W. Bos, Thorsten Kleinjung
ECM at Work. ASIACRYPT (2012)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties. IACR Cryptol. ePrint Arch. 2012 (2012)
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. Clust. Comput. 15 (1) (2012)
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart
Using the Cloud to Determine Key Strengths. IACR Cryptol. ePrint Arch. 2011 (2011)
Jintai Ding, Thorsten Kleinjung
Degree of regularity for HFE-. IACR Cryptol. ePrint Arch. 2011 (2011)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic (2011)
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe
ECC2K-130 on Cell CPUs. IACR Cryptol. ePrint Arch. 2010 (2010)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. 2010 (2010)
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 Cryptol. ePrint Arch. 2010 (2010)
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe
ECC2K-130 on Cell CPUs. AFRICACRYPT (2010)
Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé
Using a grid platform for solving large sparse linear systems over GF(2). GRID (2010)
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)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
On the Use of the Negation Map in the Pollard Rho Method. ANTS (2010)
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
The Certicom Challenges ECC2-X. IACR Cryptol. ePrint Arch. 2009 (2009)
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
Breaking ECC2K-130. IACR Cryptol. ePrint Arch. 2009 (2009)
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. 2009 (2009)
Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
A Kilobit Special Number Field Sieve Factorization. ASIACRYPT (2007)
Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik
A kilobit special number field sieve factorization. IACR Cryptol. ePrint Arch. 2007 (2007)
Thorsten Kleinjung
On polynomial selection for the general number field sieve. Math. Comput. 75 (256) (2006)
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens Franke, Christine Priplata, Colin Stahlke, Milos Drutarovský, Viktor Fischer
Hardware Factorization Based on Elliptic Curve Method. FCCM (2005)
Jens Franke, Thorsten Kleinjung, Christof Paar, Jan Pelzl, Christine Priplata, Colin Stahlke
SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers. CHES (2005)
Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth
Proving the Primality of Very Large Numbers with fastECPP. ANTS (2004)