Publications associées à Design Validations for Discrete Logarithm Based Signature Schemes

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

Design Validations for Discrete Logarithm Based Signature Schemes

Graph Chatbot

Chattez avec Graph Search

Hardware Attacks against Hash-based Cryptographic Algorithms

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Learning Image Descriptors with Boosting

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

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

Boosting Binary Keypoint Descriptors

Forgery-Resilience for Digital Signature Schemes

Cryptographic Hash Functions in Groups and Provable Properties

Faster and Smoother - VSH Revisited

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

Hardware Attacks against Hash-based Cryptographic Algorithms

Learning Image Descriptors with Boosting

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Forgery-Resilience for Digital Signature Schemes

Faster and Smoother - VSH Revisited

Boosting Binary Keypoint Descriptors

Cryptographic Hash Functions in Groups and Provable Properties