Thorsten Kleinjung

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