594 results

• ElGamal signature scheme

  The ElGamal signature scheme is a digital signature scheme which is based on the difficulty of computing discrete logarithms. It was described by Taher ElGamal in 1984. The ElGamal signature algorithm described in this article

  https://cryptography.fandom.com/wiki/ElGamal_signature_scheme

• Confusion and diffusion

  Template:Refimprove In cryptography, confusion and diffusion are two properties of the operation of a secure cipher which were identified by Claude Shannon in his paper Communication Theory of Secrecy Systems, published in 1949. In

  https://cryptography.fandom.com/wiki/Confusion_and_diffusion

• SHA-1

  Template:Infobox cryptographic hash function In cryptography, SHA-1 is a cryptographic hash function designed by the National Security Agency (NSA) and published by the NIST as a U.S. Federal Information Processing Standard. SHA

  https://cryptography.fandom.com/wiki/SHA-1

• MD5

  Template:Infobox cryptographic hash function In cryptography, MD5 (Message-Digest algorithm 5) is a widely used cryptographic hash function with a 128-bit hash value. Specified in RFC 1321, MD5 has been employed in a

  https://cryptography.fandom.com/wiki/MD5

• Linear feedback shift register

  Template:Redirect Template:Refimprove Template:No footnotes A linear feedback shift register (LFSR) is a shift register whose input bit is a linear function of its previous state.

  https://cryptography.fandom.com/wiki/Linear_feedback_shift_register

• Cryptographic hash function

  A cryptographic hash function is a deterministic procedure that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that an accidental or intentional change to the

  https://cryptography.fandom.com/wiki/Cryptographic_hash_function

• Vigenère cipher

  The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution. The Vigenère

  https://cryptography.fandom.com/wiki/Vigenère_cipher

• Block cipher modes of operation

  In cryptography, modes of operation enable the repeated and secure use of a block cipher under a single key. A block cipher by itself allows encryption only of a single data block of the cipher

  https://cryptography.fandom.com/wiki/Block_cipher_modes_of_operation

• Advanced Encryption Standard

  Template:Infobox block cipher The Advanced Encryption Standard (AES) is a symmetric-key encryption standard adopted by the U.S. government. The standard comprises three block ciphers, AES-128, AES-192 and AES-256, adopted

  https://cryptography.fandom.com/wiki/Advanced_Encryption_Standard

• Cryptography

  Cryptography (or cryptology; from Greek κρυπτός, kryptos, "hidden, secret"; and γράφ, gráph, "writing", or -λογία, -logia, respectively) is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and

  https://cryptography.fandom.com/wiki/Cryptography

• Diffie–Hellman key exchange

  Diffie–Hellman key exchange (D–H) is a specific method of exchanging keys. It is one of the earliest practical examples of Key exchange implemented within the field of cryptography. The Diffie–Hellman key exchange

  https://cryptography.fandom.com/wiki/Diffie–Hellman_key_exchange

• Playfair cipher

  Template:Refimprove The Playfair cipher or Playfair square is a manual symmetric encryption technique and was the first literal digraph substitution cipher. The scheme was invented in 1854 by Charles Wheatstone, but bears the name

  https://cryptography.fandom.com/wiki/Playfair_cipher

• Caesar cipher

  Template:Featured article Template:Infobox block cipher In cryptography, a Caesar cipher, also known as a Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most

  https://cryptography.fandom.com/wiki/Caesar_cipher

• Ciphertext stealing

  Template:No footnotes In cryptography, ciphertext stealing (CTS) is a general method of using a block cipher mode of operation that allows for processing of messages that are not evenly divisible into blocks without resulting

  https://cryptography.fandom.com/wiki/Ciphertext_stealing

• Commitment scheme

  Template:Confusing In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to

  https://cryptography.fandom.com/wiki/Commitment_scheme

• AES implementations

  There are various implementations of the Advanced Encryption Standard, also known as Rijndael. Template:External links

  https://cryptography.fandom.com/wiki/AES_implementations

• Cryptographically secure pseudorandom number generator

  A cryptographically secure pseudo-random number generator (CSPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography. The "quality" of the randomness required for these applications varies

  https://cryptography.fandom.com/wiki/Cryptographically_secure_pseudorandom_number_generato

• Autokey cipher

  An autokey cipher (also known as the autoclave cipher) is a cipher which incorporates the message (the plaintext) into the key. There are two forms of autokey cipher: key autokey and text autokey ciphers. A

  https://cryptography.fandom.com/wiki/Autokey_cipher

• Feistel cipher

  In cryptography, a Feistel cipher is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel who did pioneering research while working for IBM (USA

  https://cryptography.fandom.com/wiki/Feistel_cipher

• Primality test

  A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors

  https://cryptography.fandom.com/wiki/Primality_test

• Pigpen cipher

  The pigpen cipher (sometimes referred to as the masonic cipher, Freemason's cipher, or Rosicrucian cipher) is a geometric simple substitution cipher which exchanges letters for symbols which are fragments of a grid. The example

  https://cryptography.fandom.com/wiki/Pigpen_cipher

• Galois/Counter Mode

  GCM mode (Galois/Counter Mode) is a mode of operation for symmetric key cryptographic block ciphers. It is an authenticated encryption algorithm designed to provide both authentication and secrecy. GCM mode is defined for block

  https://cryptography.fandom.com/wiki/Galois/Counter_Mode

• Rijndael mix columns

  The MixColumns operation performed by the Rijndael cipher, along with the shift-rows step, is the primary source of diffusion in Rijndael. Each column is treated as a polynomial over GF(2) and is then

  https://cryptography.fandom.com/wiki/Rijndael_mix_columns

• Rabin cryptosystem

  The Rabin cryptosystem is an asymmetric cryptographic technique, whose security, like that of RSA, is related to the difficulty of factorization. However the Rabin cryptosystem has the advantage that the problem on which it relies

  https://cryptography.fandom.com/wiki/Rabin_cryptosystem

• Padding (cryptography)

  Template:Refimprove In cryptography, padding refers to a number of distinct practices. Official messages often start and end in predictable ways: My dear ambassador, Weather report, Sincerely yours, etc. The primary use of padding with

  https://cryptography.fandom.com/wiki/Padding_(cryptography)