scholarly journals Device-independent randomness generation with sublinear shared quantum resources

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 86 ◽  
Author(s):  
Cédric Bamps ◽  
Serge Massar ◽  
Stefano Pironio

In quantum cryptography, device-independent (DI) protocols can be certified secure without requiring assumptions about the inner workings of the devices used to perform the protocol. In order to display nonlocality, which is an essential feature in DI protocols, the device must consist of at least two separate components sharing entanglement. This raises a fundamental question: how much entanglement is needed to run such DI protocols? We present a two-device protocol for DI random number generation (DIRNG) which produces approximatelynbits of randomness starting fromnpairs of arbitrarily weakly entangled qubits. We also consider a variant of the protocol wheremsinglet states are diluted intonpartially entangled states before performing the first protocol, and show that the numbermof singlet states need only scale sublinearly with the numbernof random bits produced. Operationally, this leads to a DIRNG protocol between distant laboratories that requires only a sublinear amount of quantum communication to prepare the devices.

2014 ◽  
Vol 1 ◽  
pp. 272-275 ◽  
Author(s):  
Vincent Canals ◽  
Antoni Morro ◽  
Josep L. Rosselló

2021 ◽  
Vol 485 ◽  
pp. 126736
Author(s):  
Muhammad Imran ◽  
Vito Sorianello ◽  
Francesco Fresi ◽  
Bushra Jalil ◽  
Marco Romagnoli ◽  
...  

2021 ◽  
Vol 11 (8) ◽  
pp. 3330
Author(s):  
Pietro Nannipieri ◽  
Stefano Di Matteo ◽  
Luca Baldanzi ◽  
Luca Crocetti ◽  
Jacopo Belli ◽  
...  

Random numbers are widely employed in cryptography and security applications. If the generation process is weak, the whole chain of security can be compromised: these weaknesses could be exploited by an attacker to retrieve the information, breaking even the most robust implementation of a cipher. Due to their intrinsic close relationship with analogue parameters of the circuit, True Random Number Generators are usually tailored on specific silicon technology and are not easily scalable on programmable hardware, without affecting their entropy. On the other hand, programmable hardware and programmable System on Chip are gaining large adoption rate, also in security critical application, where high quality random number generation is mandatory. The work presented herein describes the design and the validation of a digital True Random Number Generator for cryptographically secure applications on Field Programmable Gate Array. After a preliminary study of literature and standards specifying requirements for random number generation, the design flow is illustrated, from specifications definition to the synthesis phase. Several solutions have been studied to assess their performances on a Field Programmable Gate Array device, with the aim to select the highest performance architecture. The proposed designs have been tested and validated, employing official test suites released by NIST standardization body, assessing the independence from the place and route and the randomness degree of the generated output. An architecture derived from the Fibonacci-Galois Ring Oscillator has been selected and synthesized on Intel Stratix IV, supporting throughput up to 400 Mbps. The achieved entropy in the best configuration is greater than 0.995.


2015 ◽  
Vol 137 ◽  
pp. 828-836 ◽  
Author(s):  
Che-Chi Shu ◽  
Vu Tran ◽  
Jeremy Binagia ◽  
Doraiswami Ramkrishna

2014 ◽  
Vol 104 (26) ◽  
pp. 261112 ◽  
Author(s):  
Z. L. Yuan ◽  
M. Lucamarini ◽  
J. F. Dynes ◽  
B. Fröhlich ◽  
A. Plews ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document