Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Crible algébrique

Publications associées (23)

INCLASS: Incremental Classification Strategy for Self-Aware Epileptic Seizure Detection

David Atienza Alonso, Giovanni Ansaloni, Tomas Teijeiro Campo

Wearable Health Companions allow the unobtrusive monitoring of patients affected by chronic conditions. In particular, by acquiring and interpreting bio-signals, they enable the detection of acute episodes in cardiac and neurological ailments. Nevertheless ...

IEEE2022

Bootstrapping massive quantum field theories

João Miguel Augusto Penedones Fernandes, Denis Karateev

We propose a new non-perturbative method for studying UV complete unitary quantum field theories (QFTs) with a mass gap in general number of spacetime dimensions. The method relies on unitarity formulated as positive semi-definiteness of the matrix of inne ...

Springer Nature2020

Propagation of fluid driven fractures in transversely isotropic material

Fatima-Ezzahra Moukhtari

The propagation of fluid driven fractures is used in a number of industrial applications (well stimulation of unconventional reservoirs, development of deep geothermal systems) but also occurs naturally (magmatic dyke intrusion). While the mechanics of hyd ...

EPFL2020

Computation of a 768-Bit Prime Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...

Springer International Publishing Ag2017

Quadratic Sieving

Thorsten Kleinjung

We propose an efficient variant for the initialisation step of quadratic sieving, the sieving step of the quadratic sieve and its variants, which is also used in sieving-based algorithms for computing class groups of quadratic fields. As an application we ...

American Mathematical Society2016

Inhomogeneous minima of mixed signature lattices

Eva Bayer Fluckiger, Martino Borello

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...

Academic Press Inc Elsevier Science2016

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

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

Cofactorization on Graphics Processing Units

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Andrea Miele

We show how the cofactorization step, a compute-intensive part of the relation collection phase of the number field sieve (NFS), can be farmed out to a graphics processing unit. Our implementation on a GTX 580 GPU, which is integrated with a state-of-the-a ...

Springer-Verlag Berlin2014

A sieve algorithm based on overlattices

In this paper, we present a heuristic algorithm for solving exact, as well as approximate, shortest vector and closest vector problems on lattices. The algorithm can be seen as a modified sieving algorithm for which the vectors of the intermediate sets lie ...

Cambridge Univ Press2014

Hybrid Bounds For Automorphic Forms On Ellipsoids Over Number Fields

Philippe Michel

We prove upper bounds for Hecke-Laplace eigenfunctions on certain Riemannian manifolds X of arithmetic type, uniformly in the eigenvalue and the volume of the manifold. The manifolds under consideration are d-fold products of 2-spheres or 3-spheres, realiz ...

Cambridge Univ Press2013

Algorithm to calculate a large number of roots of the cross-product of Bessel functions

Juan Ramon Mosig, Michael Mattes, Francisco Edén Sorolla Rosario

This paper describes an algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. The algorithm initially finds the roots of the zeroth order using an auxiliary function that exhibits the same r ...

Institute of Electrical and Electronics Engineers2013

A heterogeneous computing environment to solve the 768-bit RSA challenge

Pénélope Leyland, Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Dag Arne Osvik, Michela Thiémard

In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. In the article we present the heterogeneous computing approac ...

Springer Verlag2012

Algebraic Divisibility Sequences Over Function Fields

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields define ...

Australian Mathematical Society2012

On the Reduction of Points on Abelian Varieties and Tori

Let G be the product of an abelian variety and a torus defined over a number field K. Let R-1, ..., R-n be points in G(K). Let l be a rational prime, and let a(1), ..., a(n) be nonnegative integers. Consider the set of primes p of K satisfying the followin ...

2011

Factorization of a 768-Bit RSA Modulus

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Dag Arne Osvik, Patric Zimmermann

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA. ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

A counterexample to the local-global principle of linear dependence for Abelian varieties

Let A be an Abelian variety defined over a number field k. Let P be a point in A(k) and let X be a subgroup of A(k). Gajda and Kowalski asked in 2002 whether it is true that the point P belongs to X if and only if the point (P mod p) belongs to (X mod p) f ...

2010

Statistics Of Prime Divisors In Function Fields

We show that the prime divisors of a random polynomial in F-q[t] are typically "Poisson distributed". This result is analogous to the result in Z of Granville [1]. Along the way, we use a sieve developed by Granville and Soundararajan [2] to give a simple ...

2009

A kilobit special number field sieve factorization

Arjen Lenstra, Thorsten Kleinjung, Dag Arne Osvik

We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 -1. Although this factorization is orders of magnitude ...

2007

Publications associées (23)

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010