Random numbers are essential for cryptography. In most real-world systems, these values
come from a cryptographic pseudorandom number generator (PRNG), which in turn is …

Finding entropy sources is a major issue to design non-deterministic random generators for
headless devices. Our goal is to evaluate a collection of sensors (eg thermometer …

We provide a new inequality that links two important entropy notions: Shannon Entropy H_1
and collision entropy H_2. Our formula gives the worst possible amount of collision entropy …

Finding good entropy sources, designing deterministic (pseudo) random number
generators, or simply finding suitable non-deterministic random number generators are …

Dans ce travail, nous analysons des certificats SSL/TLS X. 509 (utilisant le chiffrement RSA
et provenant de centaines de millions de matériels connectés) à la recherche d'anomalies et …

Estimating entropy of randomness sources is a task of critical importance in the context of
true random number generators, as feeding cryptographic applications with insufficient …

We consider the schedulability-oriented replication problem of a set of periodic real-time
tasks where each task can be decomposed into several modules and intermodule …

Generating random numbers with high entropy plays an important role in cryptography. The
security of a modern cryptosystem can be proved under the assumption that the system uses …

Abstract Micro Electro Mechanical Systems (MEMS) sensors (accelerometer, gyroscope,
and compass) offer a practical approach for true random number generation. Entropy values …

We revisit the problem of estimating Renyi Entropy from samples, focusing on the important
case of collision entropy. With $ n $ samples we approximate the collision entropy of $ X …