Concept

Théorème de l'idéal principal

Publications associées (8)

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

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

Low-frequency linear-mode regimes in the tokamak scrape-off layer

Paolo Ricci, Sébastien Jolliet, Federico David Halpern, Annamaria Mosetto

Motivated by the wide range of physical parameters characterizing the scrape-off layer (SOL) of existing tokamaks, the regimes of low-frequency linear instabilities in the SOL are identified by numerical and analytical calculations based on the linear, dri ...
American Institute of Physics2012

Sup-norms of Eigenfunctions on Arithmetic Ellipsoids

Philippe Michel

Let B be a positive quaternion algebra, and let O subset of B be an Eichler order. There is associated, in a natural way, a variety X = X(O) the connected components of which are indexed by the ideal classes of O and are isomorphic to spheres. This variety ...
Oxford University Press2011

Distribution of periodic torus orbits and Duke's theorem for cubic fields

Philippe Michel

We study periodic torus orbits on spaces of lattices. Using the action of the group of adelic points of the underlying tori, we define a natural equivalence relation on these orbits, and show that the equivalence classes become uniformly distributed. This ...
2011

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...
EPFL2009

Stickelberger Codes

Mohammad Amin Shokrollahi

Let pp be an odd prime and zetapzeta_p be a primitive pth root of unity over smallBbbQsmallBbbQ. The Galois group GG of K:=smallBbbQ(zetap)K:=smallBbbQ(zeta_p) over smallBbbQsmallBbbQ is a cyclic group of order p1p-1. The integral group ring smallBbbZ[G]smallBbbZ[G] contains the Stickelberger idea ...
1996

Modélisation markovienne du trafic dans les réseaux de communication

The principal question we address in this work is the following: "Is Markov modelling appropriate to analyse data networks?". We will conclude that it is. The motivation for this question comes from the work of a research team at Bellcore who argue that th ...
EPFL1996

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.