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.
bcrypt is an intentionally slow hash algorithm specially designed for passwords.
A hash tree (or Merkle tree) is a method of hierarchically hashing data. They allow efficient parallel hashing and updates and the possibility of verifying partial data.
A block is a sequence of bytes or bits, having a fixed length (the block-size).
Salsa20 by Daniel J. Bernstein is a family of stream ciphers built on a pseudo-random function.
should be used for questions regarding the function and use of proof-of-work systems and proof-of-work algorithms. Proof of work describes a decentralized consensus system based on an arbitra…
"The sodium crypto library". A cryptographic multi-language-library with support for many modern cryptographic primitives, that is a fork of the NaCl library. The library focuses on providing easy-to-…
Compression is the reduction in size of data without losing information.
A digital signature scheme based on the discrete logarithm problem, published by Taher ElGamal in 1984. Not to be confused with the ElGamal encryption system.
A slow and memory-intensive hash function designed for passwords
Verifiable encryption is an encryption scheme where one can prove some property of a message m, while the message is given in an encrypted form. When an encryption scheme is secure, the encryption E(m…
A structured set of data held in a computer, esp. one that is accessible in various ways.
Anonymity describes the state of being unknown or unacknowledged.
The Secure Socket Shell (SSH) protocol is an authentication protocol (described in RFC 4252) for securely getting access to a remote computer.
A distinguisher describes an adversary's advantage. In cryptography, an adversary's advantage is a measure of how successfully it can attack a cryptographic algorithm, by distinguishing it from an ide…
Statistical testing is used to estimate the likelihood of a hypothesis given a set of data. In cryptanalysis, statistical testing is commonly used to detect non-randomness in the data, e.g. distinguis…
Forgery is the process of making, adapting, or imitating objects, statistics, or documents with the intent to deceive. Use this tag on questions revolving around creating a forgery for a specific encr…
The meet-in-the-middle attack is an optimized brute-force attack that significantly reduces the number of keys the attacker needs to try by utilizing a time-space trade-off. Work is done from the begi…
Poly1305-AES is a cryptographic message authentication code (MAC) written by Daniel J. Bernstein. It can be used to verify the data integrity and the authenticity of a message.
Differential privacy aims to provide means to maximize the accuracy of queries from statistical databases while minimizing the chances of identifying its records.
Secure storage describes storing resources in a secure way, so that they are only available to authorized users and trusted networks.
Difficulty of finding another input string that hashes to the same value as a given string
The Enigma Machine was a piece of cryptographic hardware used by the German military during World War II; successful cryptanalysis was routinely applied against it and the scheme was considered broken…
A security property wherein past messages are protected against future compromise of the master keys.
Garbled Circuits are used in Secure Multiparty Computation
An adversary model formally defines the power of the adversary. It includes specifics whether the adversary is deterministic/randomized, uniform/non-uniform, interactive/non-interactive and how he int…
Optimal Asymmetric Encryption Padding is a padding scheme for RSA, codifying how short plaintext is enciphered and deciphered. It has a security reduction to the RSA problem.
A side-channel attack on implementations of encryption modes that use padding (e.g. ECB, CBC) that uses information leaked during decryption of tampered ciphertext values to derive information about t…
Questions about the branch of mathematics concerned with modeling and analyzing random phenomena.
In a blind signature scheme, the signer does not know what he is signing. This is an important building block of anonymous voting or digital cash schemes, because it allows an authority to control the…
A deterministic encryption scheme is a cryptosystem which always produces the same ciphertext for a given plaintext and key, even over separate executions of the encryption algorithm.
A trapdoor function is a function that is easy to perform one way, but has a secret that is required to perform the inverse calculation efficiently.
A key schedule is an algorithm that expands a relatively short master key to a relatively large expanded key for later use in an encryption and decryption algorithm.
Information theory is concerned with sending messages via electronic signals in the most efficient and error-free way.
A test vector is a set of inputs used to test new and/or established cryptographic designs and/or implementations.
Voting is a method for a group such as a meeting or an electorate to make a decision or express an opinion.
A length extension attack on a hash or message authentication code function, which allows extra information to be added to the input message without changing the output value.