Please use this identifier to cite or link to this item:
Title: Turing, ciphers and quanta
Authors: Ekert, A. 
Kay, A. 
Pope, J.
Keywords: Key distribution
Quantum cryptography
Issue Date: 28-Jul-2012
Citation: Ekert, A., Kay, A., Pope, J. (2012-07-28). Turing, ciphers and quanta. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370 (1971) : 3418-3431. ScholarBank@NUS Repository.
Abstract: Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future. This journal is © 2012 The Royal Society.
Source Title: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
ISSN: 1364503X
DOI: 10.1098/rsta.2011.0324
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Apr 15, 2021


checked on Apr 15, 2021

Page view(s)

checked on Apr 11, 2021

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.