On Bad Randomness and Cloning of Contactless Payment and Building Smart Cards

Courtois, Nicolas T.; Hulme, Daniel; Hussain, Kumail; Gawinecki, Jerzy; Grajek, Marek

doi:10.1109/spw.2013.29

Cited by 6 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Poor initialization can also weaken the random numbers in operating systems like Windows 2000 (Dorrendorf et al, 2009). A few more examples of vulnerabilities due to initialization problems or other bad quality random number generators are weak RSA key generation in network devices (Heninger et al, 2012;Lenstra et al, 2012), repeated or guessable keys produced inside smart cards (Bernstein et al, 2013;Courtois et al, 2013;Nohl et al, 2008) and the predictable random sequences that are used for cryptographic purposes in Android (Kim et al, 2013;Michaelis et al, 2013).…”

Section: Random Numbers In Cryptographymentioning

confidence: 99%

Quantum random number generators

2017

View full text Add to dashboard Cite

Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy. Quantum random number generation is one of the most mature quantum technologies with many alternative generation methods. We discuss the different technologies in quantum random number generation from the early devices based on radioactive decay to the multiple ways to use the quantum states of light to gather entropy from a quantum origin. We also discuss randomness extraction and amplification and the notable possibility of generating trusted random numbers even with untrusted hardware using device independent generation protocols.

show abstract