quantum cryptography

back to index

28 results

The Code Book: The Science of Secrecy From Ancient Egypt to Quantum Cryptography

by Simon Singh  · 1 Jan 1999

Library of Congress has cataloged the Doubleday edition as follows: Singh, Simon. The code book : the evolution of secrecy from Mary Queen of Scots to quantum cryptography / Simon Singh. –1st ed. p. cm. 1. Cryptography–History. 2. Data encryption (Computer science)–History. I. Title. Z103.S56 1999 652′.8′09–dc21 99

its enemies. Although it is still in its infancy, quantum computing presents a potential threat to the individual, to international business and to global security. Quantum Cryptography While cryptanalysts anticipate the arrival of quantum computers, cryptographers are working on their own technological miracle—an encryption system that would reestablish privacy, even when

is the inspiration for a computer that could crack all current ciphers, it is also at the heart of a new unbreakable cipher called quantum cryptography. The story of quantum cryptography dates back to a curious idea developed in the late 1960s by Stephen Wiesner, then a graduate student at Columbia University. Sadly, it

other goodbye, having made no progress on the problem of key distribution. Instead, in a eureka! moment, they created quantum cryptography, the most secure form of cryptography ever devised. Their recipe for quantum cryptography requires three preparatory stages. Although these stages do not involve sending an encrypted message, they do allow the secure exchange

them using the incorrect detector, and so will have misinterpreted some of the photons that make up the final key. Another way to think about quantum cryptography is in terms of a pack of cards rather than polarized photons. Every playing card has a value and a suit, such as the jack

suits and values which can then be used as the basis for some kind of key. Quantum cryptography allows Alice and Bob to agree on a key, and Eve cannot intercept this key without making errors. Furthermore, quantum cryptography has an additional benefit: it provides a way for Alice and Bob to find out

has been eavesdropping, and they would have to abandon the entire onetime pad, switch to a new line and start all over again. To summarize, quantum cryptography is a system that ensures the security of a message by making it hard for Eve to read accurately a communication between Alice and Bob

. Furthermore, if Eve tries to eavesdrop then Alice and Bob will be able to detect her presence. Quantum cryptography therefore allows Alice and Bob to exchange and agree upon a onetime pad in complete privacy, and thereafter they can use this as a key

graduate student, and I didn’t have that much confidence. In any case, nobody seemed interested in quantum money.” Cryptographers greeted Bennett and Brassard’s quantum cryptography with enthusiasm. However, many experimentalists argued that the system worked well in theory, but would fail in practice. They believed that the difficulty of dealing

with individual photons would make the system impossible to implement. Despite the criticism, Bennett and Brassard were convinced that quantum cryptography could be made to work. In fact, they had so much faith in their system that they did not bother building the apparatus. As Bennett

, to help assemble the apparatus. After a year of effort they were ready to attempt to send the first message ever to be protected by quantum cryptography. Late one evening they retreated into their light-tight laboratory, a pitch-black environment safe from stray photons that might interfere with the experiment. Having

in using this technique to build quantum cryptographic systems that operate over significant distances. In 1995, researchers at the University of Geneva succeeded in implementing quantum cryptography in an optic fiber that stretched 23 km from Geneva to the town of Nyon. More recently, a group of scientists at Los Alamos National

Laboratory in New Mexico has once again begun to experiment with quantum cryptography in air. Their ultimate aim is to create a quantum cryptographic system that can operate via satellites. If this could be achieved, it would enable

through air over a distance of 1 km. Security experts are now wondering how long it will be before quantum cryptography becomes a practical technology. At the moment there is no advantage in having quantum cryptography, because the RSA cipher already gives us access to effectively unbreakable encryption. However, if quantum computers were to

become a reality, then RSA and all other modern ciphers would be useless, and quantum cryptography would become a necessity. So the race is on

. The really important question is whether quantum cryptography will arrive in time to save us from the threat of quantum computers, or whether there will be

a privacy gap, a period between the development of quantum computers and the advent of quantum cryptography. So far, quantum cryptography is the more advanced technology. The Swiss experiment with optic fibers demonstrates that it would be feasible to build a system that permits secure

