Cryptography is the practice and study of techniques for secure communication in the presence of adversaries. The craft is ancient, but its modern era belongs to computing: Claude Shannon's papers of 1948 and 1949 gave it a mathematical basis, and cryptographic algorithms are now designed around computational hardness assumptions, so that breaking them is a computing problem nobody knows how to solve efficiently. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Disputed
Origin YearCryptography as a practice is ancient, but its treatment as a computational academic field is usually dated to the 1970s: the Data Encryption Standard effort of the early 1970s and the 1976 Diffie-Hellman publication that opened public key cryptography, so the origin year depends on whether the ancient practice or the modern computational field is being dated. Core ConcernHow information is kept confidential and authentic against adversaries, using algorithms whose security rests on problems believed computationally hard. 1 Cryptography
Filter Results86 entries
Connections
Associated With
Blockchain records are secured and linked via cryptographic hashes.
Source Blockchain (Wikipedia)
His 1948 information theory paper and especially his 1949 cryptography paper laid the foundations of modern cryptography.
Source Wikipedia: Cryptography
Claude Shannon, Pioneers Claude Shannon's 1949 paper Communication Theory of Secrecy Systems put cryptography on a rigorous mathematical footing for the first time, founding the field's modern theoretical basis.
Source The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital RevolutionWalter Isaacson
Source Wikipedia: Cryptography
Source Wikipedia: Quantum computing
Source Quantum Information Science (Wikipedia)
Includes
Source Wikipedia: Bombe
Source Threefish (Wikipedia)
Source Tiger (hash function) (Wikipedia)
Source Time-based one-time password (Wikipedia)
Source Tiny Encryption Algorithm (Wikipedia)
Source Wikipedia: Triple DES
Source Wikipedia: Twofish
Source Victor Shoup (Wikipedia)
Source Vigenère cipher (Wikipedia)
Source Vincent Rijmen (Wikipedia)
Source Vinod Vaikuntanathan (Wikipedia)
Source Whirlpool (hash function) (Wikipedia)
Source Wang Xiaoyun (Wikipedia)
Source Yael Tauman Kalai (Wikipedia)
Source Yescrypt (Wikipedia)
Showing 151 to 168 of 168 in Includes, page 4 of 4.
Sources
1. Wikipedia: Cryptography
WikipediaIntroduction and Modern cryptography sections
Cryptography, or cryptology, is the practice and study of techniques for secure communication in the presence of adversarial behavior.
Modern cryptography section
Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions.
Early computer-era cryptography
In the early 1970s IBM personnel designed the Data Encryption Standard (DES) algorithm that became the first federal government cryptography standard in the United States.
Associated With: Information Security, Lead section
Core concepts related to information security (data confidentiality, data integrity, authentication and non-repudiation) are also central to cryptography.
- In Group: Cryptography and Distributed Ledgers, lead section
View the Source The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
Walter Isaacson, Simon and Schuster, 2014Associated With: Claude Shannon
Wikipedia: Bombe
Wikipedia: Quantum computing
Wikimedia FoundationAssociated With: Quantum Computing, Lead sectionQuote, Associated With: Quantum Computing, Lead section
A large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations.
View the Source Blockchain (Wikipedia)
Wikimedia FoundationAssociated With: Blockchain, Lead sectionQuote, Associated With: Blockchain, Lead section
A blockchain is a distributed ledger with growing lists of records (blocks) that are securely linked together via cryptographic hashes.
View the Source Wikipedia: Adi Shamir
Wikimedia FoundationIncludes: Adi Shamir, introduction, first sentenceQuote, Includes: Adi Shamir, introduction, first sentence
born July 6, 1952) is an Israeli cryptographer and inventor.
View the Source Wikipedia: Shafi Goldwasser
Wikimedia FoundationIncludes: Shafi Goldwasser, contributions sectionQuote, Includes: Shafi Goldwasser, contributions section
pioneered the field of provable security, which laid the mathematical foundations that made modern cryptography possible.
View the Source Quantum Information Science (Wikipedia)
Wikimedia FoundationAssociated With: Quantum Information Science, Scientific and engineering studiesQuote, Associated With: Quantum Information Science, Scientific and engineering studies
Quantum cryptography devices are now available for commercial use.
View the Source Michael Backes, Wikipedia
Includes: Michael Backes, Lead sectionQuote, Includes: Michael Backes, Lead section
formal methods, cryptography and privacy-enhancing technologies
View the Source Engineering and Technology History Wiki: Charles H. Bennett - ETHW
Engineering and Technology History WikiIncludes: Charles H. Bennett, BiographyQuote, Includes: Charles H. Bennett, Biography
developed a practical system of quantum cryptography
View the Source Horst Feistel (Wikipedia)
Includes: Horst Feistel, Lead sectionQuote, Includes: Horst Feistel, Lead section
was a German-American cryptographer who worked on the design of ciphers at IBM
View the Source XTEA (Wikipedia)
Includes: XTEA, LeadQuote, Includes: XTEA, Lead
In cryptography, XTEA (eXtended TEA) is a block cipher designed to correct weaknesses in TEA.
View the Source A5/1 (Wikipedia)
Includes: A5/1, Lead sectionQuote, Includes: A5/1, Lead section
A5/1 is a stream cipher used to provide over-the-air communication privacy in the GSM cellular telephone standard.
View the Source Harry Fensom (Wikipedia)
Includes: Harry Fensom, LeadQuote, Includes: Harry Fensom, Lead
During World War II he worked with Tommy Flowers at Bletchley Park on Colossus, the world's first electronic computer, that helped to decode encrypted German messages using the Lorenz cipher.
View the Source Arnold Lynch (Wikipedia)
Includes: Arnold Lynch, LeadQuote, Includes: Arnold Lynch, Lead
By 1944 ten Colossus computers were installed at Bletchley Park and used to read high-level (Fish or Tunny) German ciphers.
View the Source Atbash (Wikipedia)
Includes: Atbash, Lead, first sentenceQuote, Includes: Atbash, Lead, first sentence
is a monoalphabetic substitution cipher originally used to encrypt the Hebrew alphabet
View the Source Time-based one-time password (Wikipedia)
Includes: Time-based one-time password, Lead [in-field]Quote, Includes: Time-based one-time password, Lead [in-field]
TOTP is a cornerstone of the Initiative for Open Authentication (OATH) and is used in a number of two-factor authentication (2FA) systems.
View the Source ADFGVX cipher (Wikipedia)
Includes: ADFGVX cipher, Lead [in-field]Quote, Includes: ADFGVX cipher, Lead [in-field]
In cryptography, the ADFGVX cipher was a manually applied field cipher
View the Source CBC-MAC (Wikipedia)
Includes: CBC-MAC, Lead [in-field]Quote, Includes: CBC-MAC, Lead [in-field]
In cryptography, a cipher block chaining message authentication code (CBC-MAC) is a technique for constructing a message authentication code (MAC) from a block cipher.
View the Source Galois/Counter Mode (Wikipedia)
Includes: Galois/Counter Mode, Lead, first sentence [in-field]Quote, Includes: Galois/Counter Mode, Lead, first sentence [in-field]
In cryptography, Galois/Counter Mode (GCM) is a mode of operation
View the Source Bacon's cipher (Wikipedia)
Includes: Bacon's cipher, Lead, third sentenceQuote, Includes: Bacon's cipher, Lead, third sentence
Baconian ciphers are categorized as both a substitution cipher
View the Source Alex Biryukov (Wikipedia)
Includes: Alex Biryukov, Article text [in-field]Quote, Includes: Alex Biryukov, Article text [in-field]
is a cryptographer, currently a full professor at the University of Luxembourg
View the Source Skein (hash function) (Wikipedia)
Includes: Skein (hash function), LeadQuote, Includes: Skein (hash function), Lead
Skein is a cryptographic hash function and one of five finalists in the NIST hash function competition.
View the Source CAST-256 (Wikipedia)
Includes: CAST-256, Lead sentenceQuote, Includes: CAST-256, Lead sentence
In cryptography, CAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998.
View the Source Carlisle Adams (Wikipedia)
Includes: Carlisle Adams, LeadQuote, Includes: Carlisle Adams, Lead
Carlisle M. Adams is a Canadian cryptographer and computer security researcher.
View the Source Stafford Tavares (Wikipedia)
Includes: Stafford Tavares, LeadQuote, Includes: Stafford Tavares, Lead
Stafford Emanuel Tavares is a Canadian cryptographer, professor emeritus at Queen's University.
View the Source Howard Heys (Wikipedia)
Includes: Howard Heys, LeadQuote, Includes: Howard Heys, Lead
Howard M. Heys is a cryptographer, a retired professor of Electrical and Computer Engineering at Memorial University of Newfoundland;
View the Source Streebog (source article)
Includes: Streebog, LeadQuote, Includes: Streebog, Lead
is a cryptographic hash function defined in the Russian national standard GOST R 34.11-2012
View the Source Bifid cipher (source article)
Includes: Bifid cipher, LeadQuote, Includes: Bifid cipher, Lead
In classical cryptography, the bifid cipher is a cipher which combines the Polybius square with transposition
View the Source ElGamal signature scheme (source article)
Includes: ElGamal signature scheme, LeadQuote, Includes: ElGamal signature scheme, Lead
The ElGamal signature scheme is a digital signature scheme which is based on the difficulty of computing discrete logarithms.
View the Source Félix Delastelle (source article)
Includes: Félix Delastelle, LeadQuote, Includes: Félix Delastelle, Lead
best known for inventing the bifid cipher
View the Source CLEFIA (Wikipedia)
Includes: CLEFIA, Lead paragraphQuote, Includes: CLEFIA, Lead paragraph
CLEFIA is a proprietary block cipher algorithm, developed by Sony.
View the Source XXTEA (Wikipedia)
Includes: XXTEA, Lead [in-field]Quote, Includes: XXTEA, Lead [in-field]
In cryptography, Corrected Block TEA
View the Source RFC 1319: The MD2 Message-Digest Algorithm
Includes: MD2 (hash function), 1. Executive SummaryQuote, Includes: MD2 (hash function), 1. Executive Summary
This document describes the MD2 message-digest algorithm.
View the Source RFC 2268: A Description of the RC2 Encryption Algorithm
Includes: RC2, 1. IntroductionQuote, Includes: RC2, 1. Introduction
This memo describes a conventional (secret-key) block encryption
View the Source RFC 2144: The CAST-128 Encryption Algorithm
Includes: CAST-128, 2. Description of AlgorithmQuote, Includes: CAST-128, 2. Description of Algorithm
CAST-128 belongs to the class of encryption algorithms known as
View the Source RFC 2994: A Description of the MISTY1 Encryption Algorithm
Includes: MISTY1, AbstractQuote, Includes: MISTY1, Abstract
This document describes a secret-key cryptosystem MISTY1, which is
View the Source Four-square cipher (source article)
Includes: Four-square cipher, LeadQuote, Includes: Four-square cipher, Lead
The four-square cipher is a manual symmetric encryption technique.
View the Source Dual EC DRBG (source article)
Includes: Dual EC DRBG, LeadQuote, Includes: Dual EC DRBG, Lead
presented as a cryptographically secure pseudorandom number generator (CSPRNG)
View the Source Mitsuru Matsui (source article)
Includes: Mitsuru Matsui, CareerQuote, Includes: Mitsuru Matsui, Career
discovered the technique of linear cryptanalysis, published in 1993.
View the Source DES-X (Wikipedia)
Includes: DES-X, Introduction [in-field]Quote, Includes: DES-X, Introduction [in-field]
In cryptography, DES-X (or DESX)
View the Source RFC 4269: The SEED Encryption Algorithm
Includes: SEED, 1.2 SEED OverviewQuote, Includes: SEED, 1.2 SEED Overview
SEED is a 128-bit symmetric key block cipher that has been developed
View the Source MD6 (Wikipedia)
Includes: MD6, Lead sectionQuote, Includes: MD6, Lead section
The MD6 Message-Digest Algorithm is a cryptographic hash function.
View the Source Mix network (Wikipedia)
Includes: Mix network, Lead section [in-field]Quote, Includes: Mix network, Lead section [in-field]
Each message is encrypted to each proxy using public key cryptography
View the Source Ring signature (Wikipedia)
Includes: Ring signature, Lead section [in-field]Quote, Includes: Ring signature, Lead section [in-field]
In cryptography, a ring signature is a type of digital signature
View the Source ARIA (cipher) (Wikipedia)
Includes: ARIA (cipher), Lead sectionQuote, Includes: ARIA (cipher), Lead section
ARIA is a block cipher designed in 2003 by a large group of South Korean researchers
View the Source KASUMI (Wikipedia)
Includes: KASUMI, LeadQuote, Includes: KASUMI, Lead
KASUMI is a block cipher used in UMTS, GSM, and GPRS mobile communications systems.
View the Source Tiger (hash function) (Wikipedia)
Includes: Tiger (hash function), LeadQuote, Includes: Tiger (hash function), Lead
Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms.
View the Source Wikipedia: Data Encryption Standard
Includes: Data Encryption Standard Algorithm, Lead sentenceQuote, Includes: Data Encryption Standard Algorithm, Lead sentence
Data Encryption Standard (DES ) is a symmetric-key algorithm for the encryption of digital data.
View the Source Wikipedia: SHA-1
Includes: SHA-1 Algorithm, Lead sectionQuote, Includes: SHA-1 Algorithm, Lead section
In cryptography, SHA-1 (Secure Hash Algorithm 1) is a hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest - typically rendered as 40 hexadecimal digits.
View the Source Wikipedia: Triple DES
Includes: Triple DES Algorithm, Lead sentenceQuote, Includes: Triple DES Algorithm, Lead sentence
Triple DES (3DES or TDES), officially the Triple Data Encryption Algorithm (TDEA or Triple DEA), is a symmetric-key block cipher, which applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.
View the Source Wikipedia: Twofish
Includes: Twofish Algorithm, Lead sentenceQuote, Includes: Twofish Algorithm, Lead sentence
Twofish is a symmetric key block cipher with a block size of 128 bits and key sizes up to 256 bits.
View the Source Wikipedia: ChaCha20-Poly1305
Includes: ChaCha20 Algorithm, Lead sentenceQuote, Includes: ChaCha20 Algorithm, Lead sentence
ChaCha20-Poly1305 is an authenticated encryption with associated data (AEAD) algorithm, that combines the ChaCha20 stream cipher with the Poly1305 message authentication code.
View the Source Salsa20, Wikipedia
Includes: Salsa20 Algorithm, Lead sentenceQuote, Includes: Salsa20 Algorithm, Lead sentence
Salsa20 (formerly known as Snuffle 2005) and the closely related ChaCha are stream ciphers developed by Daniel J. Bernstein.
View the Source ElGamal encryption (Wikipedia)
Includes: ElGamal Encryption Algorithm, Lead sentenceQuote, Includes: ElGamal Encryption Algorithm, Lead sentence
ElGamal encryption system is a public-key encryption algorithm based on the Diffie-Hellman key exchange.
View the Source Argon2 (Wikipedia)
Includes: Argon2, Lead sentenceQuote, Includes: Argon2, Lead sentence
Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition.
View the Source Wikipedia: BLAKE (hash function)
Includes: BLAKE2, Lead sentenceQuote, Includes: BLAKE2, Lead sentence
BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round.
View the Source International Data Encryption Algorithm (Wikipedia)
Includes: International Data Encryption Algorithm, Lead sentenceQuote, Includes: International Data Encryption Algorithm, Lead sentence
International Data Encryption Algorithm (IDEA), originally called Improved Proposed Encryption Standard (IPES), is a symmetric-key block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991. The algorithm was intended as
View the Source Digital Signature Algorithm (Wikipedia)
Includes: Digital Signature Algorithm, Lead sentenceQuote, Includes: Digital Signature Algorithm, Lead sentence
Digital Signature Algorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical concept of modular exponentiation and the discrete logarithm problem.
View the Source PBKDF2 (Wikipedia)
Includes: PBKDF2, Lead sentenceQuote, Includes: PBKDF2, Lead sentence
PBKDF1 and PBKDF2 (Password-Based Key Derivation Function 1 and 2) are key derivation functions with a sliding computational cost, used to reduce vulnerability to brute-force attacks.
View the Source Poly1305 (Wikipedia)
Includes: Poly1305, Lead sentenceQuote, Includes: Poly1305, Lead sentence
Poly1305 is a universal hash family designed by Daniel J. Bernstein in 2002 for use in cryptography.
View the Source RIPEMD (Wikipedia)
Includes: RIPEMD, Lead sentenceQuote, Includes: RIPEMD, Lead sentence
RIPEMD (RIPE Message Digest) is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants).
View the Source Skipjack (cipher) (Wikipedia)
Includes: Skipjack Algorithm, Lead sentenceQuote, Includes: Skipjack Algorithm, Lead sentence
Skipjack is a block cipher - an algorithm for encryption - developed by the United States National Security Agency (NSA).
View the Source Tiny Encryption Algorithm (Wikipedia)
Includes: Tiny Encryption Algorithm, Lead sentenceQuote, Includes: Tiny Encryption Algorithm, Lead sentence
Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code.
View the Source SM4 (cipher) (Wikipedia)
Includes: SM4 Algorithm, Lead sentenceQuote, Includes: SM4 Algorithm, Lead sentence
ShāngMì 4 (SM4, 商密4) (formerly SMS4) is a block cipher, standardised for commercial cryptography in China.
View the Source McEliece Cryptosystem (Wikipedia)
Includes: McEliece Cryptosystem, Lead sentenceQuote, Includes: McEliece Cryptosystem, Lead sentence
McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece.
View the Source Schnorr signature (Wikipedia)
Includes: Schnorr Signature Algorithm, Lead sentenceQuote, Includes: Schnorr Signature Algorithm, Lead sentence
Schnorr signature is a digital signature produced by the Schnorr signature algorithm that was invented by Claus Schnorr.
View the Source Paillier cryptosystem (Wikipedia)
Includes: Paillier Cryptosystem, Lead sentenceQuote, Includes: Paillier Cryptosystem, Lead sentence
Paillier cryptosystem, invented by and named after Pascal Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography.
View the Source Wikipedia: SHA-256 Algorithm
Wikimedia FoundationIncludes: SHA-2, Lead section
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001.
Includes: SHA-256 Algorithm, Lead
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001.
View the Source Wikipedia: Message Authenticator Algorithm
Includes: Message Authenticator Algorithm, Lead sentenceQuote, Includes: Message Authenticator Algorithm, Lead sentence
Message Authenticator Algorithm (MAA) was one of the first cryptographic functions for computing a message authentication code (MAC).
View the Source Wikipedia: HKDF
Includes: HKDF, Lead sentenceQuote, Includes: HKDF, Lead sentence
HKDF is a multi-purpose key derivation function (KDF) based on the HMAC message authentication code.
View the Source Yescrypt (Wikipedia)
Includes: Yescrypt, Lead sentenceQuote, Includes: Yescrypt, Lead sentence
yescrypt is a cryptographic key derivation function used for password hashing on Fedora Linux, Debian, Ubuntu, and Arch Linux.
View the Source Srini Devadas (Wikipedia)
Includes: Srini Devadas, Lead sentenceQuote, Includes: Srini Devadas, Lead sentence
Srini Devadas is an Indian-American computer scientist at the Massachusetts Institute of Technology's Computer Science and Artificial Intelligence Laboratory (CSAIL) who specializes in computer security, computer architectures, and applied cryptography.
View the Source Brent Waters (Wikipedia)
Includes: Brent Waters, Lead sentence
Brent R. Waters is an American computer scientist, specializing in cryptography and computer security.
- Includes: Brent Waters, Lead paragraph
View the SourceYael Tauman Kalai (Wikipedia)
Includes: Yael Tauman Kalai, Lead section
Yael Tauman Kalai (Hebrew: יעל טאומן קלעי) is a cryptographer and theoretical computer scientist and the Ellen Swallow Richards Professor at MIT in the Computer Science and Artificial Intelligence Laboratory.
- Includes: Yael Tauman Kalai, Lead paragraph
View the SourceRan Canetti (Wikipedia)
Includes: Ran Canetti, Lead sectionQuote, Includes: Ran Canetti, Lead section
Ran Canetti (Hebrew: רן קנטי) is an Israeli cryptographer.
View the Source Hugo Krawczyk (Wikipedia)
Includes: Hugo Krawczyk, Lead sentence
Hugo Mario Krawczyk is an Argentine-Israeli cryptographer best known for co-inventing the HMAC message authentication algorithm and contributing in fundamental ways to the cryptographic architecture of central Internet standards, including IPsec, IKE, and SSL/TLS. In particular, both IKEv2 and TLS 1
- Includes: Hugo Krawczyk, Lead paragraph
View the SourceNadia Heninger (Wikipedia)
Includes: Nadia Heninger, Lead sentenceQuote, Includes: Nadia Heninger, Lead sentence
Nadia Heninger (born 1982) is an American cryptographer, computer security expert, and computational number theorist at the University of California, San Diego.
View the Source Pil Joong Lee (Wikipedia)
Includes: Pil Joong Lee, Lead section
Pil Joong Lee (Korean: 이필중) is a cryptographer at Pohang University of Science and Technology (POSTECH), South Korea.
- Includes: Pil Joong Lee, Lead paragraph
View the SourceWikipedia: Claude Shannon
Wikimedia FoundationIncludes: Claude Shannon, Lead paragraphView the Source Wikipedia: Bruce Schneier
Wikimedia FoundationIncludes: Bruce Schneier, Lead paragraphView the Source Wikipedia: Ron Rivest
Wikipedia: Martin Hellman
Wikimedia FoundationIncludes: Martin Hellman, Lead paragraphView the Source Wikipedia: Leonard Adleman
Wikimedia FoundationIncludes: Leonard Adleman, Lead paragraphView the Source Wikipedia: Daniel J. Bernstein
Wikimedia FoundationIncludes: Daniel J. Bernstein, Lead paragraphView the Source Wikipedia: Manuel Blum
Wikipedia: Ian Goldberg
Wikipedia: Lenore Blum
Wikipedia: David A. Wagner
Wikipedia: Taher Elgamal
Wikipedia: Moti Yung
Wikipedia: Shimon Even
Wikipedia: Dorothy Blum
Mihir Bellare, Wikipedia
Dan Boneh, Wikipedia
Christian Cachin - Wikipedia
Jan Camenisch, Wikipedia
Pino Caballero Gil (Wikipedia)
Danny Dolev (Wikipedia)
Cynthia Dwork (Wikipedia)
Wikipedia: Aggelos Kiayias
Wikimedia FoundationIncludes: Aggelos Kiayias, Lead paragraphView the Source Wikipedia: Amos Fiat
Wikipedia: Bart Preneel
Wikipedia: Blowfish (cipher)
SHA-3, Wikipedia
Scrypt (Wikipedia)
Merkle-Hellman knapsack cryptosystem (Wikipedia)
Includes: Merkle-Hellman Knapsack Cryptosystem, Lead paragraphView the Source Rabin cryptosystem (Wikipedia)
Wikipedia: One-way compression function
Wikipedia: EdDSA
- Includes: Ed25519, Lead paragraph
Includes: EdDSA Algorithm, Lead
In public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based on twisted Edwards curves.
View the SourcePseudorandom generator (Wikipedia)
Wikipedia: Roger Needham
Wikimedia FoundationIncludes: Roger Needham, Infobox field and known_for, lead paragraphView the Source Wikipedia: Silvio Micali
Wikimedia FoundationIncludes: Silvio Micali, Infobox field and known_for, lead paragraphView the Source Martín Abadi (Wikipedia)
Includes: Martin Abadi, Infobox field and known_for, lead paragraphView the Source Rafail Ostrovsky (Wikipedia)
Includes: Rafail Ostrovsky, Infobox field and known_for, lead paragraphView the Source Ralph Merkle (Wikipedia)
Includes: Ralph Merkle, Infobox field and known_for, lead paragraphView the Source Victor Shoup (Wikipedia)
Includes: Victor Shoup, Infobox field and known_for, lead paragraphView the Source Vinod Vaikuntanathan (Wikipedia)
Includes: Vinod Vaikuntanathan, Infobox field and known_for, lead paragraphView the Source Wikipedia: Gilles Brassard
Wikimedia FoundationIncludes: Gilles Brassard, Infobox: known_forQuote, Includes: Gilles Brassard, Infobox: known_for
Quantum cryptography Quantum counting algorithm Quantum teleportation Quantum entanglement Quantum pseudo-telepathy Amplitude amplification Commitment scheme BB84 BHT algorithm
View the Source Wikipedia: I. J. Good
Includes: I. J. Good, Infobox: fieldsQuote, Includes: I. J. Good, Infobox: fields
Statistician, cryptologist
View the Source Mohamed M. Atalla (Wikipedia)
Includes: Mohamed M. Atalla, LeadQuote, Includes: Mohamed M. Atalla, Lead
Atalla (Arabic: محمد عطاالله; August 4, 1924, December 30, 2009) was an Egyptian-American engineer, physicist, cryptographer, inventor and entrepreneur.
View the Source Raluca Ada Popa (Wikipedia)
Includes: Raluca Ada Popa, LeadQuote, Includes: Raluca Ada Popa, Lead
Her research focuses on applied cryptography, including in the fields of healthcare and banking.
View the Source Charles Rackoff (Wikipedia)
Includes: Charles Rackoff, LeadQuote, Includes: Charles Rackoff, Lead
Charles Weill Rackoff is an American cryptologist and professor of computer science at the University of Toronto Mississauga.
View the Source Wikipedia: Advanced Encryption Standard Algorithm
Wikimedia FoundationIncludes: Advanced Encryption Standard Algorithm, LeadQuote, Includes: Advanced Encryption Standard Algorithm, Lead
The Advanced Encryption Standard (AES), also known by its original name Rijndael (Dutch pronunciation: [ˈrɛindaːl], RAIN-dahl), is a specification for the encryption of electronic data established by the US National Institute of Standards and Technology (NIST) in 2001. AES is a variant of the Rijndael block cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process.
View the Source Wikipedia: RC4 Algorithm
Wikimedia FoundationIncludes: RC4 Algorithm, LeadQuote, Includes: RC4 Algorithm, Lead
In cryptography, RC4 (also known as ARC4 or ARCFOUR, meaning Alleged RC4, see below) is a stream cipher.
View the Source Bcrypt (Wikipedia)
Includes: Bcrypt Algorithm, LeadQuote, Includes: Bcrypt Algorithm, Lead
bcrypt is a password-hashing function designed by Niels Provos and David Mazières.
View the Source Threefish (Wikipedia)
Includes: Threefish Algorithm, LeadQuote, Includes: Threefish Algorithm, Lead
Threefish is a symmetric-key tweakable block cipher designed as part of the Skein hash function, an entry in the NIST hash function competition.
View the Source RC5 (Wikipedia)
Includes: RC5 Algorithm, LeadQuote, Includes: RC5 Algorithm, Lead
In cryptography, RC5 is a symmetric-key block cipher notable for its simplicity.
View the Source RC6 (Wikipedia)
Includes: RC6 Algorithm, LeadQuote, Includes: RC6 Algorithm, Lead
In cryptography, RC6 is a symmetric key block cipher derived from RC5.
View the Source Kuznyechik (Wikipedia)
Includes: Kuznyechik Algorithm, LeadQuote, Includes: Kuznyechik Algorithm, Lead
Kuznyechik (Russian for 'Grasshopper'; Cyrillic script: Кузнечик) is a symmetric block cipher.
View the Source MD5, Wikipedia
Includes: MD5 Algorithm, LeadQuote, Includes: MD5 Algorithm, Lead
The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value. MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and was specified in 1992 as RFC 1321. MD5 can be used as a checksum to verify data integrity against unintentional corruption.
View the Source Shamir's secret sharing (Wikipedia)
Includes: Shamir's Secret Sharing Algorithm, LeadQuote, Includes: Shamir's Secret Sharing Algorithm, Lead
Shamir's secret sharing (SSS) is an efficient secret sharing algorithm for distributing private information (the "secret") among a group, first developed by Adi Shamir in 1979.
View the Source Caesar cipher (Wikipedia)
Includes: Caesar Cipher Algorithm, LeadQuote, Includes: Caesar Cipher Algorithm, Lead
A Caesar cipher is one of the simplest and most widely known encryption techniques used in cryptography.
View the Source Serpent (cipher) (Wikipedia)
Includes: Serpent (cipher), Lead
Serpent is a symmetric key block cipher that was a finalist in the Advanced Encryption Standard (AES) contest, in which it ranked second to Rijndael.
Includes: Serpent Algorithm, Lead
Serpent is a symmetric key block cipher that was a finalist in the Advanced Encryption Standard (AES) contest, in which it ranked second to Rijndael.
View the SourceFEAL (Wikipedia)
Includes: FEAL, LeadQuote, Includes: FEAL, Lead
In cryptography, FEAL (the Fast data Encipherment Algorithm) is a block cipher proposed as an alternative to the Data Encryption Standard (DES), and designed to be much faster in software.
View the Source Proof of work (Wikipedia)
Includes: Proof of work, LeadQuote, Includes: Proof of work, Lead
Proof of work (also written as proof-of-work, and abbreviated PoW) is a form of cryptographic proof in which one party (the prover) proves to others (the verifiers) that a certain amount of a specific computational effort has been expended.
View the Source Beaufort cipher (Wikipedia)
Includes: Beaufort cipher, LeadQuote, Includes: Beaufort cipher, Lead
The Beaufort cipher, created by Sir Francis Beaufort, is a substitution cipher similar to the Vigenère cipher, with a slightly modified enciphering mechanism and tableau.
View the Source GOST (block cipher) (Wikipedia)
Includes: GOST (block cipher), LeadQuote, Includes: GOST (block cipher), Lead
The GOST block cipher (Magma), defined in the standard GOST 28147-89, is a Soviet and Russian government standard symmetric key block cipher with a block size of 64 bits.
View the Source Lucifer (cipher) (Wikipedia)
Includes: Lucifer (cipher), LeadQuote, Includes: Lucifer (cipher), Lead
In cryptography, Lucifer was the name given to several of the earliest civilian block ciphers, developed by Horst Feistel and his colleagues at IBM.
View the Source Solitaire (cipher) (Wikipedia)
Includes: Solitaire (cipher), LeadQuote, Includes: Solitaire (cipher), Lead
The Solitaire cryptographic algorithm was designed by Bruce Schneier at the request of Neal Stephenson for use in his novel Cryptonomicon, in which field agents use it to communicate securely without having to rely on electronics or having to carry incriminating tools.
View the Source Camellia (cipher) (Wikipedia)
Includes: Camellia Algorithm, LeadQuote, Includes: Camellia Algorithm, Lead
In cryptography, Camellia is a symmetric key block cipher with a block size of 128 bits and key sizes of 128, 192 and 256 bits.
View the Source Whirlpool (hash function) (Wikipedia)
Includes: Whirlpool Algorithm, LeadQuote, Includes: Whirlpool Algorithm, Lead
In computer science and cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function.
View the Source Vincent Rijmen (Wikipedia)
Includes: Vincent Rijmen, LeadQuote, Includes: Vincent Rijmen, Lead
Vincent Rijmen (Dutch pronunciation: [ˈvɪnsɛnt ˈrɛimə(n)]; born 16 October 1970) is a Belgian cryptographer and one of the two designers of the Rijndael, the Advanced Encryption Standard.
View the Source Amit Sahai (Wikipedia)
Includes: Amit Sahai, LeadQuote, Includes: Amit Sahai, Lead
Amit Sahai (born 1974) is an Indian-American computer scientist and cryptographer.
View the Source Wang Xiaoyun (Wikipedia)
Includes: Xiaoyun Wang, LeadQuote, Includes: Xiaoyun Wang, Lead
Wang Xiaoyun (simplified Chinese: 王小云; traditional Chinese: 王小雲; pinyin: Wáng Xiǎoyún; born 1966) is a Chinese cryptographer, mathematician, and computer scientist.
View the Source Tal Rabin (Wikipedia)
Includes: Tal Rabin, LeadQuote, Includes: Tal Rabin, Lead
She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J.
View the Source Eli Biham (Wikipedia)
Includes: Eli Biham, LeadQuote, Includes: Eli Biham, Lead
Eli Biham (Hebrew: אלי ביהם) is an Israeli cryptographer and cryptanalyst who is a professor at the Technion - Israel Institute of Technology Computer Science department.
View the Source Claus P. Schnorr (Wikipedia)
Includes: Claus Schnorr, LeadQuote, Includes: Claus Schnorr, Lead
Claus Peter Schnorr (4 August 1943-8 June 2025) was a German mathematician and cryptographer.
View the Source Ivan Damgård (Wikipedia)
Includes: Ivan Damgård, LeadQuote, Includes: Ivan Damgård, Lead
Ivan Bjerre Damgård (born 1956) is a Danish cryptographer and currently a professor at the Department of Computer Science, Aarhus University, Denmark.
View the Source Jean-Jacques Quisquater (Wikipedia)
Includes: Jean-Jacques Quisquater, LeadQuote, Includes: Jean-Jacques Quisquater, Lead
Jean-Jacques Quisquater (born 13 January 1945) is a Belgian cryptographer and a professor at the University of Louvain (UCLouvain).
View the Source Moni Naor (Wikipedia)
Includes: Moni Naor, LeadQuote, Includes: Moni Naor, Lead
He works in various fields of computer science, mainly the foundations of cryptography.
View the Source Vigenère cipher (Wikipedia)
Includes: Vigenere Cipher Algorithm, LeadQuote, Includes: Vigenere Cipher Algorithm, Lead
The Vigenère cipher (French pronunciation: [viʒnɛːʁ]) 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.
View the Source Polybius square (Wikipedia)
Includes: Polybius square, LeadQuote, Includes: Polybius square, Lead
The device is used for fractionating plaintext characters so that they can be represented by a smaller set of symbols, which is useful for telegraphy, steganography, and cryptography.
View the Source Wikipedia: Diffie-Hellman key exchange
Wikimedia FoundationIncludes: Diffie-Hellman Key Exchange Algorithm, LeadQuote, Includes: Diffie-Hellman Key Exchange Algorithm, Lead
Diffie-Hellman (DH) key exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel.
View the Source Don Coppersmith (Wikipedia)
Includes: Don Coppersmith, LeadQuote, Includes: Don Coppersmith, Lead
1950) is a cryptographer and mathematician.
View the Source David Chaum (Wikipedia)
Includes: David Chaum, LeadQuote, Includes: David Chaum, Lead
David Lee Chaum (born 1955) is an American computer scientist, cryptographer, and inventor.
View the Source James Massey (Wikipedia)
Includes: James L. Massey, LeadQuote, Includes: James L. Massey, Lead
James Lee Massey (February 11, 1934, June 16, 2013) was an American information theorist and cryptographer, Professor Emeritus of Digital Technology at ETH Zurich.
View the Source Arjen Lenstra (Wikipedia)
Includes: Arjen K. Lenstra, LeadQuote, Includes: Arjen K. Lenstra, Lead
Arjen Klaas Lenstra (born 2 March 1956, in Groningen) is a Dutch mathematician, cryptographer and computational number theorist.
View the Source Johannes Buchmann (Wikipedia)
Includes: Johannes Buchmann, LeadQuote, Includes: Johannes Buchmann, Lead
He is known for his research in algorithmic number theory, algebra, post-quantum cryptography and IT security.
View the Source Joan Feigenbaum (Wikipedia)
Includes: Joan Feigenbaum, LeadQuote, Includes: Joan Feigenbaum, Lead
She is the Grace Murray Hopper Professor of Computer Science at Yale University and an Amazon Scholar in the AWS Cryptography group.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.