Algorithm
•
Cryptography
Cryptographic algorithms
Advanced Access Content System
•
Asymmetric-key algorithms
•
Broken cryptography algorithms
•
Cryptographic hash function
•
Cryptographically secure pseudorandom number generators
•
Information-theoretically secure algorithms
•
Integer factorization
•
Primality test
•
Symmetric-key algorithms
•
Type 1 encryption algorithms
Advanced Access Content System
The Advanced Access Content System (AACS) is a standard for content distribution and digital rights management, intended to restrict access to and copying of the post-DVD generation of optical discs. ...
Asymmetric-key algorithms
Broken cryptography algorithms
Cryptographic hash function
A cryptographic hash function is a hash function which is considered practically impossible to invert, that is, to recreate the input data from its hash value alone. These one-way hash functions have ...
Cryptographic hash function - Wikipedia
Cryptographically secure pseudorandom number generators
Information-theoretically secure algorithms
Integer factorization
In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers. If these integers are further restricted to prime numbers, the process is called ...
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 no...
Symmetric-key algorithms
Type 1 encryption algorithms
IAPM (mode)
Integrity Aware Parallelizable Mode (IAPM) is a mode of operation for cryptographic block ciphers. As its name implies, it allows for a parallel mode of operation for very high throughput.
IAPM w...
KR advantage
In cryptography, the key-recovery advantage (KR advantage) of a particular algorithm is a measure of how effective an algorithm can mount a key-recovery attack. Consequently, the maximum key-recovery ...
Adleman–Pomerance–Rumely primality test
CCM mode
CCM mode (Counter with CBC-MAC) is a mode of operation for cryptographic block ciphers. It is an authenticated encryption algorithm designed to provide both authentication and confidentiality. CCM m...
Crypt (C)
Crypt (C) - Wikipedia
ISAAC (cipher)
ISAAC (indirection, shift, accumulate, add, and count) is a cryptographically secure pseudorandom number generator and a stream cipher designed by Robert J. Jenkins Jr. in 1996.
The ISAAC algorith...
40-bit encryption
40-bit encryption refers to a key size of forty bits, or five bytes, for symmetric encryption; this represents a relatively low level of security. A forty bit length corresponds to a total of 2 possib...
Shamir's Secret Sharing
Shamir's Secret Sharing is an algorithm in cryptography created by Adi Shamir. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where...
Shamir's Secret Sharing - Wikipedia
Elliptic curve primality testing
In mathematics elliptic curve primality testing techniques are among the quickest and most widely used methods in primality proving. It is an idea forwarded by Shafi Goldwasser and Joe Kilian in 1986 ...
Elliptic curve primality testing - Wikipedia
Broken block ciphers
FORK-256
FORK-256 is a hash algorithm designed in response to security issues discovered in the earlier SHA-1 and MD5 algorithms. After substantial cryptanalysis, the algorithm is considered broken.
In 2...
Wired Equivalent Privacy
Wired Equivalent Privacy (WEP) is a security algorithm for IEEE 802.11 wireless networks. Introduced as part of the original 802.11 standard ratified in September 1999, its intention was to provide da...
CryptGenRandom
CryptGenRandom is a cryptographically secure pseudorandom number generator function that is included in Microsoft's Cryptographic Application Programming Interface. In Win32 programs, Microsoft recomm...
Reeds–Sloane algorithm
The Reeds–Sloane algorithm, named after J. A. Reeds and N. J. A. Sloane, is an extension of the Berlekamp–Massey algorithm, an algorithm for finding the shortest linear feedback shift register (LFSR) ...
EAX mode
EAX mode is a mode of operation for cryptographic block ciphers. It is an Authenticated Encryption with Associated Data (AEAD) algorithm designed to simultaneously provide both authentication and pri...
Mental poker
Mental poker is the common name for a set of cryptographic problems that concerns playing a fair game over distance without the need for a trusted third party. The term is also applied to the theories...
Firefly (protocol)
Firefly is a U.S. National Security Agency public-key key exchange protocol, used in EKMS, the STU-III secure telephone, and several other U.S. cryptographic systems.
Avalanche effect
In cryptography, the avalanche effect refers to a desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions. The avalanche effect is evident if, when an ...
HAS-V
HAS-V is a cryptographic hash function with a variable output length. HAS-V is a hash function based on a block cipher. The hash function can produce hash values with lengths from 16 to 40 bytes.
...
Galois/Counter Mode
Galois/Counter Mode (GCM) is a mode of operation for symmetric key cryptographic block ciphers that has been widely adopted because of its efficiency and performance. GCM throughput rates for state of...
Galois/Counter Mode - Wikipedia