communication between financial institutions within a single city. Indeed, it is currently possible to build a quantum cryptography link between the White House and the Pentagon. Perhaps there already is one. Quantum cryptography would mark the end of the battle between codemakers and codebreakers, and the codemakers emerge victorious

. Quantum cryptography is an unbreakable system of encryption. This may seem a rather exaggerated assertion, particularly in the light of previous similar claims. At

figure out a way of breaking each cipher, or developing technology that would break it for them. However, the claim that quantum cryptography is secure is qualitatively different from all previous claims. Quantum cryptography is not just effectively unbreakable, it is absolutely unbreakable. Quantum theory, the most successful theory in the history of physics

. Eve cannot even attempt to intercept the onetime pad key without Alice and Bob being warned of her eavesdropping. Indeed, if a message protected by quantum cryptography were ever to be deciphered, it would mean that quantum theory is flawed, which would have devastating implications for physicists; they would be forced to

reconsider their understanding of how the universe operates at the most fundamental level. If quantum cryptography systems can be engineered to operate over long distances, the evolution of ciphers will stop. The quest for privacy will have come to an end

, businesses and the public. The only question remaining would be whether or not governments would allow us to use the technology. How would governments regulate quantum cryptography, so as to enrich the Information Age, without protecting criminals? The Cipher Challenge The Cipher Challenge is a set of ten encrypted messages, which I

. If scientists could build a quantum computer on any reasonable scale, it would jeopardize the security of all current ciphers except the onetime pad cipher. quantum cryptography An unbreakable form of cryptography that exploits quantum theory, in particular the uncertainty principle-which states that it is impossible to measure all aspects of

an object with absolute certainty. Quantum cryptography guarantees the secure exchange of a random series of bits, which is then used as the basis for a onetime pad cipher. RSA The first

physics with the theories of knowledge, computation and evolution. Bennett, C. H., Brassard, C., and Ekert, A., “Quantum Cryptography,” Scientific American, vol. 269 (October 1992), pp. 26–33. A clear explanation of the evolution of quantum cryptography. Deutsch, D., and Ekert, A., “Quantum computation,” Physics World, vol. 11, no. 3 (March 1998), pp. 33

–56. One of four articles in a special issue of Physics World. The other three articles discuss quantum information and quantum cryptography, and are written by leading figures in the subject. The articles are aimed at physics graduates and give an excellent overview of the current state

The Golden Ticket: P, NP, and the Search for the Impossible

by Lance Fortnow  · 30 Mar 2013  · 236pp  · 50,763 words

cryptography a bit more painful. Facebook could also use quantum mechanics to both create and transmit a pad to Alice. We’ll talk more about quantum cryptography in the next chapter, but that approach will likely be too expensive to use on a large scale. Zero-Knowledge Sudoku Bob was spending his

can or cannot do still remain significant challenges. In this chapter we explore the power of quantum computing, as well as the related concepts of quantum cryptography and teleportation. The Quantum DVR Tom is a Bostonian and, of course, a huge Red Sox fan. The New York Yankees played in Boston earlier

and help us better understand the fundamental nature of the universe, but they likely won’t solve NP-complete problems or make spreadsheets run faster. Quantum Cryptography Most of the cryptographic tools we discussed in chapter 8 are secure under the assumption that factoring is a difficult computational problem. Anyone with a

. Unlike quantum computing, the basic Bennett-Brassard protocol does not require quantum entanglement, and also unlike quantum computing, there are working implementations of medium-scale quantum cryptography. Researchers at Los Alamos have successfully sent messages over ninety-two miles through fiber optic cables. Others have sent messages between two of the Canary

the near future we may be able to use quantum techniques to send unbreakable codes via satellite. So why don’t we use quantum cryptography for all secrecy needs? Quantum cryptography is still in the experimental stage, quite expensive, not much bandwidth, and prone to error. Vulnerabilities in cryptographic systems usually don’t rely

, probably much easier, to have as bad an implementation of a quantum protocol as of a classical one. There is no clear way to do quantum cryptography through the Internet, where information is routed through many stations from source to destination. And most important, we won’t likely see any computer, quantum

seem like magic. The ad refers to 1993 research from IBM scientist Charlie Bennett and his colleagues, including Gilles Brassard. The people who gave us quantum cryptography also gave us quantum teleportation. Arthur has a quantum bit and wants to give it to Harriet. How does he do that? Figure 9-4

