Publications associées à Discrete logarithm variants of VSH

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Abelian varieties are fascinating objects, combining the fields of geometry and arithmetic. While the interest in abelian varieties has long time been of purely theoretic nature, they saw their first real-world application in cryptography in the mid 1980's ...

EPFL2020

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017

Some consequences of Masser's counting theorem on elliptic curves

Valéry Aurélien Mahé

We use Masser's counting theorem to prove a lower bound for the canonical height in powers of elliptic curves. We also prove the Galois case of the elliptic Lehmer problem, combining Kummer theory and Masser's result with bounds on the rank and torsion of ...

Springer Heidelberg2017

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

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

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

Solving a $6120$-bit DLP on a Desktop Computer

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...

Springer Berlin Heidelberg2013

Discrete logarithm variants of VSH

Graph Chatbot

Chattez avec Graph Search

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Arithmetic and geometric structures in cryptography

Isogeny graphs of ordinary abelian varieties

Some consequences of Masser's counting theorem on elliptic curves

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Computational Aspects of Jacobians of Hyperelliptic Curves

On the discrete logarithm problem in finite fields of fixed characteristic

On the Analysis of Public-Key Cryptologic Algorithms

Generalised Mersenne Numbers Revisited

Solving a $6120$-bit DLP on a Desktop Computer

Arithmetic and geometric structures in cryptography

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Computational Aspects of Jacobians of Hyperelliptic Curves

Isogeny graphs of ordinary abelian varieties

On the Analysis of Public-Key Cryptologic Algorithms

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Solving a $6120$-bit DLP on a Desktop Computer

Some consequences of Masser's counting theorem on elliptic curves

On the discrete logarithm problem in finite fields of fixed characteristic

Generalised Mersenne Numbers Revisited