default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Kleinjung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j7]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): 2997-3022 (2021)- 2018
- [j6]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Indiscreet logarithms in finite fields of small characteristic. Adv. Math. Commun. 12(2): 263-286 (2018) - 2017
- [j5]Jens Franke, Thorsten Kleinjung, Jan Büthe, Alexander Jost:
A practical analytic method for calculating 휋(x). Math. Comput. 86(308): 2889-2909 (2017) - 2016
- [j4]Thorsten Kleinjung:
Quadratic sieving. Math. Comput. 85(300): 1861-1873 (2016) - 2012
- [j3]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): 53-68 (2012) - [j2]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): 212-228 (2012) - 2006
- [j1]Thorsten Kleinjung:
On polynomial selection for the general number field sieve. Math. Comput. 75(256): 2037-2047 (2006)
Conference and Workshop Papers
- 2020
- [c21]Jonas Wloka, Jan Richter-Brockmann, Colin Stahlke, Thorsten Kleinjung, Christine Priplata, Tim Güneysu:
Revisiting ECM on GPUs. CANS 2020: 299-319 - 2019
- [c20]Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren:
CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations. ASIACRYPT (1) 2019: 227-247 - 2017
- [c19]Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke:
Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) 2017: 185-201 - [c18]Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra:
Parametrizations for Families of ECM-Friendly Curves. ISSAC 2017: 165-171 - 2015
- [c17]Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung:
The Tower Number Field Sieve. ASIACRYPT (2) 2015: 31-55 - 2014
- [c16]Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra:
Mersenne Factorization Factory. ASIACRYPT (1) 2014: 358-377 - [c15]Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra:
Cofactorization on Graphics Processing Units. CHES 2014: 335-352 - [c14]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367). CRYPTO (2) 2014: 126-145 - 2013
- [c13]Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé:
Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography 2013: 121-124 - 2012
- [c12]Joppe W. Bos, Thorsten Kleinjung:
ECM at Work. ASIACRYPT 2012: 467-484 - [c11]Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter:
Public Keys. CRYPTO 2012: 626-642 - [c10]Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart:
Using the Cloud to Determine Key Strengths. INDOCRYPT 2012: 17-39 - 2011
- [c9]Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery:
Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic 2011: 213-221 - 2010
- [c8]Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe:
ECC2K-130 on Cell CPUs. AFRICACRYPT 2010: 225-242 - [c7]Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra:
On the Use of the Negation Map in the Pollard Rho Method. ANTS 2010: 66-82 - [c6]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: 333-350 - [c5]Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé:
Using a grid platform for solving large sparse linear systems over GF(2). GRID 2010: 161-168 - 2007
- [c4]Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik:
A Kilobit Special Number Field Sieve Factorization. ASIACRYPT 2007: 1-12 - 2005
- [c3]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: 119-130 - [c2]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: 107-116 - 2004
- [c1]Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth:
Proving the Primality of Very Large Numbers with fastECPP. ANTS 2004: 194-207
Informal and Other Publications
- 2021
- [i33]Joppe W. Bos, Thorsten Kleinjung, Dan Page:
Efficient Modular Multiplication. IACR Cryptol. ePrint Arch. 2021: 1151 (2021) - 2020
- [i32]Novak Kaluderovic, Thorsten Kleinjung, Dusan Kostic:
Improved key recovery on the Legendre PRF. IACR Cryptol. ePrint Arch. 2020: 98 (2020) - [i31]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: 965 (2020) - [i30]Jonas Wloka, Jan Richter-Brockmann, Colin Stahlke, Thorsten Kleinjung, Christine Priplata, Tim Güneysu:
Revisiting ECM on GPUs. IACR Cryptol. ePrint Arch. 2020: 1265 (2020) - [i29]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: 1310 (2020) - 2019
- [i28]Thorsten Kleinjung, Benjamin Wesolowski:
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. CoRR abs/1906.10668 (2019) - [i27]Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren:
CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations. IACR Cryptol. ePrint Arch. 2019: 498 (2019) - [i26]Thorsten Kleinjung, Benjamin Wesolowski:
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2019: 751 (2019) - 2018
- [i25]Thorsten Kleinjung, Benjamin Wesolowski:
A new perspective on the powers of two descent for discrete logarithms in finite fields. IACR Cryptol. ePrint Arch. 2018: 647 (2018) - [i24]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: 1221 (2018) - 2017
- [i23]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: 67 (2017) - 2016
- [i22]Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra:
Parametrizations for Families of ECM-friendly curves. IACR Cryptol. ePrint Arch. 2016: 1092 (2016) - 2015
- [i21]Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung:
The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. 2015: 505 (2015) - [i20]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the discrete logarithm problem in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2015: 685 (2015) - 2014
- [i19]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). CoRR abs/1402.3668 (2014) - [i18]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). IACR Cryptol. ePrint Arch. 2014: 119 (2014) - [i17]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the Powers of 2. IACR Cryptol. ePrint Arch. 2014: 300 (2014) - [i16]Andrea Miele, Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra:
Cofactorization on Graphics Processing Units. IACR Cryptol. ePrint Arch. 2014: 397 (2014) - [i15]Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra:
Mersenne factorization factory. IACR Cryptol. ePrint Arch. 2014: 653 (2014) - 2013
- [i14]Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé:
Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. 2013: 635 (2013) - 2012
- [i13]Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery:
Finding ECM-Friendly Curves through a Study of Galois Properties. CoRR abs/1202.4285 (2012) - [i12]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: 64 (2012) - [i11]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: 70 (2012) - [i10]Joppe W. Bos, Thorsten Kleinjung:
ECM at Work. IACR Cryptol. ePrint Arch. 2012: 89 (2012) - 2011
- [i9]Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart:
Using the Cloud to Determine Key Strengths. IACR Cryptol. ePrint Arch. 2011: 254 (2011) - [i8]Jintai Ding, Thorsten Kleinjung:
Degree of regularity for HFE-. IACR Cryptol. ePrint Arch. 2011: 570 (2011) - 2010
- [i7]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: 6 (2010) - [i6]Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe:
ECC2K-130 on Cell CPUs. IACR Cryptol. ePrint Arch. 2010: 77 (2010) - [i5]Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery:
Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. 2010: 338 (2010) - 2009
- [i4]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: 389 (2009) - [i3]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: 466 (2009) - [i2]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: 541 (2009) - 2007
- [i1]Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik:
A kilobit special number field sieve factorization. IACR Cryptol. ePrint Arch. 2007: 205 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
