CONTENT

•	INTRODUCTION TO CRYPTOGRAPHY
•	PURPOSE OF CRYPTOGRAPHY
•	ENCRYPTION
•	BASICS OF ENCRYPTION
•	WHAT IS KEYS?
•	TYPES OF KEYS
•	CRYPTOGRAPHY ALGORITHMS
•	RSA
•	RAIL FENCE 
•	SHIFT SUBSTITUTE
•	BLOWFISH

ABSTRACT

            

           

CRYPTOGRAPHY
                                                    
INTRODUCTION

 In modern world, where computers connect millions of people either for social or business purposes, we need security systems that will ensure the integrity of these communication and transactions. Have you ever thought of how secure is your business transaction or even thought of a confidential communication? Then we need to get a clear definition of cryptography. Cryptography is one of the most essential parts of secure communications ranging from the private communications to business transactions we make with different people at different points of the globe. Cryptography helps in ensuring the protection of passwords from any individual who wants to break in ,also Cryptography is the practice an study of techniques for secure communication In the presence of third parties (called adversaries).More generally ,it is about constructing  and analyzing protocols that overcome the influence of adversaries and which are related to various  aspects in information security such as data confidentiality,data integrity,authenciation.Modern cryptography intersects the disciplines of mathematics ,computer science and electrical engineering. Application of cryptography include ATM cards,computer passwords,and electronic commerce.
Cryptography prior to the modern age was effectively synonymous with encryption ,the conversion of information from a readable state to apparent nonsense.The originator of an encrypted message shared the decoding technique needed to recover the original information only with intended recipients, thereby precluding unwanted persons to do the same. Since World War I and the advent of the computer, the methods used to carry out cryptology have become increasingly complex and its application more widespread.
Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in practice by any adversary. It is theoretically possible to break such a system but it is infeasible to do so by any known practical means. These schemes are therefore termed computationally secure; theoretical advances, e.g., improvements in integer factorization algorithms, and faster computing technology require these solutions to be continually adapted. There exist information-theoretically secure schemes that provably cannot be broken even with unlimited computing power—an example is the one-time pad—but these schemes are more difficult to implement than the best theoretically breakable but computationally secure mechanisms.

       

Do you know that Cryptography is an ancient way of secret codes or numbers used for a very long time? The definition of cryptography was fist documented in 1900 BC and experts believe that cryptography was in use shortly after the invention of writing and counting. In modern world, cryptography serves in different and varied purposes.

. For Authentication Purpose
In Communication, the primary form of identification that is used is the system of name-to-name identity considered rather week in instances where different people have the same name therefore confusing the identity of these people. Cryptography ensures that the purpose of proving one’s identity maintained through some secret codes.

II. The Purpose of Confidentiality
Human beings need to communicate and communication should be confidential and free from intruders. You can achieve this by using some secret codes that can only identify you as its user.

III. The Purpose of Integrity
In each communication or business transaction integrity is important as it assures the receiver that the message is original and nobody altered it. Cryptography helps to achieve this.

IV.  The Purpose of Non-Repudiation
This purpose best serves business transactions and messages. The sender cannot deny sending a message that the receiver has already received. For example, an official in a business firm cannot deny sending a message to the financial officer of that firm requesting for increments of finances.

    Cryptographic Algorithms

Cryptographic codes have different ways of classification defined. Below cryptography categories based on keys used in encryption and decryption.

 Cryptography of Secret Keys

In this category, one known key to both the sender and the receiver of the message is used. The sender sends a message applying a code that the receiver will use to recover the message. Learn more about cryptography secret keys.

 Cryptography of Public Key
	
In this category, two parties can make a secure communication over a non-secure device and not using the same code. Its usage depends on the existence of one way functions invented about 400 years ago. 

 Cryptography of Hash Function 

In this category, fixed lengths of hash values entered ensure the maintenance of the integrity of the communication. The values make it difficult for an intended intruder to break in.

                   

                           ENCRYTION

Encryption is a concept that has become commonplace with the proliferation of home wireless networks, where one wants to keep information from being understood by everyone. Actually, encryption has been around for centuries. One of the earliest examples is the Caesar Cipher, named after Julius Caesar. This substitution encryption process had an individual take the alphabet and shift the characters over a certain number based off of an algorithm. Thus, if the result was five characters to the right, an "a" would be treated as "f", "c" a "h", etc.
	