’s role in quantum computing draws on David Deutsch’s work, “Quantum Computation,” Physics World, January 6, 1992. Works Cited Charles Bennett and Gilles Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (Amsterdam: Elsevier, 1984), 175–79. Charles Bennett

, 160–61 integrated circuits, 113, 113–14 Intel microprocessors, 90–91 interior point algorithm, 70 International Conference on Theory and Applications of Satisfiability, 96 Internet: quantum cryptography over, 149; security on, 128–29; size of, 2, 34; tracking over, 159–60 “The Intrinsic Computational Difficulty of Functions” (Cobham), 76, 77 Jeopardy!, 156

, 151, 151–52; transporting, 150, 150–53, 151, 152; values of, 145, 145 quantum computers: capabilities of, 9, 143, 146–47; future of, 153–54 quantum cryptography, 130, 148–49 quantum error-correction, 147 quantum states, observing, 146 quantum teleportation, 149–53, 150 randomness: creating, 139–40; public, 136 random sequences, 82

Applied Cryptography: Protocols, Algorithms, and Source Code in C

by Bruce Schneier  · 10 Nov 1993

.11 Zero-Knowledge Proofs of Knowledge 23.12 Blind Signatures 23.13 Oblivious Transfer 23.14 Secure Multiparty Computation 23.15 Probabilistic Encryption 23.16 Quantum Cryptography Part IV—The Real World Chapter 24—Example Implementations 24.1 IBM Secret-Key Management Protocol 24.2 MITRENET 24.3 ISDN 24.4 STU

the square root of any quadratic residue. If you can do this, then you can factor. For details, consult [1570,1571,35,36]. 23.16 Quantum Cryptography Quantum cryptography taps the natural uncertainty of the quantum world. With it, you can create a communications channel where it is impossible to eavesdrop without disturbing the

is described in [128,129,123,124,125,133,126,394,134,392,396]. The best overview of quantum cryptography can be found in [131]; [1651] is another good nontechnical overview. A complete bibliography of quantum cryptography is [237]. This would still be on the lunatic fringe of cryptography, but Bennett and Brassard actually

went and built a working model of the thing [127,121,122]. Now we have experimental quantum cryptography. So sit back, get yourself something to drink, and relax. I’m going to explain what this is all about. According to quantum mechanics, particles

,” Journal of Cryptology, v. 4, n. 3, 1991, pp. 175–184. 121. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental Quantum Cryptography,” Advances in Cryptology—EUROCRYPT ’90 Proceedings, Springer–Verlag, 1991, pp. 253–265. 122. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin

, “Experimental Quantum Cryptography,” Journal of Cryptology, v. 5, n. 1, 1992, pp. 3–28. 123. C.H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” Proceedings of the IEEE International Conference on Computers, Systems, and

Signal Processing, Banjalore, India, Dec 1984, pp. 175–179. 124. C.H. Bennett and G. Brassard, “An Update on Quantum Cryptography,” Advances in Cryptology: Proceedings of CRYPTO 84, Springer–Verlag, 1985, pp. 475–480. 125. C.H. Bennett and G. Brassard, “Quantum Public–Key Distribution System

Reinvented,” SIGACT News, v. 18, n. 4, 1987, pp. 51–53. 127. C.H. Bennett and G. Brassard, “The Dawn of a New Era for Quantum Cryptography: The Experimental Prototype is Working!” SIGACT News, v. 20, n. 4, Fall 1989, pp. 78–82. 128. C.H. Bennett, G. Brassard, and S. Breidbart

, Quantum Cryptography II: How to Re–Use a One–Time Pad Safely Even if P=NP, unpublished manuscript, Nov 1982. 129. C.H. Bennett, G. Brassard, S.

Breidbart, and S. Weisner, “Quantum Cryptography, or Unforgeable Subway Tokens,” Advances in Cryptology: Proceedings of Crypto 82, Plenum Press, 1983, pp. 267–275. 130. C.H. Bennett, G. Brassard, C. Crépeau

