Publication

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

Publications associées (40)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

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

On the Analysis of Public-Key Cryptologic Algorithms

Andrea Miele

The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...

EPFL2015

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

2015

A Tale of Two Quasi-Polynomial Algorithms

Robert Granger

In 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating w ...

2015

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

2015

Breaking `128-bit Secure' Supersingular Binary Curves

Robert Granger

The discrete logarithm problem (DLP) in finite fields of small characteristic recently enjoyed a dramatic series of breakthrough results and computational records, with its (heuristic) complexity dropping from subexponential to quasi-polynomial. While thes ...

2014

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Joppe Willem Bos, Andrea Miele

Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algor ...

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

MATHICSE2014

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

Reconfigurable media coding: An overview

Marco Mattavelli

This paper provides an overview of the rationale of the Reconfigurable Media Coding framework developed by MPEG standardization committee to overcome the limits of traditional ways of providing decoder specifications. Such framework is an extension of the ...

Elsevier Science Bv2013