Basics of Encryption
Encryption takes a series of algorithms, or mathematical statements, to scramble data from its original format into one undecipherable. The initial information is called plaintext, which has encryption applied to it and results in ciphertext. Ciphertext cannot be understood under normal conditions without the reverse, or decryption, applied to the ciphertext. When reversed, one is left with plaintext.
PURPOSE OF CRYPTOGRAPHY
Cryptography is the science of writing in secret code and is an ancient art; the first documented use of cryptography in writing dates back to circa 1900 B.C. when an Egyptian scribe used non-standard hieroglyphs in an inscription. Some experts argue that cryptography appeared spontaneously sometime after writing was invented, with applications ranging from diplomatic missives to war-time battle plans. It is no surprise, then, that new forms of cryptography came soon after the widespread development of computer communications. In data and telecommunications, cryptography is necessary when communicating over any untrusted medium, which includes just about any network, particularly the Internet.
Within the context of any application-to-application communication, there are some specific security requirements, including:
•	Authentication: The process of proving one's identity. (The primary forms of host-to-host authentication on the Internet today are name-based or address-based, both of which are notoriously weak.)
•	Privacy/confidentiality: Ensuring that no one can read the message except the intended receiver.
•	Integrity: Assuring the receiver that the received message has not been altered in any way from the original.
•	Non-repudiation: A mechanism to prove that the sender really sent this message.
Cryptography, then, not only protects data from theft or alteration, but can also be used for user authentication. There are, in general, three types of cryptographic schemes typically used to accomplish these goals: secret key (or symmetric) cryptography, public-key (or asymmetric) cryptography, and hash functions, each of which is described below. In all cases, the initial unencrypted data is referred to as plaintext. It is encrypted into ciphertext, which will in turn (usually) be decrypted into usable plaintext.
In many of the descriptions below, two communicating parties will be referred to as Alice and Bob; this is the common nomenclature in the crypto field and literature to make it easier to identify the communicating parties. If there is a third or fourth party to the communication, they will be referred to as Carol and Dave. Mallory is a malicious party, Eve is an eavesdropper, and Trent is a trusted third party.

            

                                                  
What is a Key?
In cryptography, a key is the information needed to take data from one format to another. In the case of the Caesar Cipher, the key would be the knowledge that you have to shift five characters right in the alphabet to decode a message. With modern encryption schemes, a file contains information needed to encrypt or decrypt information.

KEYS USED IN CRYPTOGRAPHY
1. PUBLIC KEY
2. PRIVATE KEY
3. SHARED KEY
Public-key cryptography uses asymmetric key algorithms and can also be referred to by the more generic term "asymmetric key cryptography." The algorithms used for public key cryptography are based on mathematical relationships (the most notable ones being the integer factorization and discrete logarithm problems) that presumably have no efficient solution. Although it is computationally easy for the intended recipient to generate the public and private keys, to decrypt the message using the private key, and easy for the sender to encrypt the message using the public key, it is extremely difficult (or effectively impossible) for anyone to derive the private key, based only on their knowledge of the public key. This is why, unlike symmetric key algorithms, a public key algorithm does not require a secure initial exchange of one (or more) secret keys between the sender and receiver. The use of these algorithms also allows the authenticity of a message to be checked by creating a digital signature of the message using the private key, which can then be verified by using the public key. In practice, only a hash of the message is typically encrypted for signature verification purpose.
Public-key cryptography is widely used. It is an approach used by many cryptographic algorithms .

                                     HOW IT’S WORK?

The distinguishing technique used in public-key cryptography is the use of asymmetric key algorithms, where the key used to encrypt a message is not the same as the key used to decrypt it. Each user has a pair of cryptographic keys – a public encryption key and a private decryption key. The publicly available encrypting-key is widely distributed, while the private decrypting-key is known only to its proprietor. The keys are related mathematically, but the parameters are chosen so that calculating the private key from the public key is either impossible or prohibitively expensive.
In contrast, symmetric-key algorithms – variations of which have been used for thousands of years – use a single secret key, which must be shared and kept private by both the sender and the receiver, for both encryption and decryption. To use a symmetric encryption scheme, the sender and receiver must securely share a key in advance.
Because symmetric key algorithms are nearly always much less computationally intensive than asymmetric ones, it is common to exchange a key using a key-exchange algorithm, then transmit data using that key and a symmetric key algorithm. PGP and the SSL/TLS family of schemes use this procedure, and are thus called hybrid cryptosystems.                               

