Publications related to Generalised Mersenne Numbers Revisited

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

The elliptic curve Curve25519 has been presented as pro- tected against state-of-the-art timing attacks [2]. This paper shows that a timing attack is still achievable against a particular X25519 implemen- tation which follows the RFC 7748 requirements [11] ...

Springer Int Publishing Ag2016

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

The DHLAB Trajectory

Alexandre André Robert Rigal, Dario Rodighiero, Loup Cellard

This visualisation represents the research activity of the Digital Humanities Lab through publications and co-authorship. Vertical disposition is ordered by time: each layer is a different year of publications, from the lab’s foundation to nowadays. The la ...

2015

Colloidal Nanocrystal Frameworks

Raffaella Buonsanti

A review. Colloidal nanocrystal frameworks (CNFs) are a modular class of mesostructured porous materials, which are assembled from pre-formed nanocrystal building units using suitably designed block copolymer architecture-directing agents. The functional a ...

2015

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

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. U ...

Springer Berlin Heidelberg2014

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

Fabio Nobile, Daniel Kressner, Christine Tobler, Rajesh Kumar

Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...

MATHICSE2014

Liftings of reduction maps for quaternion algebras

Dimitar Petkov Jetchev

We construct liftings of reduction maps from complex multiplication (CM) points to supersingular points for general quaternion algebras and use these liftings to establish a precise correspondence between CM points on indefinite quaternion algebras with a ...

Oxford University Press2013

On the Cryptanalysis of Public-Key Cryptography

Joppe Willem Bos

Nowadays, the most popular public-key cryptosystems are based on either the integer factorization or the discrete logarithm problem. The feasibility of solving these mathematical problems in practice is studied and techniques are presented to speed-up the ...

EPFL2012

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

Jeanine Marie Van Order

We establish several results towards the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication over imaginary quadratic fields, namely (i) the existence of an appropriate p-adic L-function, building on works of H ...

2012

Efficient SIMD arithmetic modulo a Mersenne number

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

This paper describes carry-less arithmetic operations modulo an integer 2^M − 1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implemen ...

IEEE Computer Soc Press2011

Generalised Mersenne Numbers Revisited

Graph Chatbot

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

Efficient SIMD arithmetic modulo a Mersenne number

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

The DHLAB Trajectory

Liftings of reduction maps for quaternion algebras

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

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

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

On the Cryptanalysis of Public-Key Cryptography

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