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:
× 215
creation of (real or pseudo) random numbers (or bits).
× 29
A model used in cryptographic security proofs, in which concrete primitives such as hash functions are replaced with a "random oracle": a hypothetical black box that maps its inputs to truly random ou…
a symmetric-key block cipher designed by Ron Rivest in 1987.
× 47
a fast and simple stream cipher used correctly in SSL and incorrectly in WEP.
a 128-bit block cipher, formerly an AES candidate, that makes heavy use of data-dependent rotations.
× 3
× 148
a request to be provided with (links to) documentation, official papers, and specs related to one or more specific algorithms or cryptographic procedures, to provide a trusted b…
× 2
Remote data checking protocols allow a client that has stored data at an untrusted server to efficiently verify that the server possesses the original data without retrieving it.
× 15
based on recording an encrypted and/or signed communication and replaying it at a later time.
× 5
material that can be referenced for further information on cryptography.
× 26
a family of symmetric block-ciphers with block and keys sizes of 128, 160, 192, 224, or 256 bits.
× 7
The RACE Integrity Primitives Evaluation Message Digest (RIPEMD) is a family of cryptographic hash functions.
× 656
an asymmetric (e.g. public-key) cryptosystem, based on modular exponentiation with big exponents and modulus. RSA can be used both for signature and encryption.
a variant of RSA, meant to increase the RSA public modulus size while keeping computation cost moderate.
× 10
a prime number of the form 2p + 1, where p is also a prime.
× 16
a stream cipher built on a pseudo-random function.
× 67
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…
× 38
(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…
× 5
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…
× 17
A digital signature algorithm based on the discrete logarithm problem, provably secure in the random oracle model.
× 27
A slow and memory-intensive hash function designed for passwords
× 5
a subfield of cryptography which constructs and analyzes cryptosystems that preserve the ability to 'search' over encrypted data, for some definition of 'search'.
× 78
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…
× 7 × 2
× 6
Secure storage describes storing resources in a secure way, so that they are only available to authorized users and trusted networks.
× 42
Questions about formal definitions of "security" for various cryptographic schemes (e.g. perfect secrecy, semantic security, ciphertext indistinguishability, etc.)
× 19
produces ciphertext that, by itself, does not reveal information about the original message besides its length
× 16
A symmetric block cipher algorithm with a 128 bit block size, and key sizes up to 256 bits.
× 78
a hash function that will soon be two generations old. It is no longer considered secure and should only be used for backward compatibility.
× 36
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).
× 80
part of the SHA-2 family of hash functions with a 256-bit output and a 128-bit security level.