Quantum Oblivious Transfer,” Advances in Cryptology—CRYPTO ’91 Proceedings, Springer–Verlag, 1992, pp. 351–366. 131. C.H. Bennett, G. Brassard, and A.K. Ekert, “Quantum Cryptography,” Scientific American, v. 267, n. 4, Oct 1992, pp. 50–57. 132. C.H. Bennett, G. Brassard, and N.D. Mermin

, “Quantum Cryptography Without Bell’s Theorem,” Physical Review Letters, v. 68, n. 5, 3 Feb 1992, pp. 557–559. 133. C.H. Bennett, G. Brassard, and J.–

Cryptology: Proceedings of Crypto 82, Plenum Press, 1983, pp. 231–236. 192. K.J. Blow and S.J.D. Phoenix, “On a Fundamental Theorem of Quantum Cryptography,” Journal of Modern Optics, v. 40, n. 1, Jan 1993, pp. 33–36. 193. L. Blum, M. Blum, and M. Shub, “A Simple Unpredictable Pseudo

Information Theory, v. IT–29, n. 6, Nov 1983, pp. 877–894. 236. G. Brassard, Modern Cryptology: A Tutorial, Springer–Verlag, 1988. 237. G. Brassard, “Quantum Cryptography: A Bibliography,” SIGACT News, v. 24, n. 3, Oct 1993, pp. 16–20. 238. G. Brassard, D. Chaum, and C. Crépeau, “An Introduction to Minimum

, “Trapdoors in Knapsack Cryptosystems,” Lecture Notes in Computer Science 149; Cryptography—Proceedings, Burg Feuerstein 1982, Springer–Verlag, 1983, pp. 316–322. 517. A.K. Ekert, “Quantum Cryptography Based on Bell’s Theorem,” Physical Review Letters, v. 67, n. 6, Aug 1991, pp. 661–663. 518. T. ElGamal, “A Public–Key Cryptosystem and

. 338–350. 1244. C.P. Pfleeger, Security in Computing, Englewood Cliffs, N.J.: Prentice–Hall, 1989. 1245. S.J.D. Phoenix and P.D. Townsend, “Quantum Cryptography and Secure Optical Communication,” BT Technology Journal, v. 11, n. 2, Apr 1993, pp. 65–75. 1246. J. Pieprzyk, “On Public–Key Cryptosystems Built Using

, pp. 77–101. 1533. P.D. Townsend, J.G. Rarity, and P.R. Tapster, “Enhanced Single Photon Fringe Visibility in a 10 km–Long Prototype Quantum Cryptography Channel,” Electronics Letters, v. 28, n. 14, 8 Jul 1993, pp. 1291–1293. 1534. S.A. Tretter, “Properties of PN2 Sequences,” IEEE Transactions on Information

feedback mode, 208 polynomial, 238 polynomial-time, 238 probabilistic encryption, 552–554 propagating cipher block chaining mode, 207 public-key, 4–5, 33 quadratic, 238 quantum cryptography, 554–557 restricted, 3 running times, 238–239 secret-sharing algorithms, 528–531 secure multiparty computation, 551–552 Algorithms (Cont.) security, 8–9 self-synchronizing

-key ring, 585 Purchase-key attack, 7 Quadratic nonresidues, 251 Quadratic residues, 250–251 generator, 417 Quadratic sieve, 256 factoring, 159 Quantum computing, 164–165 Quantum cryptography, 554–557 Quintuple encryption, 366 Quisquater, Jean-Jacques, 102, 508 Quisquater-Girault, 450 Rabin, 475–476 Rabin, Michael, 103, 259, 518, 550 Rabin-Miller algorithm

The Information: A History, a Theory, a Flood

by James Gleick  · 1 Mar 2011  · 855pp  · 178,507 words

.♦ With a helium-neon laser for alignment and high-voltage cells to polarize the photons, they sent the first message ever to be encoded by quantum cryptography. It was a demonstration of an information-processing task that could be effectively accomplished only via a quantum system. Quantum error correction, quantum teleportation, and

MIGHT SAY THIS IS THE REVENGE”: Interview, Charles Bennett, 27 October 2009. ♦ BENNETT AND HIS RESEARCH ASSISTANT: J. A. Smolin, “The Early Days of Experimental Quantum Cryptography,” IBM Journal of Research and Development 48 (2004): 47–52. ♦ “WE SAY THINGS SUCH AS ‘ALICE SENDS BOB’ ”: Barbara M. Terhal, “Is Entanglement Monogamous?” IBM

