enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. S-box - Wikipedia

    en.wikipedia.org/wiki/S-box

    In cryptography, an S-box (substitution-box) is a basic component of symmetric key algorithms which performs substitution. In block ciphers, they are typically used to obscure the relationship between the key and the ciphertext, thus ensuring Shannon's property of confusion. Mathematically, an S-box is a nonlinear [1] vectorial Boolean function ...

  3. Substitution cipher - Wikipedia

    en.wikipedia.org/wiki/Substitution_cipher

    In cryptography, a substitution cipher is a method of encrypting in which units of plaintext are replaced with the ciphertext, in a defined manner, with the help of a key; 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 ...

  4. Aristocrat Cipher - Wikipedia

    en.wikipedia.org/wiki/Aristocrat_Cipher

    The Aristocrat Cipher is a type of monoalphabetic substitution cipher in which plaintext is replaced with ciphertext and encoded into assorted letters, numbers, and symbols based on a keyword. The formatting of these ciphers generally includes a title, letter frequency, keyword indicators, and the encoder's nom de plume . [ 1 ]

  5. Playfair cipher - Wikipedia

    en.wikipedia.org/wiki/Playfair_cipher

    The Playfair cipher or Playfair square or Wheatstone–Playfair cipher is a manual symmetric encryption technique and was the first literal digram substitution cipher. The scheme was invented in 1854 by Charles Wheatstone , but bears the name of Lord Playfair for promoting its use.

  6. ROT13 - Wikipedia

    en.wikipedia.org/wiki/ROT13

    ROT13 is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the Latin alphabet. ROT13 is a special case of the Caesar cipher which was developed in ancient Rome, used by Julius Caesar in the 1st century BC. [1] An early entry on the Timeline of cryptography.

  7. Lucifer (cipher) - Wikipedia

    en.wikipedia.org/wiki/Lucifer_(cipher)

    Lucifer uses a combination of transposition and substitution crypting as a starting point in decoding ciphers. [clarification needed] One variant, described by Feistel in 1971, [2] uses a 48-bit key and operates on 48-bit blocks. The cipher is a substitution–permutation network and uses two 4-bit S-boxes. The key selects which S-boxes are used.

  8. Known-plaintext attack - Wikipedia

    en.wikipedia.org/wiki/Known-plaintext_attack

    Classical ciphers are typically vulnerable to known-plaintext attack. For example, a Caesar cipher can be solved using a single letter of corresponding plaintext and ciphertext to decrypt entirely. A general monoalphabetic substitution cipher needs several character pairs and some guessing if there are fewer than 26 distinct pairs.

  9. List of cryptographers - Wikipedia

    en.wikipedia.org/wiki/List_of_cryptographers

    The list of ciphers in this work included both substitution and transposition, and for the first time, a cipher with multiple substitutions for each plaintext letter. Charles Babbage, UK, 19th century mathematician who, about the time of the Crimean War, secretly developed an effective attack against polyalphabetic substitution ciphers.