Publications by Jens Markus Zumbrägel

Indiscreet logarithms in finite fields of small characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

2018

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

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}}$)

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. U ...

Springer Berlin Heidelberg2014

Solving a $6120$-bit DLP on a Desktop Computer

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...

Springer Berlin Heidelberg2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Robert Granger, Jens Markus Zumbrägel

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Jens Markus Zumbrägel

Graph Chatbot

Chat with Graph Search

Indiscreet logarithms in finite fields of small characteristic

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

On the discrete logarithm problem in finite fields of fixed characteristic

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}}$)

Solving a $6120$-bit DLP on a Desktop Computer

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Indiscreet logarithms in finite fields of small characteristic

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

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}}$)

Solving a $6120$-bit DLP on a Desktop Computer

On the discrete logarithm problem in finite fields of fixed characteristic

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$