Publications associées à Better Algorithms for LWE and LWR

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures

Aymeric Genet

Current cryptographic solutions will become obsolete with the arrival of large-scale universal quantum computers. As a result, the National Institute of Standards and Technology supervises a post-quantum standardization process which involves evaluating ca ...

EPFL2024

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Laurent Villard, Stephan Brunner, Moahan Murugappan, Alberto Bottino

We introduce and derive the Fourier -enhanced 3D electrostatic field solver of the gyrokinetic full -f PIC code PICLS. The solver makes use of a Fourier representation in one periodic direction of the domain to make the solving of the system easily paralle ...

Elsevier2024

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Gibbs sampling the posterior of neural networks

Lenka Zdeborová, Emanuele Troiani, Giovanni Piccioli

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Iop Publishing Ltd2024

Secure and Efficient Cryptographic Algorithms in a Quantum World

Loïs Evan Huguenin-Dumittan

Since the advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mo ...

EPFL2024

Impact of beam-coupling impedance on the Schottky spectrum of bunched beam

Tatiana Pieloni, Nicolas Frank Mounet, Christophe Emmanuel R. Lannoy

The Schottky monitors of the Large Hadron Collider (LHC) can be used for non-invasive beam diagnostics to estimate various bunch characteristics, such as tune, chromaticity, bunch profile or synchrotron frequency distribution. However, collective effects, ...

Iop Publishing Ltd2024

Global existence for perturbations of the 2D stochastic Navier-Stokes equations with space-time white noise

Martin Hairer

We prove global in time well-posedness for perturbations of the 2D stochastic Navier-Stokes equations partial derivative( t)u + u center dot del u = Delta u - del p + sigma + xi, u(0, center dot ) = u(0),div (u) = 0, driven by additive space-time white noi ...

Springernature2024

On the Theory and Practice of Modern Secure Messaging

Daniel Patrick Collins

Billions of people now have conversations daily over the Internet. A large portion of this communication takes place via secure messaging protocols that offer "end-to-end encryption'" guarantees and resilience to compromise like the widely-used Double Ratc ...

EPFL2024

Stability of the Faber-Krahn inequality for the short-time Fourier transform

Joao Pedro Gonçalves Ramos

We prove a sharp quantitative version of the Faber–Krahn inequality for the short-time Fourier transform (STFT). To do so, we consider a deficit which measures by how much the STFT of a function fails to be optimally concentrated on an arbitrary set of pos ...

Springer Heidelberg2024