Thorsten Kleinjung

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Computation of a 30750-bit binary field discrete logarithm.
Math. Comput., 2021

Efficient Modular Multiplication.
IACR Cryptol. ePrint Arch., 2021

2020
Revisiting ECM on GPUs.
IACR Cryptol. ePrint Arch., 2020

Improved key recovery on the Legendre PRF.
IACR Cryptol. ePrint Arch., 2020

A note on the low order assumption in class group of an imaginary quadratic number fields.
IACR Cryptol. ePrint Arch., 2020

2019
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic.
IACR Cryptol. ePrint Arch., 2019

CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations.
IACR Cryptol. ePrint Arch., 2019

2018
A new perspective on the powers of two descent for discrete logarithms in finite fields.
IACR Cryptol. ePrint Arch., 2018

Using the Cloud to Determine Key Strengths - Triennial Update.
IACR Cryptol. ePrint Arch., 2018

Indiscreet logarithms in finite fields of small characteristic.
Adv. Math. Commun., 2018

2017
A practical analytic method for calculating 휋(x).
Math. Comput., 2017

Computation of a 768-bit prime field discrete logarithm.
IACR Cryptol. ePrint Arch., 2017

2016
Quadratic sieving.
Math. Comput., 2016

Parametrizations for Families of ECM-friendly curves.
IACR Cryptol. ePrint Arch., 2016

2015
On the discrete logarithm problem in finite fields of fixed characteristic.
IACR Cryptol. ePrint Arch., 2015

The Tower Number Field Sieve.
IACR Cryptol. ePrint Arch., 2015

2014
Cofactorization on Graphics Processing Units.
IACR Cryptol. ePrint Arch., 2014

Mersenne factorization factory.
IACR Cryptol. ePrint Arch., 2014

On the Powers of 2.
IACR Cryptol. ePrint Arch., 2014

Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽<sub>2<sup>4·1223</sup></sub> and 𝔽<sub>2<sup>12·367</sup></sub>).
IACR Cryptol. ePrint Arch., 2014

2013
Universal security; from bits and mips to pools, lakes - and beyond.
IACR Cryptol. ePrint Arch., 2013

2012
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction.
Int. J. Appl. Cryptogr., 2012

Ron was wrong, Whit is right.
IACR Cryptol. ePrint Arch., 2012

ECM at Work.
IACR Cryptol. ePrint Arch., 2012

Finding ECM-Friendly Curves through a Study of Galois Properties.
IACR Cryptol. ePrint Arch., 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.
Clust. Comput., 2012

Public Keys.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
Using the Cloud to Determine Key Strengths.
IACR Cryptol. ePrint Arch., 2011

Degree of regularity for HFE-.
IACR Cryptol. ePrint Arch., 2011

2010
Factorization of a 768-bit RSA modulus.
IACR Cryptol. ePrint Arch., 2010

ECC2K-130 on Cell CPUs.
IACR Cryptol. ePrint Arch., 2010

Efficient SIMD arithmetic modulo a Mersenne number.
IACR Cryptol. ePrint Arch., 2010

Using a grid platform for solving large sparse linear systems over GF(2).
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.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.
IACR Cryptol. ePrint Arch., 2009

Breaking ECC2K-130.
IACR Cryptol. ePrint Arch., 2009

The Certicom Challenges ECC2-X.
IACR Cryptol. ePrint Arch., 2009

2007
A kilobit special number field sieve factorization.
IACR Cryptol. ePrint Arch., 2007

2006
On polynomial selection for the general number field sieve.
Math. Comput., 2006

2005
Hardware Factorization Based on Elliptic Curve Method.
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.
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.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004


  Loading...