Polyalphabetic cipher

From Wikipedia, the free encyclopedia

(Redirected from Polyalphabetic ciphers)
Jump to: navigation, search

A polyalphabetic cipher is any cipher based on substitution, using multiple substitution alphabets. The Vigenère cipher is probably the best-known example of a polyalphabetic cipher, though it is a simplified special case. The Enigma machine is more complex but still fundamentally a polyalphabetic substitution cipher.

The first published polyalphabetic cipher was invented by Leon Battista Alberti around 1467. Alberti used a Caesar cipher to encrypt a message, but whenever he wanted to he would switch to a different alphabet, indicating that he had done so by capitalizing the first letter encrypted with the new alphabet. Alberti also invented a decoder device, his encryption disk, which implemented a cipher equivalent to the one published later by Johannes Trithemius.

Johannes Trithemius, in a book published after his death, invented a progressive key polyalphabetic cipher. Unlike Alberti's cipher, which switched alphabets at random intervals, Trithemius switched alphabets for each letter of the message. He started with a tabula recta, a square with 26 alphabets in it (Trithemius, writing in Latin, used 24 alphabets). Each alphabet was shifted one letter to the left from the one above it, and started again with A after reaching Z (see image).

tabula recta

Trithemius's idea was to encipher the first letter of the message using the first shifted alphabet, so A became B, B became C, etc. The second letter of the message was enciphered using the second shifted alphabet, etc. Alberti's cipher disk implemented the same scheme. It had two alphabets, one on a fixed outer ring, and the other on the rotating disk. A letter is enciphered by looking for that letter on the outer ring, and encoding it as the letter underneath it on the disk. The disk started with A underneath B, and the user rotated the disk by one letter after encrypting each letter.

Trithemius' cipher was trivial to break, and Alberti's machine implementation not much more difficult. Key progression in both cases was poorly concealed from attackers. Even Alberti's implementation of his polyalphabetic cipher was rather easy to break (the capitalized letter is a major clue to the cryptanalyst). For most of the next several hundred years, the significance of using multiple substitution alphabets was missed by almost everyone. Polyalphabetic substitution cipher designers seem to have concentrated on obscuring the choice of a few such alphabets (repeating as needed), not on the increased security possible by using many and never repeating any.

The principle (particularly Alberti's unlimited additional substitution alphabets) was a major advance -- the most significant in the several hundred years since frequency analysis had been developed. A reasonable implementation would have been (and, when finally achieved, was) vastly harder to break. It was not until the mid-1800s (in Babbage's secret work during the Crimean War) and Friedrich Kasiski's generally equivalent public disclosure some years later, that cryptanalysis of well-implemented polyalphabetic ciphers got anywhere at all.


Although Alberti is usually considered the father of polyalphabetic cipher, Prof. Ibrahim A. Al-Kadi's 1990 paper ( ref- 2) to the Swedish Royal Institute of Technology in Stockholm regarding the Arabic contributions to cryptology reported (based on a recently discovered ancient script) the knowledge of polyalphabetic ciphers 500 years before Alberti.

Dr. Al-Kadi reported on the Arabic scientist by the name of Abu Yusuf Yaqub ibn Is-haq ibn as Sabbah ibn 'omran ibn Ismail Al-Kindi, who authored a book on cryptology the "Risalah fi Istikhraj al-Mu'amma" (Manuscript for the Deciphering Cryptographic Messages) circa 750 AD. Al-Kindi introduced cryptanalysis techniques (including those for polyalphabetic ciphers) , classification of ciphers, Arabic Phonetics and Syntax and most importantly described the use of several statistical techniques for cryptoanalysis. [This book apparently antedates other cryptology references by 300 years.] [It also predates writings on probability and statistics by Pascal and Fermat by nearly 800 years.]

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.