In Classical and Quantum Secure Communication Practical Randomness Is Incomplete (IMAGE)
Caption
The mathematical definition of a random bit sequence is so simple that it can be summarized in one sentence: A sequence of bits whose next bit is equal to 0 or 1 with equal probability, independent of previous ones. Although the definition is very simple, the practical certification of a process as random is much more complicated but crucial, for example, in secure communication, where information must be scrambled in order to prevent hackers from predicting a bit stream. Random bit sequences are key ingredients of various tasks in modern life and especially in secure communication. In a new study researchers have determined that generating true random bit sequences, classical or quantum, is an impossible mission. Based on these findings, they have demonstrated a new method of classified secure communication. Photo: Schematic of a random bit sequence, where the next bit has the same probability of being 0 or 1
Credit
Prof. Ido Kanter
Usage Restrictions
None
License
Licensed content