Quantum random number generators

M Herrero-Collantes, JC Garcia-Escartin - Reviews of Modern Physics, 2017 - APS
Random numbers are a fundamental resource in science and engineering with important
applications in simulation and cryptography. The inherent randomness at the core of …

Mutual authentication in IoT systems using physical unclonable functions

MN Aman, KC Chua, B Sikdar - IEEE Internet of Things Journal, 2017 - ieeexplore.ieee.org
The Internet of Things (IoT) represents a great opportunity to connect people, information,
and things, which will in turn cause a paradigm shift in the way we work, interact, and think …

A privacy-preserving and scalable authentication protocol for the internet of vehicles

MN Aman, U Javaid, B Sikdar - IEEE Internet of Things Journal, 2020 - ieeexplore.ieee.org
One of the most important and critical requirements for the Internet of Vehicles (IoV) is
security under strict latency. Typically, authentication protocols for vehicular ad hoc networks …

[PDF][PDF] Constant depth circuits, Fourier transform, and learnability

N Linial, Y Mansour, N Nisan - Journal of the ACM (JACM), 1993 - dl.acm.org
In this paper, Boolean functions in, 4C0 are studied using harmonic analysis on the cube.
The main result is that an ACO Boolean function has almost all of its “power spectrum” on …

[PDF][PDF] Pseudorandom generators for space-bounded computations

N Nisan - Proceedings of the twenty-second annual ACM …, 1990 - dl.acm.org
Pseudorandom generators are constructed which convert O (SlogR) truly random bits to R
bits that appear random to any algorithm that runs in SPACE (S). In particular, any …

Device-independent randomness expansion against quantum side information

WZ Liu, MH Li, S Ragy, SR Zhao, B Bai, Y Liu… - Nature Physics, 2021 - nature.com
The ability to produce random numbers that are unknown to any outside party is crucial for
many applications. Device-independent randomness generation,,–does not require trusted …

LFSR-based hashing and authentication

H Krawczyk - Annual International Cryptology Conference, 1994 - Springer
We present simple and efficient hash functions applicable to secure authentication of
information. The constructions are mainly intended for message authentication in systems …

UMAC: Fast and secure message authentication

J Black, S Halevi, H Krawczyk, T Krovetz… - Advances in Cryptology …, 1999 - Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages
(in software, on contemporary machines) roughly an order of magnitude faster than current …

Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction

X Ma, F Xu, H Xu, X Tan, B Qi, HK Lo - Physical Review A—Atomic, Molecular …, 2013 - APS
Quantum random-number generators (QRNGs) can offer a means to generate information-
theoretically provable random numbers, in principle. In practice, unfortunately, the quantum …

Source-independent quantum random number generation

Z Cao, H Zhou, X Yuan, X Ma - Physical Review X, 2016 - APS
Quantum random number generators can provide genuine randomness by appealing to the
fundamental principles of quantum mechanics. In general, a physical generator contains two …