Publications associées à Random number generator attack

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

The field of biometrics, and especially face recognition, has seen a wide-spread adoption the last few years, from access control on personal devices such as phones and laptops, to automated border controls such as in airports. The stakes are increasingly ...

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

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

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

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile, Pablo Romero Gómez

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

WILEY2019

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

Maher Kayal, Stéphane Christian Olivier Terrier, 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

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

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

Is an irng singly generated as an ideal?

Nicolas Monod

Recall that a rng is a ring which is possibly non-unital. In this note, we address the problem whether every finitely generated idempotent rng (abbreviated as irng) is singly generated as an ideal. It is well-known that it is the case for a commutative irn ...

World Scientific Publishing2012

An Architecture-Independent Instruction Shuffler to Protect against Side-Channel Attacks

Paolo Ienne, Ali Galip Bayrak, Nikola Velickovic, Wayne Burleson

Embedded cryptographic systems, such as smart cards, require secure implementations that are robust to a variety of low-level attacks. Side-Channel Attacks (SCA) exploit the information such as power consumption, electromagnetic radiation and acoustic leak ...

2012

Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes

Khaled Ouafi

In this paper, we analyze the first known provably secure Radio Frequency Identification (RFID) authentication schemes that are designed to provide forward untraceability and backward untraceability: the L-K and S-M schemes. We show how to trace tags in th ...

Springer Verlag2011

A 9 pW/Hz Adjustable Clock Generator with 3-Decade Tuning Range for Dynamic Power Management in Subthreshold SCL Systems

Seyed Armin Tajalli, Yusuf Leblebici

A widely-tunable and power-scalable clock generator for ultra-low power (ULP) applications is presented. Benefitting from a novel self-adjustable loop frequency response, the proposed phase-locked loop based clock generator exhibits a tuning range of three ...

2010

Authentication with built-in encryption by using moire parallax effects between fixed correlated s-random layers

Isaac Amidror, Roger Hersch

This invention discloses new methods and security devices for authenticating documents and valuable products which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The invention relate ...

2009

Cryptanalysis of e-mail protocols providing perfect forward secrecy

Recently, two e-mail protocols were proposed claiming to provide perfect secrecy. These protocols use authentication and (Diffie-Hellman) key-exchange techniques, and as such, other standard security criteria besides perfect forward secrecy include key-rep ...

2008

Low-Power Adaptive Bias/Clock Generator Using 0.18um CMOS Technology for Multi-Core Continuous Voltage and Frequency Scaling

Yusuf Leblebici, Zeynep Toprak Deniz

This paper presents a continuous voltage and frequency scaling approach achieving lower transition (both energy and time) overheads implied by changing voltage levels, at a very low power dissipation and silicon area cost for multi-processor systems with i ...

2005