Thorsten Kleinjung

From MaRDI portal
Person:1758890

Available identifiers

zbMath Open kleinjung.thorstenMaRDI QIDQ1758890

List of research outcomes





PublicationDate of PublicationType
A new perspective on the powers of two descent for discrete logarithms in finite fields2023-08-02Paper
Polynomial Selection for the Number Field Sieve2023-04-21Paper
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic2022-03-07Paper
Efficient Modular Arithmetic2022-02-25Paper
Computation of a 30750-bit binary field discrete logarithm2021-09-02Paper
Cryptanalysis of the generalised Legendre pseudorandom function2021-03-11Paper
Parametrizations for families of ECM-friendly curves2020-09-09Paper
CSI-FiSh: efficient isogeny based signatures through class group computations2020-05-20Paper
Indiscreet logarithms in finite fields of small characteristic2018-09-21Paper
On the discrete logarithm problem in finite fields of fixed characteristic2018-02-26Paper
A practical analytic method for calculating \(\pi(x)\)2017-07-03Paper
Computation of a 768-bit prime field discrete logarithm2017-06-13Paper
The tower number field sieve2016-03-23Paper
Quadratic sieving2016-03-23Paper
Finding ECM-friendly curves through a study of Galois properties2015-10-01Paper
Mersenne factorization factory2015-01-16Paper
Degree of regularity for HFE Minus (HFE\(-\))2014-12-30Paper
Using the cloud to determine key strengths2014-08-20Paper
Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))2014-08-07Paper
Universal security. From bits and mips to pools, lakes -- and beyond2013-12-10Paper
Some applications of the Weil-Barner explicit formula2013-05-13Paper
ECM at work2013-03-19Paper
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction2012-11-16Paper
Public keys2012-09-25Paper
On the use of the negation map in the Pollard rho method2010-09-29Paper
Factorization of a 768-Bit RSA Modulus2010-08-24Paper
ECC2K-130 on Cell CPUs2010-05-04Paper
A Kilobit Special Number Field Sieve Factorization2008-05-15Paper
On polynomial selection for the general number field sieve2007-02-01Paper
Framed mixed Tate motives and the value of zeta-functions of number fields at 2 and 32001-07-15Paper

Research outcomes over time

This page was built for person: Thorsten Kleinjung