: Back Action 2006, AIP Conference Proceedings 864, edited by Debabrata Goswami. Melville, N.Y.: American Institute of Physics, 2006. Bennett, Charles H., and Gilles Brassard. “Quantum Cryptography: Public Key Distribution and Coin Tossing.” In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, 175–79. Bangalore, India: 1984. Bennett, Charles

, 1982. Smith, John Maynard. “The Concept of Information in Biology.” Philosophy of Science 67 (2000): 177–94. Smolin, J. A. “The Early Days of Experimental Quantum Cryptography.” IBM Journal of Research and Development 48 (2004): 47–52. Solana-Ortega, Alberto. “The Information Revolution Is Yet to Come: An Homage to Claude E

definition of frequency of, among numbers information-carrying capacity of interesting numbers and, 12.1, 12.2 mathematical proof of, 12.1, 12.2 in quantum cryptography recognition of, 12.1, 12.2, 12.3 statistical normality in tables of random numbers, 7.1, 12.1, 12.2 Ratio Club, 8.1

Crypto: How the Code Rebels Beat the Government Saving Privacy in the Digital Age

by Steven Levy  · 15 Jan 2002  · 468pp  · 137,055 words

: The Science of Information Integrity. New York: IEEE Press, 1992. Singh, Simon. The Code Book: The Evolution of Secrecy from Mary Queen of Scots to Quantum Cryptography. New York: Doubleday, 1999. Sterling, Bruce. The Hacker Crackdown. New York: Bantam, 1993. Wallace, Jonathan D., and Mark Mangan. Sex, Laws, and Cyberspace. New York

The Fabric of Reality

by David Deutsch  · 31 Mar 2012  · 511pp  · 139,108 words

public-key cryptography. This time it is not a matter of breaking an existing system, but of {217} implementing a new, absolutely secure system of quantum cryptography. In 1989, at IBM Research, Yorktown Heights, New York, in the office of the theoretician Charles Bennett, the first working quantum computer was built. It

for reading a message, {218} only the intended recipient can do that, and the guarantee of that is provided by the laws of physics. Because quantum cryptography depends on manipulating individual photons, it suffers from a major limitation. Each photon that is successfully received, carrying one bit of the message, must somehow

. Marketable systems may not be far away, but to solve the problem of public-key cryptography in general - say, for global communication - further advances in quantum cryptography are required. Experimental and theoretical research in the field of quantum computation is accelerating world-wide. Ever more promising new technologies for realizing quantum computers

computer A computer that could perform any computation that any other quantum computer could perform, and render any finite, physically possible environment in virtual reality. quantum cryptography Any form of cryptography that can be performed by quantum computers but not by classical computers. special-purpose quantum computer A quantum computer, such as

, Routledge, 1992. FURTHER READING John Barrow and Frank Tipler, The Anthropic Cosmological Principle, Clarendon Press, 1986. Charles H. Bennett, Gilles Brassard and Artur K. Ekert, 'Quantum Cryptography', Scientific American, October 1992. {367} Jacob Bronowski, The Ascent of Man, BBC Publications, 1981, Little Brown, 1976. Julian Brown, 'A Quantum Revolution for Computing', New

theory 334, 335 Pythagoras 226, 238 quantization 35�6, 54, 127 quantum computation see under computation quantum computers see under computers quantum cosmology 330, 335 quantum cryptography 218 quantum factorization engine 215�16, 217, 220 quantum gates 214 quantum mechanics ������and the 'butterfly effect' 202, 203 ������Copenhagen interpretation 327�8, 329, 335

The Mysterious Mr. Nakamoto: A Fifteen-Year Quest to Unmask the Secret Genius Behind Crypto

by Benjamin Wallace  · 18 Mar 2025  · 431pp  · 116,274 words

overview of the history of cryptography can be found in Simon Singh, The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography (New York: Doubleday Anchor, 2000). GO TO NOTE REFERENCE IN TEXT a remarkable discovery: Martin E. Hellman, “An Overview of Public Key Cryptography,” IEEE Communications

