Concept

5 (nombre)

Publications associées (13)

Almost impossible E_8 and Leech lattices

We start this short note by introducing two remarkable mathematical objects: the E8E8 root lattice Lambda8Lambda8 in 8-dimensional Euclidean space and the Leech lattice Lambda24Lambda24 in 24-dimensional space. These two lattices stand out among their lat ...

2021

Ramsey numbers of ordered graphs

Jan Kyncl

An ordered graph is a pair G = (G,

ELECTRONIC JOURNAL OF COMBINATORICS2020

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

Shimura Curves and Special Values of p-adic L-functions

Ernest Hunter Brooks

We construct "generalized Heegner cycles" on a variety fibered over a Shimura curve, defined over a number field. We show that their images under the p-adic Abel-Jacobi map coincide with the values (outside the range of interpolation) of a p-adic L-functio ...

Oxford University Press2015

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

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

Modular Functions and Special Cycles

Maryna Viazovska

In this thesis we study algebraic cycles on Shimura varieties of orthogonal type. Such varieties are a higher dimensional generalization of modular curves and their important feature is that they have natural families of algebraic cycles in all codimesions ...

Rheinische Friedrich-Wilhelms-Universität Bonn2013

Equidistribution of Heegner points and ternary quadratic forms

Dimitar Petkov Jetchev

We prove new equidistribution results for Galois orbits of Heegner points with respect to single reduction maps at inert primes. The arguments are based on two different techniques: primitive representations of integers by quadratic forms and distribution ...

Springer Verlag2011

Expanding graphs, Ramanujan graphs, and 1-factor perturbations

Antoine Musitelli

We construct (k±1)-regular graphs which provide sequences of expanders by adding or substracting appropriate 1- factors from given sequences of k- regular graphs. We compute numerical examples in a few cases for which the given sequences are from the work ...

2006

Tetrahedral composite finite elements

Jean-François Molinari

We develop and analyse a composite 'CT3D' tetrahedral element consisting of an ensemble of 12 four-node linear tetrahedral elements, coupled to a linear assumed deformation defined over the entire domain of the composite element. The element is designed to ...

2002

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

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