Partyfass > Other > The Code Book Read Online

Part 13 (1/2)

The Code Book Simon Singh 91410K 2022-07-22

Previous chapter List chapter Next page

encrypt To encipher or encode. To encipher or encode.

encryption algorithm Any general encryption process which can be specified exactly by choosing a key. Any general encryption process which can be specified exactly by choosing a key.

h.o.m.ophonic subst.i.tution cipher A cipher in which there are several potential subst.i.tutions for each plaintext letter. Crucially, if there are, say, six potential subst.i.tutions for the plaintext letter a, then these six characters can only represent the letter a. This is a type of monoalphabetic subst.i.tution cipher. A cipher in which there are several potential subst.i.tutions for each plaintext letter. Crucially, if there are, say, six potential subst.i.tutions for the plaintext letter a, then these six characters can only represent the letter a. This is a type of monoalphabetic subst.i.tution cipher.

key The element that turns the general encryption algorithm into a specific method for encryption. In general, the enemy may be aware of the encryption algorithm being used by the sender and receiver, but the enemy must not be allowed to know the key. The element that turns the general encryption algorithm into a specific method for encryption. In general, the enemy may be aware of the encryption algorithm being used by the sender and receiver, but the enemy must not be allowed to know the key.

key distribution The process of ensuring that both sender and receiver have access to the key required to encrypt and decrypt a message, while making sure that the key does not fall into enemy hands. Key distribution was a major problem in terms of logistics and security before the invention of public key cryptography. The process of ensuring that both sender and receiver have access to the key required to encrypt and decrypt a message, while making sure that the key does not fall into enemy hands. Key distribution was a major problem in terms of logistics and security before the invention of public key cryptography.

key escrow A scheme in which users lodge copies of their secret keys with a trusted third party, the escrow agent, who will pa.s.s on keys to law enforcers only under certain circ.u.mstances, for example if a court order is issued. A scheme in which users lodge copies of their secret keys with a trusted third party, the escrow agent, who will pa.s.s on keys to law enforcers only under certain circ.u.mstances, for example if a court order is issued.

key length Computer encryption involves keys which are numbers. The key length refers to the number of digits or bits in the key, and thus indicates the biggest number that can be used as a key, thereby defining the number of possible keys. The longer the key length (or the greater the number of possible keys), the longer it will take a crypta.n.a.lyst to test all the keys. Computer encryption involves keys which are numbers. The key length refers to the number of digits or bits in the key, and thus indicates the biggest number that can be used as a key, thereby defining the number of possible keys. The longer the key length (or the greater the number of possible keys), the longer it will take a crypta.n.a.lyst to test all the keys.

monoalphabetic subst.i.tution cipher A subst.i.tution cipher in which the cipher alphabet is fixed throughout encryption. A subst.i.tution cipher in which the cipher alphabet is fixed throughout encryption.

National Security Agency (NSA) A branch of the U.S. Department of Defense, responsible for ensuring the security of American communications and for breaking into the communications of other countries. A branch of the U.S. Department of Defense, responsible for ensuring the security of American communications and for breaking into the communications of other countries.

onetime pad The only known form of encryption that is unbreakable. It relies on a random key that is the same length as the message. Each key can be used once and only once. The only known form of encryption that is unbreakable. It relies on a random key that is the same length as the message. Each key can be used once and only once.

plaintext The original message before encryption. The original message before encryption.

polyalphabetic subst.i.tution cipher A subst.i.tution cipher in which the cipher alphabet changes during the encryption, for example the Vigenere cipher. The change is defined by a key. A subst.i.tution cipher in which the cipher alphabet changes during the encryption, for example the Vigenere cipher. The change is defined by a key.

Pretty Good Privacy (PGP) A computer encryption algorithm developed by Phil Zimmermann, based on RSA. A computer encryption algorithm developed by Phil Zimmermann, based on RSA.

private key The key used by the receiver to decrypt messages in a system of public key cryptography. The private key must be kept secret. The key used by the receiver to decrypt messages in a system of public key cryptography. The private key must be kept secret.

public key The key used by the sender to encrypt messages in a system of public key cryptography. The public key is available to the public. The key used by the sender to encrypt messages in a system of public key cryptography. The public key is available to the public.

public key cryptography A system of cryptography which overcomes the problems of key distribution. Public key cryptography requires an asymmetric cipher, so that each user can create a public encryption key and a private decryption key. A system of cryptography which overcomes the problems of key distribution. Public key cryptography requires an asymmetric cipher, so that each user can create a public encryption key and a private decryption key.

quantum computer An immensely powerful computer that exploits quantum theory, in particular the theory that an object can be in many states at once (superposition), or the theory that an object can be in many universes at once. 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. An immensely powerful computer that exploits quantum theory, in particular the theory that an object can be in many states at once (superposition), or the theory that an object can be in many universes at once. 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. 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 system that fitted the requirements of public key cryptography, invented by Ron Rivest, Adi Shamir and Leonard Adleman in 1977. The first system that fitted the requirements of public key cryptography, invented by Ron Rivest, Adi Shamir and Leonard Adleman in 1977.

steganography The science of hiding the existence of a message, as opposed to cryptography, which is the science of hiding the meaning of a message. The science of hiding the existence of a message, as opposed to cryptography, which is the science of hiding the meaning of a message.

subst.i.tution cipher A system of encryption in which each letter of a message is replaced with another character, but retains its position within the message. A system of encryption in which each letter of a message is replaced with another character, but retains its position within the message.

symmetric key cryptography A form of cryptography in which the key required for encrypting is the same as the key required for decrypting. The term describes all traditional forms of encryption, i.e. those in use before the 1970s. A form of cryptography in which the key required for encrypting is the same as the key required for decrypting. The term describes all traditional forms of encryption, i.e. those in use before the 1970s.

transposition cipher A system of encryption in which each letter of a message changes its position within the message, but retains its ident.i.ty. A system of encryption in which each letter of a message changes its position within the message, but retains its ident.i.ty.

Vigenere cipher A polyalphabetic cipher which was developed around 1500. The Vigenere square contains 26 separate cipher alphabets, each one a Caesar-s.h.i.+fted alphabet, and a keyword defines which cipher alphabet should be used to encrypt each letter of a message. A polyalphabetic cipher which was developed around 1500. The Vigenere square contains 26 separate cipher alphabets, each one a Caesar-s.h.i.+fted alphabet, and a keyword defines which cipher alphabet should be used to encrypt each letter of a message.

Acknowledgments.

While writing this book I have had the privilege of meeting some of the world's greatest living codemakers and codebreakers, ranging from those who worked at Bletchley Park to those who are developing the ciphers that will enrich the Information Age. I would like to thank Whitfield Diffie and Martin h.e.l.lman, who took the time to describe their work to me while I was in sunny California. Similarly, Clifford c.o.c.ks, Malcolm Williamson and Richard Walton were enormously helpful during my visit to cloudy Cheltenham. In particular, I am grateful to the Information Security Group at Royal Holloway College, London, who allowed me to attend the M.Sc. course on information security. Professor Fred Piper, Simon Blackburn, Jonathan Tuliani, and Fauzan Mirza all taught me valuable lessons about codes and ciphers.

While I was in Virginia, I was fortunate to be given a guided tour of the Beale treasure trail by Peter Viemeister, an expert on the mystery. Furthermore, the Bedford County Museum and Stephen Cowart of the Beale Cypher and Treasure a.s.sociation helped me to research the subject. I am also grateful to David Deutsch and Michele Mosca of the Oxford Centre for Quantum Computation, Charles Bennett and his research group at IBM's Thomas J. Watson Laboratories, Stephen Wiesner, Leonard Adleman, Ronald Rivest, Paul Rothemund, Jim Gillogly, Paul Leyland and Neil Barrett.

Derek Taunt, Alan Stripp and Donald Davies kindly explained to me how Bletchley Park broke Enigma, and I was also helped by the Bletchley Park Trust, whose members regularly give enlightening lectures on a variety of topics. Dr. Mohammed Mrayati and Dr. Ibrahim Kadi have been involved in revealing some of the early breakthroughs in Arab crypta.n.a.lysis, and were kind enough to send me relevant doc.u.ments. The periodical Cryptologia Cryptologia also carried articles about Arabian crypta.n.a.lysis, as well as many other cryptographic subjects, and I would like to thank Brian Winkel for sending me back issues of the magazines. also carried articles about Arabian crypta.n.a.lysis, as well as many other cryptographic subjects, and I would like to thank Brian Winkel for sending me back issues of the magazines.

I would encourage readers to visit the National Cryptologic Museum near Was.h.i.+ngton, D.C. and the Cabinet War Rooms in London, and I hope that you will be as fascinated as I was during my visits. Thank you to the curators and librarians of these museums for helping me with my research. When I was pressed for time, James Howard, Bindu Mathur, Pretty Sagoo, Anna Singh and Nick Shearing all helped me to uncover important and interesting articles, books and doc.u.ments, and I am grateful to them for their efforts. Thanks also go to Antony Buonomo at librarians of these museums for helping me with my research. When I was pressed for time, James Howard, Bindu Mathur, Pretty Sagoo, Anna Singh and Nick Shearing all helped me to uncover important and interesting articles, books and doc.u.ments, and I am grateful to them for their efforts. Thanks also go to Antony Buonomo at plete bibliography nor a definitive reference list. Instead, it merely includes material that may be of interest to the general reader. Of all the books I have come across during my research, I would like to single out one in particular: The Codebreakers The Codebreakers by David Kahn. This book doc.u.ments almost every cryptographic episode in history, and as such it is an invaluable resource. by David Kahn. This book doc.u.ments almost every cryptographic episode in history, and as such it is an invaluable resource.

Various libraries, inst.i.tutions and individuals have provided me with photographs. All the sources are listed in the picture credits, but particular thanks go to Sally McClain, for sending me photographs of the Navajo code talkers; Professor Eva Brann, for discovering the only known photo of Alice Kober; Joan Chadwick, for sending me a photo of John Chadwick; and Brenda Ellis, for allowing me to borrow photos of James Ellis. Thanks also go to Hugh Whitemore, who gave me permission to use a quote from his play Breaking the Code Breaking the Code, based on Andrew Hodges' book Alan Turing-The Enigma Alan Turing-The Enigma.

On a personal note, I would like to thank friends and family who put up with me over the two years while I was writing this book. Neil Boynton, Dawn Dzedzy, Sonya Holbraad, Tim Johnson, Richard Singh and Andrew Thompson all helped me to keep sane while I was struggling with convoluted cryptographic concepts. In particular, Bernadette Alves supplied me with a rich mixture of moral support and perceptive criticism. Traveling back in time, thanks also go to all the people and inst.i.tutions that have shaped my career, including Wellington School, Imperial College and the High Energy Physics Group at Cambridge University; Dana Purvis, at the BBC, who gave me my first break in television; and Roger Highfield, at the Daily Telegraph Daily Telegraph, who encouraged me to write my first article.

Finally, I have had the enormous good fortune to work with some of the best people in publis.h.i.+ng. Patrick Walsh is an agent with a love of science, a concern for his authors and a boundless enthusiasm. He has put me in touch with the kindest and most capable publishers, most notably Fourth Estate, whose staff endure my constant stream of queries with great spirit. Last, but certainly not least, my editors, Christopher Potter, Leo Hollis and Peternelle van Arsdale, have helped me to steer a clear path through a subject that twists and turns its way across three thousand years. For that I am tremendously grateful.

Also by Simon Singh

Fermat's Enigma