. GO TO NOTE REFERENCE IN TEXT the Caesar cipher [footnote]: Simon Singh, The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography (New York: Doubleday Anchor, 2000), 9–11, 17–19. GO TO NOTE REFERENCE IN TEXT The pioneering scholars: Frederick Mosteller and David L. Wallace, Inference

the New Code War (New York: Penguin, 2002), 313–30; Simon Singh, The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography (New York: Doubleday Anchor, 2000), 279–92. GO TO NOTE REFERENCE IN TEXT mentioning COINTELPRO: Mark Mazzetti, “Burglars Who Took on F.B.I. Abandon

Engineering Security

by Peter Gutmann

there and much of it will never really benefit anyone except the stockholders of the companies peddling it, if that. An example of this is quantum cryptography, a not-entirely-secure, short-range and above all extraordinarily expensive way of achieving what we’ve been doing using Diffie-Hellman key exchange since

signal demodulation equipment. A generalisation of this is the concept of tamper-evident pairing, which uses the same general principles as quantum key distribution from quantum cryptography. This works by exchanging information over a potentially public channel on which it’s possible to detect attempts to interfere with the exchange. If there

The Currency Cold War: Cash and Cryptography, Hash Rates and Hegemony

by David G. W. Birch  · 14 Apr 2020  · 247pp  · 60,543 words

-money could purchase – a useful feature for remittances or philanthropic donations’. That is only the tip of the iceberg, to my mind. An aside: post-quantum cryptography Much of the discussion about meta-technology here rests on the use of asymmetric cryptography (which uses public and private keys), which is at the

computation. One is quantum key distribution, or QKD. This exploits the quantum properties of physical systems, so it requires specialized hardware. The other is post-quantum cryptography, or PQC, which, as with existing forms of asymmetric cryptography, exploits the intractability of certain mathematical problems, so it can be implemented in hardware or

PBoC: People’s Bank of China PEPSI: Pan-European Payment System Initiative PIN: personal identification number Pseudonym: a persistent alias to an identity PQC: post-quantum cryptography SDR: special drawing right SEC: Securities and Exchange Commission SGA (Saga): a partially collateralized stablecoin SHC: synthetic hegemonic currency Sibos: The annual SWIFT banking conference

: https://bit.ly/2UabF2C. Chen, L., S. Jordan, Y.-K. Liu, D. Moody, R. Peralta, R. Perlner and D. Smith-Tone. 2016. Report on post-quantum cryptography. National Institute of Standards and Technology, April. Chen, Q. 2019. The good, the bad and the ugly of a Chinese state-backed digital currency. CNBC

Erwin Schrodinger and the Quantum Revolution

by John Gribbin  · 1 Mar 2012  · 287pp  · 87,204 words

years The triumph of entropy Chapter Fourteen: Schrödinger’s Scientific Legacy Hidden reality and a mathematician’s mistake The Bell test and the Aspect experiment Quantum cryptography and the “no cloning” theorem Quantum teleportation and classical information The quantum computer and the Multiverse Quantum physics and reality Postscript Sources and Further Reading

were ultimately proved wrong, but research partly stimulated by their quest has led quantum physics into the almost equally exotic realms of cryptography and teleportation. Quantum cryptography and the “no cloning” theorem One of the people who tried to devise a way to use entanglement to send messages faster than light was

by the Dutch physicist Dennis Dieks, that opened the way to the practical use of quantum entanglement to create uncrackable codes—quantum cryptography. There are several approaches to the problem of quantum cryptography, but they all depend on code systems that use a “key” of random numbers. The description here is adapted from my

’s home city of Vienna, a team of physicists headed by Anton Zeilinger (b. 1945) carried out the first electronic bank transfer of money using quantum cryptography to ensure the security of the data. This wasn’t just a casual experiment involving one physicist transferring a small amount into another physicist’s

. But all of these ideas pale in comparison with the most important practical application of entanglement, which uses the same technology that is needed for quantum cryptography and quantum teleportation. This is the development of the quantum computer, a practical proposition as “unbelievable,” in the sense used by John Bell that day