MAIN USE OF PUBLIC KEY
•	Public-key encryption, in which a message is encrypted with a recipient's public key. The message cannot be decrypted by anyone who does not possess the matching private key, who is thus presumed to be the owner of that key and the person associated with the public key. This is used in an attempt to ensure  it confidently.

•	An analogy to public-key encryption is that of a locked mail box with a mail slot. The mail slot is exposed and accessible to the public – its location (the street address) is, in essence, the public key. Anyone knowing the street address can go to the door and drop a written message through the slot. However, only the person who possesses the key can open the mailbox and read the message.

•	A central problem with the use of public-key cryptography is confidence/proof that a particular public key is authentic, in that it is correct and belongs to the person or entity claimed, and has not been tampered with or replaced by a malicious third party.

PRIVATE KEY
Private key involves using the same key for encryption and decryption.

Encryption involves applying an operation (an algorithm) to the data to be encrypted using the private key to make them unintelligible. The slightest algorithm (such as an exclusive OR) can make the system nearly tamper proof (there being so such thing as absolute security).
However, in the 1940s, Claude Shannon proved that to be completely secure, private-key systems need to use keys that are at least as long as the message to be encrypted. Moreover, symmetric encryption requires that a secure channel be used to exchange the key, which seriously diminishes the usefulness of this kind of encryption system.
The main disadvantage of a secret-key cryptosystem is related to the exchange of keys. Symmetric encryption is based on the exchange of a secret (keys). The problem of key distribution therefore arises:
Moreover, a user wanting to communicate with several people while ensuring separate confidentiality levels has to use as many private keys as there are people. For a group of N people using a secret-key cryptosystem, it is necessary to distribute a number of keys equal to N * (N-1) / 2.
In the 1920s, Gilbert Vernam and Joseph Mauborgne developed the One-Time Pad method (sometimes called "One-Time Password" and abbreviated OTP), based on a randomly generated private key that is used only once and is then destroyed. During the same period, the Kremlin and the White House were connected by the famous red telephone, that is, a telephone where calls were encrypted thanks to a private key according to the one-time pad method. The private key was exchanged thanks to the diplomatic bag (playing the role of secure channel).

                   ALGORITHMS

>RSA ( Rivest Shamir Adleman.)
>BLOWFISH
>SHIFT SUBSTITUTE
>RAIL FENCE

What is RSA?

•	Public key algorithm invented in 1977 by Ron Rivest, Adi Shamir and Leonard Adleman (RSA).
•	Supports Encryption and Digital Signatures.
•	Most widely used public key algorithm.
•	Gets its security from integer factorization problem.
•	Relatively easy to understand and implement.
•	Patent free (since 2000).

RSA Usage

•	RSA is used in security protocols such as;
  IPSEC/IKE              - IP data security

 TLS\SSL                  -transport data   
 SECURITY(WEB)

PGP                          - email security 

SSH                       - terminal connection   
                                   SECURITY
SILC                       - conferencing 
                                Service security

RSA Security

 􀀀
•	RSA gets its security from factorization problem. Difficulty of factoring large numbers is the    basis of security of RSA. Over1000 bits long numbers are used.

