Table of Contents
53 relations: Abraham Sinkov, Adaptive chosen-ciphertext attack, Advanced Encryption Standard, Algorithm, Attack model, Babington Plot, Beale ciphers, Bibliography of cryptography, Block cipher, Brute-force attack, Caesar cipher, Certified information systems security professional, Chosen-ciphertext attack, Chosen-plaintext attack, Cipher, Ciphertext-only attack, Classical cipher, Code (cryptography), Cryptogram, Cryptographic hash function, Cryptography, Cryptosystem, Data Encryption Standard, David Kahn (writer), Encryption, Enigma machine, Frequency analysis, History of cryptography, Key (cryptography), Known-plaintext attack, Kryptos, One-time pad, Password cracking, Permutation, Plaintext, Playfair cipher, Polyalphabetic cipher, Polygraphic substitution, Public-key cryptography, Rail fence cipher, Red/black concept, Related-key attack, RSA (cryptosystem), Shugborough inscription, Stream cipher, Substitution cipher, Symmetric-key algorithm, The Gold-Bug, The Magic Words are Squeamish Ossifrage, Transposition cipher, ... Expand index (3 more) »
Abraham Sinkov
Abraham Sinkov (August 22, 1907 – January 19, 1998) was a US cryptanalyst.
See Ciphertext and Abraham Sinkov
Adaptive chosen-ciphertext attack
An adaptive chosen-ciphertext attack (abbreviated as CCA2) is an interactive form of chosen-ciphertext attack in which an attacker first sends a number of ciphertexts to be decrypted chosen adaptively, and then uses the results to distinguish a target ciphertext without consulting the oracle on the challenge ciphertext.
See Ciphertext and Adaptive chosen-ciphertext attack
Advanced Encryption Standard
The Advanced Encryption Standard (AES), also known by its original name Rijndael, is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001. Ciphertext and Advanced Encryption Standard are cryptography.
See Ciphertext and Advanced Encryption Standard
Algorithm
In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.
Attack model
In cryptanalysis, attack models or attack types are a classification of cryptographic attacks specifying the kind of access a cryptanalyst has to a system under attack when attempting to "break" an encrypted message (also known as ciphertext) generated by the system.
See Ciphertext and Attack model
Babington Plot
The Babington Plot was a plan in 1586 to assassinate Queen Elizabeth I, a Protestant, and put Mary, Queen of Scots, her Catholic cousin, on the English throne.
See Ciphertext and Babington Plot
Beale ciphers
The Beale ciphers are a set of three ciphertexts, one of which allegedly states the location of a buried treasure of gold, silver and jewels estimated to be worth over 43 million US dollars Comprising three ciphertexts, the first (unsolved) text describes the location, the second (solved) ciphertext accounts the content of the treasure, and the third (unsolved) lists the names of the treasure's owners and their next of kin.
See Ciphertext and Beale ciphers
Bibliography of cryptography
Books on cryptography have been published sporadically and with highly variable quality for a long time.
See Ciphertext and Bibliography of cryptography
Block cipher
In cryptography, a block cipher is a deterministic algorithm that operates on fixed-length groups of bits, called blocks.
See Ciphertext and Block cipher
Brute-force attack
In cryptography, a brute-force attack consists of an attacker submitting many passwords or passphrases with the hope of eventually guessing correctly.
See Ciphertext and Brute-force attack
Caesar cipher
In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code, or Caesar shift, is one of the simplest and most widely known encryption techniques.
See Ciphertext and Caesar cipher
Certified information systems security professional
CISSP (Certified Information Systems Security Professional) is an independent information security certification granted by the International Information System Security Certification Consortium, also known as ISC2.
See Ciphertext and Certified information systems security professional
Chosen-ciphertext attack
A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis where the cryptanalyst can gather information by obtaining the decryptions of chosen ciphertexts.
See Ciphertext and Chosen-ciphertext attack
Chosen-plaintext attack
A chosen-plaintext attack (CPA) is an attack model for cryptanalysis which presumes that the attacker can obtain the ciphertexts for arbitrary plaintexts.
See Ciphertext and Chosen-plaintext attack
Cipher
In cryptography, a cipher (or cypher) is an algorithm for performing encryption or decryption—a series of well-defined steps that can be followed as a procedure. Ciphertext and cipher are cryptography.
Ciphertext-only attack
In cryptography, a ciphertext-only attack (COA) or known ciphertext attack is an attack model for cryptanalysis where the attacker is assumed to have access only to a set of ciphertexts.
See Ciphertext and Ciphertext-only attack
Classical cipher
In cryptography, a classical cipher is a type of cipher that was used historically but for the most part, has fallen into disuse.
See Ciphertext and Classical cipher
Code (cryptography)
In cryptology, a code is a method used to encrypt a message that operates at the level of meaning; that is, words or phrases are converted into something else. Ciphertext and code (cryptography) are cryptography.
See Ciphertext and Code (cryptography)
Cryptogram
A cryptogram is a type of puzzle that consists of a short piece of encrypted text.
Cryptographic hash function
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n bits) that has special properties desirable for a cryptographic application.
See Ciphertext and Cryptographic hash function
Cryptography
Cryptography, or cryptology (from κρυπτός|translit.
See Ciphertext and Cryptography
Cryptosystem
In cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, such as confidentiality (encryption). Ciphertext and cryptosystem are cryptography.
See Ciphertext and Cryptosystem
Data Encryption Standard
The Data Encryption Standard (DES) is a symmetric-key algorithm for the encryption of digital data.
See Ciphertext and Data Encryption Standard
David Kahn (writer)
David Kahn (February 7, 1930 – January 23, 2024) was an American historian, journalist, and writer.
See Ciphertext and David Kahn (writer)
Encryption
In cryptography, encryption is the process of transforming (more specifically, encoding) information in a way that, ideally, only authorized parties can decode. Ciphertext and encryption are cryptography.
Enigma machine
The Enigma machine is a cipher device developed and used in the early- to mid-20th century to protect commercial, diplomatic, and military communication.
See Ciphertext and Enigma machine
Frequency analysis
In cryptanalysis, frequency analysis (also known as counting letters) is the study of the frequency of letters or groups of letters in a ciphertext.
See Ciphertext and Frequency analysis
History of cryptography
Cryptography, the use of codes and ciphers to protect secrets, began thousands of years ago. Ciphertext and History of cryptography are cryptography.
See Ciphertext and History of cryptography
Key (cryptography)
A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data.
See Ciphertext and Key (cryptography)
Known-plaintext attack
The known-plaintext attack (KPA) is an attack model for cryptanalysis where the attacker has access to both the plaintext (called a crib) and its encrypted version (ciphertext).
See Ciphertext and Known-plaintext attack
Kryptos
Kryptos is a distributed sculpture by the American artist Jim Sanborn located on the grounds of the Central Intelligence Agency (CIA) headquarters, the George Bush Center for Intelligence in Langley, Virginia.
One-time pad
In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked, but requires the use of a single-use pre-shared key that is larger than or equal to the size of the message being sent. Ciphertext and one-time pad are cryptography.
See Ciphertext and One-time pad
Password cracking
In cryptanalysis and computer security, password cracking is the process of guessing passwords protecting a computer system.
See Ciphertext and Password cracking
Permutation
In mathematics, a permutation of a set can mean one of two different things.
See Ciphertext and Permutation
Plaintext
In cryptography, plaintext usually means unencrypted information pending input into cryptographic algorithms, usually encryption algorithms. Ciphertext and plaintext are cryptography.
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.
See Ciphertext and Playfair cipher
Polyalphabetic cipher
A polyalphabetic cipher is a substitution, using multiple substitution alphabets.
See Ciphertext and Polyalphabetic cipher
Polygraphic substitution
Polygraphic substitution is a cipher in which a uniform substitution is performed on blocks of letters. Ciphertext and Polygraphic substitution are cryptography.
See Ciphertext and Polygraphic substitution
Public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Ciphertext and Public-key cryptography are cryptography.
See Ciphertext and Public-key cryptography
Rail fence cipher
The rail fence cipher (also called a zigzag cipher) is a classical type of transposition cipher.
See Ciphertext and Rail fence cipher
Red/black concept
The red/black concept, sometimes called the red–black architecture or red/black engineering, refers to the careful segregation in cryptographic systems of signals that contain sensitive or classified plaintext information (red signals) from those that carry encrypted information, or ciphertext (black signals). Ciphertext and Red/black concept are cryptography.
See Ciphertext and Red/black concept
Related-key attack
In cryptography, a related-key attack is any form of cryptanalysis where the attacker can observe the operation of a cipher under several different keys whose values are initially unknown, but where some mathematical relationship connecting the keys is known to the attacker.
See Ciphertext and Related-key attack
RSA (cryptosystem)
RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem, one of the oldest widely used for secure data transmission.
See Ciphertext and RSA (cryptosystem)
Shugborough inscription
The Shugborough Inscription is a sequence of letters – O U O S V A V V, between the letters D M on a lower plane – carved on the 18th-century Shepherd's Monument in the grounds of Shugborough Hall in Staffordshire, England, below a mirror image of Nicolas Poussin's painting the Shepherds of Arcadia.
See Ciphertext and Shugborough inscription
Stream cipher
A stream cipher is a symmetric key cipher where plaintext digits are combined with a pseudorandom cipher digit stream (keystream).
See Ciphertext and Stream cipher
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.
See Ciphertext and Substitution cipher
Symmetric-key algorithm
Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext.
See Ciphertext and Symmetric-key algorithm
The Gold-Bug
"The Gold-Bug" is a short story by American writer Edgar Allan Poe published in 1843.
See Ciphertext and The Gold-Bug
The Magic Words are Squeamish Ossifrage
"The Magic Words are Squeamish Ossifrage" was the solution to a challenge ciphertext posed by the inventors of the RSA cipher in 1977.
See Ciphertext and The Magic Words are Squeamish Ossifrage
Transposition cipher
In cryptography, a transposition cipher (also known as a permutation cipher) is a method of encryption which scrambles the positions of characters (transposition) without changing the characters themselves.
See Ciphertext and Transposition cipher
Vigenère cipher
The Vigenère cipher is a method of encrypting alphabetic text where each letter of the plaintext is encoded with a different Caesar cipher, whose increment is determined by the corresponding letter of another text, the key.
See Ciphertext and Vigenère cipher
Zimmermann Telegram
The Zimmermann Telegram (or Zimmermann Note or Zimmermann Cable) was a secret diplomatic communication issued from the German Foreign Office in January 1917 that proposed a military contract between the German Empire and Mexico if the United States entered World War I against Germany.
See Ciphertext and Zimmermann Telegram
Zodiac Killer
The Zodiac Killer is the pseudonym of an unidentified serial killer who operated in Northern California in the late 1960s.
See Ciphertext and Zodiac Killer
References
Also known as Cipher text, Cyphertext.