This overview of the various cryptographic algorithms is a chronological history of cryptology, whose origins date back to the days of antiquity and which over time has undergone steady refinement of its methods. Please note that this table is by no means complete.
|c. 1900 BC||Non standard symbols were used in old Egypt.|
|c. 1500 BC||The Phoenicians developed an alphabet.|
|c. 1000 BC||Non standard symbols were used in old Mesopotamia.|
|c. 600 BC||In Palestine texts have been encrypted with the simple monoalphabetic substitution cipher Atbash.|
|c. 500 BC||Spartans (Greeks) encrypted messages using Scytale.|
|c. 400 BC||The Kamasutra described a monoalphabetic substitution cipher.|
|c. 200 BC||The Greek historian Polybius described his Polybius system for the first time.|
|c. 100-44 BC||Julius Caesar wrote confidential messages in the code named after him, the Caesar code. This is the most well-known of all the mono-alphabetic algorithms.|
|c. 500-1400 AD||The "dark age of cryptography" began in Europe: During this period cryptography was considered as black magic art and a lot of knowledge was lost. By contrast cryptography flourished in the Persian world.|
|855 AD||In the Arabic world the first book on cryptology appeared. Among other things, Abu 'Abd al-Raham al-Khahil ibn Ahmad ibn'Amr ibn Tammam al Farahidi al-Zadi al Yahamadi (Abu-Yusuf Ya’qub ibn Ishaq al-Kindi, called Al-Kindi) proudly described in his book the successful decryption of a Greek ciphertext that was intended for the Byzantine Emperor. His solution was based on frequency analysis and on known (correctly guessed) plaintext at the message start -- a standard cryptanalytic method, used even in WW-II against Enigma messages.|
|1379||When the pontifex Clement VII escaped to Avignion, he made his secretary Gabrieli di Lavinde (Parma) to develop a new code, which became the nomenclature code, a combination of substituting single letters of the alphabet and code words: He built a list of the most common words together with 2-letter substitutes. The words, that weren't on the list were encrypted with monoalphabetic substitution.
Due to its simplicity this nomenclature code was used over the next 450 years especially in diplomatic circles.
|1412||A 14-volume Arabic encyclopaedia also described cryptographic methods. Here, in addition to substitution and transposition, the method of repeated substitution applied to a plaintext character was mentioned the first time.|
|15th century||Boom of cryptology in Italy because of highly developed diplomatic life.|
|1466||Leon Battista Alberti, one of the leading figures of the Italian Renaissance, published his book "Modus scribendi in ziferas", in which the cipher wheels invented by him were mentioned for the first time. He also published the first polyalphabetic cipher. Alberti was secretary of an official body concerned with cryptographs (ciphers) at the papal court in Rome. He is known as the "father of cryptography".|
|1518||The first printed book on cryptology titled "Polygraphia libri sex", written by the abbot Johannes Trithemius, appeared in the German-speaking world. He also described polyalphabetic ciphers in the now-standard form of rectangular substitution tables.|
|1563||Giovanni Battista Porta published "De Furtivis Literarum Notis", a book describing encryption methods and cryptanalysis. In it the first digraph substitution cipher is mentioned.|
|End of 16th century||France got the lead in cryptanalysis.|
|1577||The brilliant Flemish code breaker Van Marnix wrote European history by decrypting a Spanish letter, which contained the plan, to conquer England by sending Spanish troops from the Netherlands.|
|1585||The 600-page book "Tractié de Chiffre" by the French diplomat, Blaise de Vigenère(Vigenere), appeared. He discovered the first working polyalphabetic system with autokey, called "Le chiffre indéchiffrable". Later the weaker Vigenère(Vigenere) code was named after him. This code is the most well-known of all the poly-alphabetic algorithms.
The autokey idea survived today e.g. in the DES CBC and CFB modes.
|1586||The Babington plot tried to kill the Queen Elisabeth I. of England and to replace her on the throne by Mary Stuart, Queen of Scotland.
Successful cryptanalysis by the "British secret service" enabled to get the six conspirators and to condemn Mary.
Mary communicated via letters with her conspirators. The bearer of the messages was a spy of Elisabeth: He made exact copies of the letters and sent them to Francis Walsingham, Elizabeth's secretary of state. Walsingham engaged Thomas Phelippes, a cipher and language expert, to decrypt the messages. Successful decryption revealed the plot against Elisabeth. But Walsingham additionally wanted the identity of the conspirators: He made Phelippes forge a postscript, and Mary added the enciphered names of the conspirators in her answer.
|17th century||The era of the black chambers began. Most governments had their own department with professional code breakers, who systematically broke the used nomenclature codes.|
|1623||Sir Francis Bacon described a method of steganography: To encode a message each letter of the plain text is replaced by a group of five of the letters 'A' or 'B' interspersed into normal text with different typeface. This is a forerunner of what today is called a 5-bit binary encoding.|
|1628||Jean Antoine Rossignol became the first full-time cryptanalyst being employed after his decryption of an hostile encoded message, which terminated the siege of Realmont by the Huguenots. Since then, cryptanalysts have always been a fixed element in military organizations.|
|1700||The Russian tsar used a big code table of 2000-3000 syllables and words to encrypt his messages.|
|1795||Thomas Jefferson developed the first cylindrical cipher device, known as the "wheel cipher". However, he never used it, so that it was forgotten, or rather never became public knowledge. This meant that cylindrical cipher devices were reinvented in a number of places in parallel.|
|1854||The English mathematics professor Charles Babbage invented a cylindrical cipher device, similar to the "wheel cipher". And he was the first to find a cryptanalytic way to break Vigenère's autokey cipher (the "unbreakable cipher" of the time) as well as the much weaker cipher that is called Vigenère cipher today: This did not become public until looking over his remains in the 20th century.|
|19th century||Cryptology found its way into literature: A.C. Doyle, J. Verne, E.A. Poe.|
|1854||The English physicist, Charles Wheatstone, invented a cipher which worked with a 5*5 matrix. His friend, Lord Lyon Playfair, Baron of St. Andrews, made this public in military and diplomatic circles in Victorian England, and thus it became known as the Playfair cipher.|
|1863||Friedrich Kasiski (1805-1881), a Prussian major, developed statistical methods of cryptanalysis that were able to decrypt the "unbreakable" Vigenère cipher.|
|1883||"La Cryptographie militaire" by Auguste Kerckhoffs von Nieuwendhoff appeared. This constituted a cryptographic milestone in the telegraph era. It contains the "principle of Kerckhoff", which requires to base the security of an encryption method only on the privacy of the key and not of the algorithm.|
|1891||The French major Etienne Bazeries invented a cylindrical device known as the Bazeries cylinder that was similar in principle to the wheel cipher. He published the design in 1901, after the French Army rejected it.|
|1917||The decryption of the Zimmermann telegram by the English secret service (room 40) prompted the critical entrance of the US at the side of the allies into World War I.|
|1917||The American, Gilbert S. Vernam, employee of AT&T, discovered and developed the one-time-pad, the only provably secure crypto system.|
|1918||The French cryptanalyst, Lieutenant Georges Painvin broke the ADFGVX cipher, which was put into service by the Germans near the end of World War I. This was a 2-step cipher which first performed a substitution (each letter was substitutes by a bigram through a keyed array), and then the bigrams were fractionated in columns and the columns transpositioned.|
|1918||Arthur Scherbius and Richard Ritter invented the first Enigma. At the same time the rotor cipher machine was invented and patented respectively by Alexander Koch (Netherlands) und Arvid Damm (Sweden).|
|1920||William F. Friedman (1891-1969), later to be honored as the father of US cryptanalysis, developed -- independently of Kasiski -- statistical methods for the cryptanalysis of the Vigenère cipher.|
|1921||The Californian Edward Hebern built the first cipher machine based on the rotor principle.|
|1922||Thomas Jefferson's wheel cipher was re-discovered in the US, further developed by the US Marines and was used during the Second World War.|
|1923||The Enigma rotor machine, developed by the German engineer Arthur Scherbius, was unveiled at the International Post Congress. The "Chiffriermaschinen AG" company was founded by Scherbius to market his Enigma around the world.|
|1929||Lester S. Hill published the article "Cryptography in an Algebraic Alphabet". The Hill cipher applied algebra (matrix multiplication) for encryption.|
|1940||Micro dots were used by German spies.|
|1940||Alan Turing broke the Enigma with the idea of his "bombs" building on work done by Marian Rejewski.|
|1941||The internal Japanese messages regarding the impending attack on Pearl Harbor was decrypted. This was due to the work of a team headed by William Frederick Friedman who broke the Japanese Purple machine.
Many historians believe that cryptanalysis shortened Second World War II by one year.
|1948/1949||Claude Shannon established the mathematical basis of information theory and published "Communication Theory of Secrecy Systems", where he also proved that all theoretically unbreakable ciphers must fulfill the same requirements as the one-time pad.|
|1973||David Elliott Bell and Len LaPadula developed the Bell-LaPadula model which formalizes the rules of access to classified information in order to achieve data confidentiality.|
|1973-1975||Ellis, Cocks and Williamson developed public-key encryption on behalf of the British government (GCHQ). This discovery was not publicly known until 1997.
Because these methods were independently and publicly redeveloped again by Diffie, Hellman, Rivest, Shamir and Adleman, they were considered the discoverers of public-key cryptography.
|1975||Diffie and Hellman described that public key procedures are theoretically possible, although they, in fact, set out to prove the opposite.|
|1976||Whitfield Diffie and Martin Hellman published the paper "New Directions in Cryptography". It introduced a radically new method of distributing cryptographic keys, which addressed one of the fundamental problems of cryptography, key distribution. This has become known as Diffie-Hellman key exchange protocol.|
|1977||The DES (Data Encryption Standard) invented by IBM in 1975 was chosen by NIST (FIPS PUB-46) as the US standard encryption algorithm.|
|1977||The RSA algorithm, named after its developers, Ronald Rivest, Adi Shamir and Leonard Adleman, was published. It was the first public key procedure used in practice and it ranks as the most innovative contribution of cryptologic research in the 20th century.|
|1979||The first ATMs (automatic teller machines) exploited DES in order to encrypt the PINs.|
|1982||The physician Richard Feynman developed the theoretical model of a quantum computer.|
|1984||Charles H. Bennett and Gilles Brassard described quantum cryptography (BB84 protocol).|
|1985||Goldwasser, Micali and Racoff unveiled the zero-knowledge procedure.|
|1986||Independently of each other, Neal Koblitz and Victor Miller proposed using elliptic curves for public key cryptography.|
|1991||Xueija Lai and James Massey developed the IDEA algorithm in Switzerland, which, for example, is used in the PGP cryptology software.|
|1991||DSA was chosen by NIST as the standard digital signature algorithm.|
|1991||PGP (Pretty Good Privacy) was developed by Phil Zimmermann as freeware and open source, in order to encrypt and exchange files highly securely. This was the first time that hybrid encryption (combination of symmetric and asymmetric cryptography) was applied within a program popular (even today) by end users. Main purpose was the encryption of email attachments (which later was covered too by the S/MIME standard).|
|1994||Peter Shor devised an algorithm to let quantum computers determine the factorization of large integers. This was the first interesting problem for which quantum computers promised a significant speed-up, and it therefore generated a lot of interest in quantum computers.|
|August 1994||The encryption protocol SSL 1.0 was published by Netscape Communications -- only 9 months after the first release of Mosaic 1.0, the first popular web browser. Meanwhile, SSL encryption is supported by all popular web browsers. However, the transport protocol SSL (TLS) is not restricted to the application HTTPS.|
|October 1995||S/MIME, a standard mechanism for secure email, was published as RFC 1847. In the meantime it is supported by all popular email clients. S/MIME (Secure/Multipurpose Internet Mail Extensions) described a consistent way to send and receive secure (signed and/or encrypted) emails. It is based on the popular Internet MIME standard. However, S/MIME is not restricted to mail.
S/MIME and SSL are the mostly used cryptographic protocols in the internet.
|July, 17, 1998||The EFF's DES cracker (Deep Crack) broke a DES key with a known-plaintext attack in 56 hours (DES challenge 2 by RSA Laboratories).|
|January, 19, 1999||Together, Deep Crack and distributed.net broke a DES key with a known-plaintext attack in 22 hours and 15 minutes (DES challenge 3 by RSA Laboratories).|
|October 2000||After public competition lasting for 5 years, the algorithm Rijndael was chosen by NIST as the successor of DES and is now called AES (Advanced Encryption Standard).|
|From about 2000||Weil Pairing was used for novel commitment schemes like IBE (identity based encryption, which turned out to be more interesting from a theoretical than from a practical point of view).|
|August 2004||At the Crypto 2004 conference, Chinese researchers showed structural weaknesses in common hash functions (MD5, SHA), which make them vulnerable to practical collision attacks. These hash functions are still used in almost all cryptographic protocols. The Chinese researchers didn't publish all the details.|
|May 2005||Jens Franke et al. factorized the 663 bit long number RSA-200.|
|April 2007||The wireless LAN encryption protocol WEP was broken by three researchers of the TU Darmstadt. Assuming enough data traffic in the network it takes only about two minutes to derive 95% of all used encryption keys.|
|August 2007||An algorithm to break the immobilizer system, used in millions of cars, was shown at the Crypto 2007 conference. During the presentation Eli Biham, Orr Dunkelman et al. could demonstrate an example where a corresponding car key was copied in 48 hours with the computing power of 50 PCs.|
|August 2007||The proprietary encryption algorithm A5/1, which is used by many GSM cellular carriers, was broken by David Hulton and Joshua Lackey. This implies that in affected mobile networks even the shortest voice calls or SMS messages can be easily encrypted by a normal PC, showing that "security by obscurity" is not a good approach.|
|December 2007||The authentification algorithm of the Mifare chip cards, which are used in thousands of applications by one billion issued cards, was broken. However the newest generation (Mifare DESFire), which uses DES/3-DES, is not affected.|
|December 2009||Chris Paget and Karsten Nohl announce, that the A5/1 Cracking Project build the 2 terabyte time-memory tradeoff attack tables for A5/1. A5/1 is definitely broken now.|
|December 2009||Jens Franke et al. factorized the 768 bit long number RSA-768.|
Cryptography News starting from 2002
The developments in the security sector since July 2002 are shown in detail on the Secorvo Security News website (German only).