Concept

Tower of fields

Related publications (8)

Arithmetic and geometric structures in cryptography

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

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

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

2018

Algebraic Trace Functions Over The Primes

Philippe Michel

We study sums over primes of trace functions of l-adic sheaves. Using an extension of our earlier results on algebraic twists of modular forms to the case of Eisenstein series and bounds for Type II sums based on similar applications of the Riemann hypothe ...

Duke Univ Press2014

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Upper bounds for Euclidean minima of algebraic number fields

Eva Bayer Fluckiger

The aim of this paper is to give new upper bounds for Euclidean minima of algebraic number fields. In particular, to show that Minkowski's conjecture holds for the maximal totally real subfields of cyclotomic fields of prime power conductor. ...

2006

Discrete logarithm variants of VSH

Arjen Lenstra, Martijn Stam

Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors in ...

2006

Réseaux idéaux sur des corps CM et des corps totalement réels

Ivan Suarez Atias

This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...

EPFL2005