Publications associées à Cryptographie sur les courbes elliptiques

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 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

Cryptographie sur les courbes elliptiques

Graph Chatbot

Chattez avec Graph Search

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

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

MATHICSE Technical Report : Analytic regularity and collocation approximation for PDEs with random domain deformations

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

Quantitative Version Of The Kipnis-Varadhan Theorem And Monte Carlo Approximation Of Homogenized Coefficients

Interaural correlation discrimination from diffuse field reference correlations

Low-Latency Elliptic Curve Scalar Multiplication

On the Cryptanalysis of Public-Key Cryptography

Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Quantitative Version Of The Kipnis-Varadhan Theorem And Monte Carlo Approximation Of Homogenized Coefficients

Interaural correlation discrimination from diffuse field reference correlations

Low-Latency Elliptic Curve Scalar Multiplication

MATHICSE Technical Report : Analytic regularity and collocation approximation for PDEs with random domain deformations

On the Cryptanalysis of Public-Key Cryptography

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

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

Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves