Hostname: page-component-7c8c6479df-hgkh8 Total loading time: 0 Render date: 2024-03-28T06:56:01.511Z Has data issue: false hasContentIssue false

The perfect cipher

Published online by Cambridge University Press:  23 January 2015

Robert Edward Lewand*
Affiliation:
Goucher College, Baltimore, MD 21204 USA, e-mail: robert.lewand@goucher.edu

Extract

The history of cryptography is punctuated by the invention of clever systems to encipher messages and, sometime later, equally clever systems for cryptanalysing the enciphered messages to determine their meaning. Most enciphering schemes of any worth enjoy a relatively lengthy period of prominence before sufficiently determined cryptanalysts undermine their security by figuring out how to attack them. In response, cryptographers devise new and improved schemes and then the cycle repeats. Cryptographers have learned from history that it is dangerous to declare any enciphering scheme unbreakable; at best they are considered to be very secure. But there is one scheme, a scheme that has been around since 1917, that truly is unbreakable. It is the perfect cipher.

Type
Articles
Copyright
Copyright © The Mathematical Association 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Lewand, R., Cryptological mathematics, The Mathematical Association of America (2000).10.1090/clrm/016Google Scholar
2. Singh, S., The code book, Fourth Estate (1999).Google Scholar
3. Center for Cryptologic History, The Friedman legacy: A tribute to William and Elizabeth Friedman, National Security Agency (1992).Google Scholar
4. Beutelspacher, A., Cryptology, The Mathematical Association of America (1994).Google Scholar