All Cryptographic Techniques

create hard-to-trace communications by using a chain of proxy servers known as mixes

Ascon is a family of lightweight authenticated ciphers and hash functions that have been selected by the U.S. National Institute of Standards and Technology (NIST) for cryptography on resource-constrained devices in 2025

Fortuna is a cryptographically secure pseudorandom number generator (CS-PRNG) devised by Bruce Schneier and Niels Ferguson and published in 2003.

The Yarrow algorithm is a family of cryptographic pseudorandom number generators (CSPRNG) devised by John Kelsey, Bruce Schneier, and Niels Ferguson and published in 1999.

In cryptography, a product cipher combines two or more transformations in a manner intending that the resulting cipher is more secure than the individual components

Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys.

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.

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.

The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value.

Diffie-Hellman (DH) key exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel.

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

A digital signature is a mathematical scheme for verifying the authenticity of digital messages or documents.

In cryptography, a zero-knowledge proof (also known as a ZK proof or ZKP) is a protocol in which one party (the prover) can convince another party (the verifier) that some given statement is true, without conveying to the verifier any information beyond the mere fact of that statement's truth.

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.