Publications associées à High performance VLSI architectures implementing strong cryptographic primitives

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

High performance VLSI architectures implementing strong cryptographic primitives

Graph Chatbot

Chattez avec Graph Search

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

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

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Proactively Accountable Anonymous Messaging in Verdict

Primeless Factoring-Based Cryptography

TCHo: A Code-Based Cryptosystem

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

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

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

On the Cryptanalysis of Public-Key Cryptography

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

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

Proactively Accountable Anonymous Messaging in Verdict

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Primeless Factoring-Based Cryptography

TCHo: A Code-Based Cryptosystem

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

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

On the Cryptanalysis of Public-Key Cryptography