Publications associées à Generalised Mersenne Numbers Revisited

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.

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Generalised Mersenne Numbers Revisited

Graph Chatbot

Chattez avec Graph Search

When Constant-time Source Yields Variable-time Binary: Exploiting Curve25519-donna Built with MSVC 2015

Faster ECC over $\mathbb{F}_{2^{521}-1}$

The DHLAB Trajectory

Colloidal Nanocrystal Frameworks

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

MATHICSE Technical Report : Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Liftings of reduction maps for quaternion algebras

On the Cryptanalysis of Public-Key Cryptography

Some remarks on the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication

Efficient SIMD arithmetic modulo a Mersenne number

The DHLAB Trajectory

Colloidal Nanocrystal Frameworks

Liftings of reduction maps for quaternion algebras

On the Cryptanalysis of Public-Key Cryptography

Efficient SIMD arithmetic modulo a Mersenne number

MATHICSE Technical Report : Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

When Constant-time Source Yields Variable-time Binary: Exploiting Curve25519-donna Built with MSVC 2015

Some remarks on the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication

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

Faster ECC over $\mathbb{F}_{2^{521}-1}$