Publications de Thorsten Kleinjung

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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

Thorsten Kleinjung

Graph Chatbot

Chattez avec Graph Search

Lower glutamate and GABA levels in auditory cortex of tinnitus patients: a 2D-JPRESS MR spectroscopy study

Computation Of A 30750-Bit Binary Field Discrete Logarithm

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

Using the Cloud to Determine Key Strengths

On the Use of the Negation Map in the Pollard Rho Method

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

Lower glutamate and GABA levels in auditory cortex of tinnitus patients: a 2D-JPRESS MR spectroscopy study

Computation Of A 30750-Bit Binary Field Discrete Logarithm

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

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

On the Use of the Negation Map in the Pollard Rho Method

Using the Cloud to Determine Key Strengths