Publications associées à Cryptographically secure pseudorandom number generator

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

Edoardo Charbon, Claudio Bruschini, 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

Efficient random number generation techniques for CMOS single-photon avalanche diode array exploiting fast time tagging units

Edoardo Charbon, Samuel Burri

This work presents a technique to produce random bits by exploiting single-photon time of arrival. Two quantum random number generator (QRNG) devices based on the field programmable gate array (FPGA) technology are presented: Randy, which uses one discrete ...

AMER PHYSICAL SOC2020

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

On the Security of Two-Round Multi-Signatures

Bryan Alexander Ford, Manu Drijvers

A multi-signature scheme allows a group of signers to collaboratively sign a message, creating a single signature that convinces a verifier that every individual signer approved the message. The increased interest in technologies to decentralize trust has ...

IEEE COMPUTER SOC2019

Timing Violation Induced Faults in Multi-Tenant FPGAs

Mirjana Stojilovic, Dina Gamaleldin Ahmed Shawky Mahmoud

FPGAs have made their way into the cloud, allowing users to gain remote access to the state-of-the-art reconfigurable fabric and implement their custom accelerators. Since FPGAs are large enough to accommodate multiple independent designs, the multi-tenant ...

IEEE2019

Dual Generator Generative Adversarial Networks for Multi-domain Image-to-Image Translation

Yan Yan, Wei Wang

State-of-the-art methods for image-to-image translation with Generative Adversarial Networks (GANs) can learn a mapping from one domain to another domain using unpaired image data. However, these methods require the training of one specific model for every ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

A Tight Lower Bound for Entropy Flattening

Mika Tapani Göös, Jiapeng Zhang

We study entropy flattening: Given a circuit C_X implicitly describing an n-bit source X (namely, X is the output of C_X on a uniform random input), construct another circuit C_Y describing a source Y such that (1) source Y is nearly flat (uniform on its s ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2018

Subthreshold Logic for Low-Area and Energy Efficient True Random Number Generator

Maher Kayal, Mathieu Yves Hervé Coustans, Thomas Eberhardt, Laurent Fesquet

This paper discusses the advantages of subthreshold logic for True Random Number Generators (TRNG). In this work, the entropy is modeled, and a lower bound of Shannon's entropy per output bit can quickly be estimated. Thanks to this model, sizing TRNGs in ...

IEEE2018

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

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.

Cryptographically secure pseudorandom number generator

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

Efficient random number generation techniques for CMOS single-photon avalanche diode array exploiting fast time tagging units

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

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

On the Security of Two-Round Multi-Signatures

Timing Violation Induced Faults in Multi-Tenant FPGAs

Dual Generator Generative Adversarial Networks for Multi-domain Image-to-Image Translation

A Tight Lower Bound for Entropy Flattening

Subthreshold Logic for Low-Area and Energy Efficient True Random Number Generator

Quasi-random numbers for copula models

Graph Chatbot

Chattez avec Graph Search

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

Timing Violation Induced Faults in Multi-Tenant FPGAs

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Quasi-random numbers for copula models

Efficient random number generation techniques for CMOS single-photon avalanche diode array exploiting fast time tagging units

Subthreshold Logic for Low-Area and Energy Efficient True Random Number Generator

On the Security of Two-Round Multi-Signatures

Dual Generator Generative Adversarial Networks for Multi-domain Image-to-Image Translation

A Tight Lower Bound for Entropy Flattening

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