A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

Type to find tags:
× 61
unique (usually random) data passed into a hash function for password storage to avoid the possible usage of rainbow tables or similar attacks. Salt will not help against dictionary or brute f…
× 30
(or substitution boxes), components in many block ciphers used to substitute parts of the data in a non-linear way. While often fixed by the algorithm (like in DES and AES), sometimes they are key-dep…
× 4
The Schnorr Identification Protocol relies upon the security of the Discrete Logarithm Problem. Schnorr's protocol was introduced after, and is comparable to, the identification protocol of Fiat and S…
× 14
A digital signature algorithm based on the discrete logarithm problem, provably secure in the random oracle model.
× 26
A slow and memory-intensive hash function designed for passwords
× 3
× 72
Secret sharing refers to splitting a secret among multiple parties so that together they can reconstruct it. All parties, or just a threshold number of them, can be required for reconstruction. If few…
× 6
× 2
× 6
Secure storage describes storing resources in a secure way, so that they are only available to authorized users and trusted networks.
× 36
Questions about formal definitions of "security" for various cryptographic schemes (e.g. perfect secrecy, semantic security, ciphertext indistinguishability, etc.)
× 18
produces ciphertext that, by itself, does not reveal information about the original message besides its length
× 11
A symmetric block cipher algorithm with a 128 bit block size, and key sizes up to 256 bits.
× 65
a hash function that will soon be two generations old. It is no longer considered secure and should only be used for backward compatibility.
× 34
a family of cryptographic hash functions designed by the NSA and published by NIST in 2001. The family includes various output lengths (224, 256, 384, and 512 bits).
× 71
part of the SHA-2 family of hash functions with a 256-bit output and a 128-bit security level.
× 26
a cryptographic hash function standardized by NIST as a new alternative to the SHA-2 hash function family.
SHA-3 Competition (2007-2012) was a competition initiated by NIST as a call for a new cryptographic hash algorithm for standardization purposes.
× 15
part of the SHA-2 family of hash functions with a 512-bit output and a 256-bit security level.
× 34
a threshold secret sharing scheme based on polynomial interpolation over a finite field.
× 24
attacks using information leaked by implementations of cryptographic algorithms to obtain information about keys or (plaintext) data, instead of (or additional to) using cryptographic weaknesses.
× 239
Algorithms and protocols for creating signatures to documents, and verifying such signatures. These are normally asymmetric, for symmetric signatures see [mac].
× 4
A family of lightweight symmetric block-ciphers designed for good performance in hardware with block sizes ranging from 32 to 128 bits and key sizes ranging from 64 to 256 bits.
× 3
a two-pass AEAD block cipher mode of operation described in RFC 5297. It can be used either for key-wrap (nonce-less deterministic authenticated encryption) or…
× 5
a cryptographic hash function. It was designed for the SHA-3 competition where it became a finalist, but wasn't chosen as SHA-3.
× 2
a 64-bit block cipher developed by the U.S. National Security Agency (NSA).
× 3
Secure/Multipurpose Internet Mail Extensions, or short S-MIME, is a standard for public key encryption and signing of MIME data.
× 8
the deliberate act of creating obfuscated code by making source or machine code difficult to understand from a human point of view.
× 2
A family of lightweight symmetric block-ciphers designed for good performance in constrained software devices with block sizes ranging from 32 to 128 bits and key sizes ranging from 64 to 256 bits.
× 13
a construction scheme for hash functions (and other symmetric primitives) based on an unkeyed permutation. The most famous example is Keccak, which won the SHA-3 competitio…