•	Integer factorization problem (finding number's prime factors):

Positive integer n, find its prime factors: n = p1 p2 ... pi where
pi is positive distinct prime number
Example: 257603 = 41 * 61 * 103
Factorization algorithms can be used (attempted at least) to
factor faster than brute forcing: Trial division, Pollard's rho,
Pollard's p-1, Quadratic sieve, elliptic curve factorization,
Random square factoring, Number field sieve, etc.     

BLOWFISH                                              

DESCRIPTION OF BLOWFISH

The Blowfish block cipher was designed by Bruce Schneier and first published in Fast Software Encryption '93. It encrypts a 64 bit block under the control of a key, which can range in size from 0 to 448 bits (in increments of 8). Blowfish quickly became very popular, largely due to its excellent performance in software, and its patent-free status. Most other alternatives at the time, such as DES, TripleDES,IDEA, and FEAL, suffered from either poor performance (DES, TripleDES), IP entanglements (IDEA, FEAL), or less than great security (DES, FEAL).
Blowfish, in a sense, was the origin of the AES process that ended with the Rijndael algorithm becoming the official replacement for DESin the U.S. government (for securing non-classified data). In the FSE paper, Schneier suggested that the world needed a highly secure, IP-free algorithm to be used for high security applications in the 21st century. Ironically, Schneier's own AES candidate, Twofish, was beaten in the AES competition.
As to how it works. Blowfish initializes 5 tables: S{1,2,3,4}, each of which contains 256 32-bit values, and also P, which contains 18 32-bit values, using a (rather inelegant) PRNG based off of the encryption routine.
The algorithm uses the big-endian convention, and splits it's 64 bit input into two 32-bit words, called L and R (the left and right halves). Arrays are accessed using 0-based indicies.
For i = 0 to 15:
   L = L XOR P[i]
   R = F(L) XOR R
   Swap L and R
Swap L and R (Undo the last swap)
R = R XOR P[16]
L = L XOR P[17]
The F function used above is defined as:
F(L) = ((S1[L0] + S2[L1] mod 232) XOR S1[L2]) + S4[L3] mod 232

Where L0, L1, L2, and L3 are the four bytes of L (L0 being the first, or most significant, byte and L3 being the least significant). In an actual implementation you wouldn't do the swaps: instead the code will unroll the loop at least once and maybe twice.
Even after 10 years, Blowfish is still considered quite secure. The only attack (that I know of) was published by Serge Vaudeney in his PhD thesis, which showed that certain keys were "weak" in the sense that they could be distinguished from other keys. Given that even this attack only works if you reduce the number of rounds from 16 to 14, it is quite safe to say that there is no publicly known attacks on Blowfish which might concern potential or current users of the algorithm. Given this track record, and the general structure of the algorithm, it highly unlikely that any serious attacks will be developed anytime within the next 10 years (at least in this amateurcryptographer's opinion).
While secure and quite fast, Blowfish is not perfect. For one thing, the block size is only 64 bits long. These days, that raises a number of concerns, which is why almost all new ciphers use blocks at least 128 bits in length. Basically, the problem is that there are a number of quite general collision attacks possible on things using block ciphers (like CBC mode), and a 64 bit block means these attacks can work with 232 complexity (that's bad). In addition, changing the key that Blowfish uses to encrypt involves as much work as encrypting 521 blocks, which is quite substantial. Most block ciphers take about as much time to run the key schedule as it takes to encrypt a single block. The term for this property of Blowfish is low key agility.
While Blowfish is very fast in software, it requires the use of at least 4K of RAM, which is very expensive in hardware (compared to something like DES or even IDEA) or in memory constrained environments (like smartcards). More recent ciphers, like Rijndael and Serpent, are easier on hardware resources. Many other ciphers allow various speed/memory tradeoffs in software, and in a standard issue CPU, a few extra kilobytes of memory is not a problem. But with Blowfish, you have to have that 4K of memory, and that's bad. DES, for example, can be implemented using just a few hundred bits of memory (probably just registers).

                 
ATTACKS ON BLOWFISH

Blowfish is known to be susceptible to attacks on reflectively weak keys. This means Blowfish users must carefully select keys as there is a class of keys known to be weak, or switch to more modern alternatives like the Advanced Encryption Standard, Salsa20, or Blowfish's more modern successors Twofish and Threefish. Bruce Schneier, Blowfish's creator, is quoted in 2007 as saying "At this point, though, I'm amazed it's still being used. If people ask, I recommend Twofish instead.

BLOWFISH ON PRACTICE

Blowfish is a fast block cipher, except when changing keys. Each new key requires pre-processing equivalent to encrypting about 4 kilobytes of text, which is very slow compared to other block ciphers. This prevents its use in certain applications, but is not a problem in others. In one application, it is actually a benefit: the password-hashing method used in OpenBSD uses an algorithm derived from Blowfish that makes use of the slow key schedule; the idea is that the extra computational effort required gives protection against dictionary attacks. See key stretching.
Blowfish has a memory footprint of just over 4 kilobytes of RAM. This constraint is not a problem even for older desktop and laptop computers, though it does prevent use in the smallestembedded systems such as early smartcards.
Blowfish was one of the first secure block ciphers not subject to any patents and therefore freely available for anyone to use. This benefit has contributed to its popularity in cryptographic software.

SHIFT SUBSTITUTION

In cryptography, a shift substitution is a method of encoding by which units of plaintext are replaced with ciphertext, according to a regular system; the "units" may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing an inverse substitution.	
There are a number of different types of substitution cipher. If the cipher operates on single letters, it is termed a simple substitution cipher; a cipher that operates on larger groups of letters is termed polygraphic. A monoalphabetic cipher uses fixed substitution over the entire message, whereas a polyalphabetic cipher uses a number of substitutions at different positions in the message, where a unit from the plaintext is mapped to one of several possibilities in the ciphertext and vice versa.

SIMPLE SUBSTITUTION
Substitution of single letters separately—simple substitution—can be demonstrated by writing out the alphabet in some order to represent the substitution. This is termed a substitution alphabet. The cipher alphabet may be shifted or reversed (creating the Caesarand Atbash ciphers, respectively) or scrambled in a more complex fashion, in which case it is called a mixed alphabet.Traditionally, mixed alphabets may be created by first writing out a keyword, removing repeated letters in it, then writing all the remaining letters in the alphabet in the usual order.
Using this system, the keyword "zebras" gives us the following alphabets:
Plaintext alphabet:	ABCDEFGHIJKLMNOPQRSTUVWXYZ	
Ciphertext alphabet:	ZEBRASCDFGHIJKLMNOPQTUVWXY	
A message of
flee at once. we are discovered!
enciphers to
SIAA ZQ LKBA. VA ZOA RFPBLUAOAR!

The ciphertext alphabet is sometimes different from the plaintext alphabet; for example, in the pigpen cipher, the ciphertext consists of a set of symbols derived from a grid. For example:

Such features make little difference to the security of a scheme, however – at the very least, any set of strange symbols can be transcribed back into an A-Z alphabet and dealt with as normal.
In lists and catalogues for salespeople, a very simple encryption is sometimes used to replace numeric digits by letters.
Plain digits:	1234567890	
               CIPHERTEXT ALPHABET:  make profit

Example: MAT would be used to represent 120
SECURITY FOR SUBSTITUTION CIPHER

A disadvantage of this method of derangement is that the last letters of the alphabet (which are mostly low frequency) tend to stay at the end. A stronger way of constructing a mixed alphabet is to perform a columnar transposition on the ordinary alphabet using the keyword, but this is not often done.
Although the number of possible keys is very large (26! ≈ 288.4, or about 88 bits), this cipher is not very strong, and is easily broken. Provided the message is of reasonable length (see below), the cryptanalyst can deduce the probable meaning of the most common symbols by analyzing the frequency distribution of the ciphertext—frequency analysis. This allows formation of partial words, which can be tentatively filled in, progressively expanding the (partial) solution (see frequency analysis for a demonstration of this). In some cases, underlying words can also be determined from the pattern of their letters; for example, attract, osseous, and words with those two as the root are the only common English words with the pattern ABBCADB. Many people solve such ciphers for recreation, as with cryptogram puzzles in the newspaper.
According to the unicity distance of English, 27.6 letters of ciphertext are required to crack a mixed alphabet simple substitution. In practice, typically about 50 letters are needed, although some messages can be broken with fewer if unusual patterns are found. In other cases, the plaintext can be contrived to have a nearly flat frequency distribution, and much longer plaintexts will then be required by the user.

TYPES OF SUBSTITUTION

•	HOMOPHONIC SUBSTITUTION
•	POLYALPHABETIC SUBSTITUTION
•	POLYGRAPHIC SUBSTITUTION

1.	HOMOPHONIC SUBSTITUTION
  An early attempt to increase the difficulty of frequency analysis attacks on substitution ciphers was to disguise plaintext letter frequencies byhomophony. In these ciphers, plaintext letters map to more than one ciphertext symbol. Usually, the highest-frequency plaintext symbols are given more equivalents than lower frequency letters. In this way, the frequency distribution is flattened, making analysis more difficult.
Since more than 26 characters will be required in the ciphertext alphabet, various solutions are employed to invent larger alphabets. Perhaps the simplest is to use a numeric substitution 'alphabet'. Another method consists of simple variations on the existing alphabet; uppercase, lowercase, upside down, etc. More artistically, though not necessarily more securely, some homophonic ciphers employed wholly invented alphabets of fanciful symbols.
An interesting variant is the nomenclator. Named after the public official who announced the titles of visiting dignitaries, this cipher combined a smallcodebook with large homophonic substitution tables. Originally the code was restricted to the names of important people, hence the name of the cipher; in later years it covered many common words and place names as well. The symbols for whole words (codewords in modern parlance) and letters (cipher in modern parlance) were not distinguished in the ciphertext. The Rossignols' Great Cipher used by Louis XIV of France was one; after it went out of use, messages in French archives were unbroken for several hundred years.
Nomenclators were the standard fare of diplomatic correspondence, espionage, and advanced political conspiracy from the early fifteenth century to the late eighteenth century; most conspirators were and have remained less cryptographically sophisticated. Although government intelligencecryptanalysts were systematically breaking nomenclatures by the mid-sixteenth century, and superior systems had been available since 1467, the usual response to cryptanalysis was simply to make the tables larger. By the late eighteenth century, when the system was beginning to die out, some Nomenclators  had 50,000 symbols.
Nevertheless, not all nomenclators were broken; today, cryptanalysis of archived ciphertexts remains a fruitful area of historical research.
The Beale Ciphers are another example of a homophonic cipher. This is a fascinating story of buried treasure that was described in the 1819-21 period by use of a ciphered text that was keyed to the Declaration of Independence. Here each ciphertext character was represented by a number. The number was determined by taking the plaintext character and finding a word in the Declaration of Independence that started with that character and using the numerical position of that word in the Declaration of Independence as the encrypted form of that letter. Since many words in the Declaration of Independence start with the same letter, the encryption of that character could be any of the numbers associated with the words in the Declaration of Independence that start with that letter. Deciphering the encrypted text character X (which is a number) is as simple as looking up the Xth word of the Declaration of Independence and using the first letter of that word as the decrypted character.

2.	POLYALPHABETIC SUBSTITUTION

Polyalphabetic substitution ciphers were first described in 1467 by Leone Battista Alberti in the form of disks. Johannes Trithemius, in his book Steganographia (Ancient Greek for "hidden writing") introduced the now more standard form of a tableau (see below; ca. 1500 but not published until much later). A more sophisticated version using mixed alphabets was described in 1563 by Giovanni Battista della Porta in his book, De Furtivis Literarum Notis (Latin for "On concealed characters in writing").
In a polyalphabetic cipher, multiple cipher alphabets are used. To facilitate encryption, all the alphabets are usually written out in a large table, traditionally called a tableau. The tableau is usually 26×26, so that 26 full ciphertext alphabets are available. The method of filling the tableau, and of choosing which alphabet to use next, defines the particular polyalphabetic cipher. All such ciphers are easier to break than once believed, as substitution alphabets are repeated for sufficiently large plaintexts.
One of the most popular was that of Blaise de Vigenère. First published in 1585, it was considered unbreakable until 1863, and indeed was commonly called le chiffre indéchiffrable (French for "indecipherable cipher").
In the Vigenère cipher, the first row of the tableau is filled out with a copy of the plaintext alphabet, and successive rows are simply shifted one place to the left. (Such a simple tableau is called atabula recta, and mathematically corresponds to adding the plaintext and key letters, modulo 26.) A keyword is then used to choose which ciphertext alphabet to use. Each letter of the keyword is used in turn, and then they are repeated again from the beginning. So if the keyword is 'CAT', the first letter of plaintext is enciphered under alphabet 'C', the second under 'A', the third under 'T', the fourth under 'C' again, and so on. In practice, Vigenère keys were often phrases several words long.
In 1863, Friedrich Kasiski published a method (probably discovered secretly and independently before the Crimean War by Charles Babbage) which enabled the calculation of the length of the keyword in a Vigenère ciphered message. Once this was done, ciphertext letters that had been enciphered under the same alphabet could be picked out and attacked separately as a number of semi-independent simple substitutions - complicated by the fact that within one alphabet letters were separated and did not form complete words, but simplified by the fact that usually a tabula recta had been employed.
As such, even today a Vigenère type cipher should theoretically be difficult to break if mixed alphabets are used in the tableau, if the keyword is random, and if the total length of ciphertext is less than 27.6 times the length of the keyword.These requirements are rarely understood in practice, and so Vigenère enciphered message security is usually less than might have been.
Other notable polyalphabetics include:
•	The Gronsfeld cipher. This is identical to the Vigenère except that only 10 alphabets are used, and so the "keyword" is numerical.
•	The Beaufort cipher. This is practically the same as the Vigenère, except the tabula recta is replaced by a backwards one, mathematically equivalent to ciphertext = key - plaintext. This operation is self-inverse, whereby the same table is used for both encryption and decryption.
•	The autokey cipher, which mixes plaintext with a key to avoid periodicity.
•	The running key cipher, where the key is made very long by using a passage from a book or similar text.
Modern stream ciphers can also be seen, from a sufficiently abstract perspective, to be a form of polyalphabetic cipher in which all the effort has gone into making the keystream as long and unpredictable as possible.

3.	POLYGRAPHIC SUBSTITUTION

In a polygraphic substitution cipher, plaintext letters are substituted in larger groups, instead of substituting letters individually. The first advantage is that the frequency distribution is much flatter than that of individual letters (though not actually flat in real languages; for example, 'TH' is much more common than 'XQ' in English). Second, the larger number of symbols requires correspondingly more ciphertext to productively analyze letter frequencies.
To substitute pairs of letters would take a substitution alphabet 676 symbols long (). In the same De Furtivis Literarum Notis mentioned above, della Porta actually proposed such a system, with a 20 x 20 tableau (for the 20 letters of the Italian/Latin alphabet he was using) filled with 400 unique glyphs. However the system was impractical and probably never actually used.
The earliest practical digraphic cipher (pairwise substitution), was the so-called Playfair cipher, invented by Sir Charles Wheatstone in 1854. In this cipher, a 5 x 5 grid is filled with the letters of a mixed alphabet (two letters, usually I and J, are combined). A digraphic substitution is then simulated by taking pairs of letters as two corners of a rectangle, and using the other two corners as the ciphertext (see the Playfair cipher main article for a diagram). Special rules handle double letters and pairs falling in the same row or column. Playfair was in military use from the Boer Warthrough World War II.
Several other practical polygraphics were introduced in 1901 by Felix Delastelle, including the bifid and four-square ciphers (both digraphic) and the trifid cipher (probably the first practical trigraphic).
The Hill cipher, invented in 1929 by Lester S. Hill, is a polygraphic substitution which can combine much larger groups of letters simultaneously using linear algebra. Each letter is treated as a digit in base 26: A = 0, B =1, and so on. (In a variation, 3 extra symbols are added to make the basis prime.) A block of n letters is then considered as a vector of n dimensions, and multiplied by a n x n matrix, modulo 26. The components of the matrix are the key, and should be random provided that the matrix is invertible in (to ensure decryption is possible). A Hill cipher of dimension 6 was once implemented mechanically. 
The Hill cipher is vulnerable to a known-plaintext attack because it is completely linear, so it must be combined with some non-linear step to defeat this attack. The combination of wider and wider weak, linear diffusive steps like a Hill cipher, with non-linear substitution steps, ultimately leads to a substitution-permutation network (e.g. a Feistel cipher), so it is possible – from this extreme perspective – to consider modern block ciphers as a type of polygraphic substitution.

RAIL FENCE

"RailFence Cipher" (also called a zigzag cipher) generally refers to a form of transposition cipher. It derives its name from the way in which it is encoded.  

METHOD
In the rail fence cipher, the plaintext is written downwards and diagonally on successive "rails" of an imaginary fence, then moving up when we reach the bottom rail. When we reach the top rail, the message is written downwards again until the whole plaintext is written out. The message is then read off in rows. For example, if we have 3 "rails" and a message of 'WE ARE DISCOVERED. FLEE AT ONCE', the cipherer writes out:
W . . . E . . . C . . . R . . . L . . . T . . . E
. E . R . D . S . O . E . E . F . E . A . O . C .
. . A . . . I . . . V . . . D . . . E . . . N . .
Then reads off to get the ciphertext:
WECRL TEERD SOEEF EAOCA IVDEN

PROBLEM WITH RAIL FENCE
The rail fence cipher is not very strong; the number of practical keys is small enough that a cryptanalyst can try them all by hand.
ZIGZAG CIPHER

The term Zigzag cipher may refer to the Rail Fence Cipher as described above. However, it may also refer to a different type of cipher system that looks like a zigzag line going from the top of the page to the bottom. As described in Fletcher Pratt's Secret and Urgent, it is "written by ruling a sheet of paper in vertical columns, with a letter at the head of each column. A dot is made for each letter of the message in the proper column, reading from top to bottom of the sheet. The letters at the head of the columns are then cut off, the ruling erased and the message of dots sent along to the recipient, who, knowing the width of the columns and the arrangement of the letters at the top, reconstitutes the diagram and reads what it has to say.