Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer...

Most cryptographic hash functions are designed to take a string of any length as input and produce a fixed-length hash value. A cryptographic hash function...

work in cryptography concerns cryptographic primitives—algorithms with basic cryptographic properties—and their relationship to other cryptographic problems...

In cryptography, security level is a measure of the strength that a cryptographic primitive — such as a cipher or hash function — achieves. Security level...

In cryptographic protocol design, cryptographic agility or crypto-agility is the ability to switch between multiple cryptographic primitives. A cryptographically...

Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or...

A cryptographic protocol is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences...

stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be...

Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of...

to the recipient. Digital signatures are a standard element of most cryptographic protocol suites, and are commonly used for software distribution, financial...

types of keys in cryptographic systems are symmetric-key and public-key (also known as asymmetric-key). Many complex cryptographic algorithms often use...

it suitable for use in cryptography. It is also referred to as a cryptographic random number generator (CRNG). Most cryptographic applications require random...

In cryptography, an initialization vector (IV) or starting variable is an input to a cryptographic primitive being used to provide the initial state....

Strong cryptography or cryptographically strong are general terms used to designate the cryptographic algorithms that, when used correctly, provide a very...

Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms...

which combined confidentiality and data integrity into a single cryptographic primitive (an encryption algorithm). These combined modes are referred to...

(or its version after key stretching) are concatenated and fed to a cryptographic hash function, and the output hash value is then stored with the salt...

with other cryptographic primitives); in this case they are described as universal hash functions. Among the typical uses of non-cryptographic hash functions...

RSA algorithm for public-key cryptography. It defines the mathematical properties of public and private keys, primitive operations for encryption and...

The Cryptographic Message Syntax (CMS) is the IETF's standard for cryptographically protected messages. It can be used by cryptographic schemes and protocols...

is as hard as solving the hard problem underlying the primitive. Even if perfect cryptographic routines are used, the attacker can gain knowledge of the...

Public-Key Cryptography Standards (PKCS) #7: Cryptographic Message Syntax Specification Version 1.5, March 1998 RFC 2630 - Cryptographic Message Syntax...

In cryptography, the white-box model refers to an extreme attack scenario, in which an adversary has full unrestricted access to a cryptographic implementation...

can be used to build other cryptographic primitives, such as those below. For these other primitives to be cryptographically secure, care has to be taken...

In cryptography, black-box obfuscation was a proposed cryptographic primitive which would allow a computer program to be obfuscated in a way such that...

Multivariate cryptography is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over a finite field F {\displaystyle...

returns a fixed length of bits. Although hash algorithms, especially cryptographic hash algorithms, have been created with the intent of being collision...

algorithm was granted to MIT on 20 September 1983: U.S. patent 4,405,829 "Cryptographic communications system and method". From DWPI's abstract of the patent:...

Benchmarking of Cryptographic Hashes – measurements of hash function speed on various platforms The ECRYPT Hash Function Website – A wiki for cryptographic hash...

1991. L. Brown, Josef Pieprzyk and Jennifer Seberry, "LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications", in Advances in Cryptology...