at a distance”; Thomson’s work; trajectory in cloud chamber; wave equation; waves and particles entanglement: decoherence; experimental confirmation of; FTL signalling; macroscopic; quantum computing; quantum cryptography; quantum teleportation; Rudolph’s work; Schrödinger’s work; term entropy EPR Paradox Epstein, Paul ETH (Eidgenössiche Technische Hochschule), see Zürich Ettinghausen, Andreas Everett, Hugh evolution

work; Clauser’s experiment; clones of; Compton’s work; Einstein’s work; entangled; green pamphlet on; light quanta; momentum; Planck’s work; polarization; quantum computing; quantum cryptography; quantum teleportation; Schrödinger’s work; Solvay Congress (1927); term photosynthesis Physica Physical Review Physical Review Letters Physics Physics and Beyond (Heisenberg) Physics Institute Physics World

Society proteins Prussian Academy quanta: Bohr’s work; Einstein’s work; light, see photons; Millikan’s experiments; Planck’s energy elements quantum chemistry quantum computers quantum cryptography quantum entanglement, see entanglement quantum jumps quantum mechanics: Aspect’s experiments; Bell’s work; Bohm’s work; Born and Jordan’s work; Copenhagen Interpretation; Cramer

theory Vedanta Vedral, Vlatko Vernam, Gilbert Vernam cipher Vienna: Allied occupation; art; blockade (1918–19); climate; Congress of (1913); history; Hitler’s entry; Nazism; physics; quantum cryptography; Schrödinger Archive; Schrödinger’s childhood; Schrödinger’s education; Schrödinger’s retirement; Schrödinger’s return to; social life; theatre Vienna, University of: Boltzmann’s work; Doppler

Cryptoassets: The Innovative Investor's Guide to Bitcoin and Beyond: The Innovative Investor's Guide to Bitcoin and Beyond

by Chris Burniske and Jack Tatar  · 19 Oct 2017  · 416pp  · 106,532 words

Beyond Weird

by Philip Ball  · 22 Mar 2018  · 277pp  · 87,082 words

Whiplash: How to Survive Our Faster Future

by Joi Ito and Jeff Howe  · 6 Dec 2016  · 254pp  · 76,064 words

The Bitcoin Standard: The Decentralized Alternative to Central Banking

by Saifedean Ammous  · 23 Mar 2018  · 571pp  · 106,255 words

Quantum Computing for Everyone

by Chris Bernhardt  · 19 Mar 2019  · 211pp  · 57,618 words

The Simulation Hypothesis

by Rizwan Virk  · 31 Mar 2019  · 315pp  · 89,861 words

Principles of Protocol Design

by Robin Sharp  · 13 Feb 2008

The Future of Money: How the Digital Revolution Is Transforming Currencies and Finance

by Eswar S. Prasad  · 27 Sep 2021  · 661pp  · 185,701 words

Dawn of the New Everything: Encounters With Reality and Virtual Reality

by Jaron Lanier  · 21 Nov 2017  · 480pp  · 123,979 words

The Age of Em: Work, Love and Life When Robots Rule the Earth

by Robin Hanson  · 31 Mar 2016  · 589pp  · 147,053 words

The Simpsons and Their Mathematical Secrets

by Simon Singh  · 29 Oct 2013  · 262pp  · 65,959 words

The Fifth Domain: Defending Our Country, Our Companies, and Ourselves in the Age of Cyber Threats

by Richard A. Clarke and Robert K. Knake  · 15 Jul 2019  · 409pp  · 112,055 words

Sunfall

by Jim Al-Khalili  · 17 Apr 2019  · 381pp  · 120,361 words

The Singularity Is Near: When Humans Transcend Biology

by Ray Kurzweil  · 14 Jul 2005  · 761pp  · 231,902 words

Age of Discovery: Navigating the Risks and Rewards of Our New Renaissance

by Ian Goldin and Chris Kutarna  · 23 May 2016  · 437pp  · 113,173 words

Possible Minds: Twenty-Five Ways of Looking at AI

by John Brockman  · 19 Feb 2019  · 339pp  · 94,769 words

The Patient Will See You Now: The Future of Medicine Is in Your Hands

by Eric Topol  · 6 Jan 2015  · 588pp  · 131,025 words

Frommer's New Mexico

by Lesley S. King  · 2 Jan 1999  · 420pp  · 219,075 words