Publications associées à Pseudo Random Numbers Generators available as Web Services

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

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

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator

Edoardo Charbon, Francesco Gramuglia, Pouyan Keshavarzian, Mario Stipcevic

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Chaotic microcomb-based parallel ranging

Tobias Kippenberg, Junqiu Liu, Anton Lukashchuk, Aleksandr Tusnin

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

Resource aware pricing for electric vehicle charging

Nils Gustav Nilsson

Electric vehicle charging facilities offer their capacity constrained electric charge and parking to users for a fee. As electric vehicle adoption grows, so too does the potential for excessive resource utilization. In this paper, we study how prices set b ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Certification of the efficient random number generation technique based on single-photon detector arrays and time-to-digital converters

Edoardo Charbon, Samuel Burri

True random number generators (TRNGs) allow the generation of true random bit sequences, guaranteeing the unpredictability and perfect balancing of the generated values. TRNGs can be realised from the sampling of quantum phenomena, for instance, the detect ...

Wiley2021

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Claudio Bruschini, Edoardo Charbon, Ivan Michel Antolovic, Mario Stipcevic

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

SPIE2021

Max-infinitely divisible models and inference for spatial extremes

Raphaël Huser, Emeric Rolland Georges Thibaud

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

Multivariate extremes over a random number of observations

Simone Padoan, Stefano Rizzelli

The classical multivariate extreme-value theory concerns the modeling of extremes in a multivariate random sample, suggesting the use of max-stable distributions. In this work, the classical theory is extended to the case where aggregated data, such as max ...

WILEY2021

Design using randomness: a new dimension for metallurgy

William Curtin

High entropy alloys add a new dimension, atomic-scale randomness and the associated scale-dependent composition fluctuations, to the traditional metallurgical axes of time-temperature-composition-microstructure. Alloy performance is controlled by the energ ...

2020

A Study on More Realistic Room Simulation for Far-Field Keyword Spotting

Robin Scheibler, Eric Bezzam

We investigate the impact of more realistic room simulation for training far-field keyword spotting systems without fine-tuning on in-domain data. To this end, we study the impact of incorporating the following factors in the room impulse response (RIR) ge ...

IEEE2020

Quasi-random numbers for copula models

Mathieu Jacques David Cambou

The present work addresses the question how sampling algorithms for commonly applied copula models can be adapted to account for quasi-random numbers. Besides sampling methods such as the conditional distribution method (based on a one-to-one transformatio ...

Springer2017

A methodology for the rigorous verification of Particle-in-Cell simulations

Paolo Ricci, Fabio Riva, Carrie Fiona Beadle

A methodology to perform a rigorous verification of Particle-in-Cell (PIC) simulations is presented, both for assessing the correct implementation of the model equations (code verification), and evaluating the numerical uncertainty affecting the simulation ...

American Institute of Physics2017

Verification and validation procedures with applications to plasma-edge turbulence simulations

Fabio Riva

Understanding the plasma dynamics in tokamaks is of fundamental importance to reliably predict the performances of future fusion devices. Because of the complex phenomena at play, state-of-the-art simulation codes are needed to investigate the plasma dynam ...

EPFL2017

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification

Divesh Aggarwal

The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a weak random source x with min-entropy k and a uniformly random seed Y of length d, and ...

Ieee2016

Boosting OMD for Almost Free Authentication of Associated Data

Serge Vaudenay, Reza Reyhanitabar, Damian Vizár

We propose pure OMD (p-OMD) as a new variant of the Offset Merkle-Damgård (OMD) authenticated encryption scheme. Our new scheme inherits all desirable security features of OMD while having a more compact structure and providing higher efficiency. The origi ...

Springer2015

Compressed Sensing of Memoryless Sources : A Deterministic Hadamard Construction

Saeid Haghighatshoar

Compressed sensing is a new trend in signal processing for efficient sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by ta ...

EPFL2014

Towards a High-Speed Quantum Random Number Generator

Edoardo Charbon, Samuel Burri, Francesco Regazzoni

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this articl ...

2013

Blind Sensor Calibration in Sparse Recovery Using Convex Optimization

Rémi Gribonval, Gilles Puy

We investigate a compressive sensing system in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on a few unknown (but sparse) signals. We extend our earlier s ...

2013

Lightweight Modular Staging: A Pragmatic Approach to Runtime Code Generation and Compiled DSLs

Martin Odersky, Tiark Rompf

Good software engineering practice demands generalization and abstraction, whereas high performance demands specialization and concretization. These goals are at odds, and compilers can only rarely translate expressive high-level programs to modern hardwar ...

2012

A cryptographically t-private auction system

Tiark Rompf

We present a cryptographically t-private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a f ...

2011