Publications associées à Indiscreet logarithms in finite fields of small characteristic

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

\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

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

Indiscreet logarithms in finite fields of small characteristic

Graph Chatbot

Chattez avec Graph Search

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

On solving LPN using BKW and variants Implementation and Analysis

Efficient Algorithms for the Data Exchange Problem

Computational Aspects of Jacobians of Hyperelliptic Curves

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

A Tale of Two Quasi-Polynomial Algorithms

On the discrete logarithm problem in finite fields of fixed characteristic

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Tight Bounds for Asynchronous Renaming

Computational Aspects of Jacobians of Hyperelliptic Curves

Tight Bounds for Asynchronous Renaming

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

On solving LPN using BKW and variants Implementation and Analysis

On the discrete logarithm problem in finite fields of fixed characteristic

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

A Tale of Two Quasi-Polynomial Algorithms

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Efficient Algorithms for the Data Exchange Problem