Publications associées à Générateur de nombres pseudo-aléatoires

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

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

Chaotic microcomb-based parallel ranging

Tobias Kippenberg, Aleksandr Tusnin, Junqiu Liu, Anton Lukashchuk

The intrinsic random amplitude and phase modulation of 40 distinct lines of a microresonator frequency comb operated in the modulation instability regime are used to realize massively parallel random-modulation continuous-wave light detection and ranging, ...

Nature Publishing Group2023

On Quantum Secure Compressing Pseudorandom Functions

Ritam Bhaumik

In this paper we characterize all 2n-bit-to-n-bit Pseudorandom Functions (PRFs) constructed with the minimum number of calls to n-bit-to-n-bit PRFs and arbitrary number of linear functions. First, we show that all two-round constructions are either classic ...

2023

Modelling and design of CMOS SPAD sensors for quantum random number generation

Pouyan Keshavarzian

Modern digital connectivity has necessitated the creation of robust methods for securely storing and transferring data. At the heart of all security infrastructure is the random number generator (RNG). While random numbers find use in a variety of applicat ...

EPFL2023

Revisiting the Indifferentiability of the Sum of Permutations

Ritam Bhaumik

The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal e ...

Springer2023

Automatic Content Curation of Visual Heritage

Mathieu Salzmann, Frédéric Kaplan, Delphine Ribes Lemay, Nicolas Henchoz, Valentine Bernasconi

Digitization and preservation of large heritage induce high maintenance costs to keep up with the technical standards and ensure sustainable access. Creating impactful usage is instrumental to justify the resources for long-term preservation. The Museum fü ...

2021

Max-infinitely divisible models and inference for spatial extremes

Emeric Rolland Georges Thibaud, Raphaël Huser

For many environmental processes, recent studies have shown that the dependence strength is decreasing when quantile levels increase. This implies that the popular max-stable models are inadequate to capture the rate of joint tail decay, and to estimate jo ...

WILEY2021

Learning How to Smile: Expression Video Generation With Conditional Adversarial Recurrent Nets

Wei Wang

While several research studies have focused on analyzing human behavior and, in particular, emotional signals from visual data, the problem of synthesizing face video sequences with specific attributes (e.g. age, facial expressions) received much less atte ...

2020

Collaborative Sampling in Generative Adversarial Networks

Alexandre Massoud Alahi, Yuejiang Liu, Parth Ashit Kothari

The standard practice in Generative Adversarial Networks (GANs) discards the discriminator during sampling. However, this sampling method loses valuable information learned by the discriminator regarding the data distribution. In this work, we propose a co ...

2020

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020