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:
× 42
In identity-based encryption (IBE) the public key of a user $A$ is some identity string $ID_A$, e.g., an email address. To encrypt a message for this user there is no need to retrieve an authentic cop…
× 42
A public-key cryptosystem invented by Pascal Paillier in 1999.
× 42
Confidentiality in a very strong sense. Ciphers reaching perfect-secrecy can't be broken to disclose informations over the plaintext from the ciphertext, even with unlimited computing power. The most …
× 41
an encryption algorithm which is based on the shortest vector problem in a lattice.
× 40
Multiple encryption means encrypting a message two or more times using either the same, or a different algorithm.
× 40
an algorithm for producing digital signatures. The algorithm is based on Edwards curves introduced by Bernstein et al. (2007) and named after mathematician Harold M. Edwards.
× 40
the reduction in size of data without losing information.
× 40
side channel attack based on the different speed at which certain operations are executed.
× 40
a cryptographic hash function standardized by NIST as a new alternative to the SHA-2 hash function family.
× 39
a function that cannot be distinguished (with practical effort) from a permutation selected at random with uniform probability from the family of all permutations …
× 38
Questions on the meaning, history, and usage of symbols and notation in cryptography. Please remember to mention where (book, paper, webpage, etc.) you encountered any notation you are asking about.
× 38
an active attack where the attacker is able to interpose himself between the sender and receiver. The attacker may monitor and/or modify some or all of the messag…
× 38
a type of public-key encryption in which the key used for encryption is based on selected attributes of the readers. Decryption of the ciphertext is possible only if the …
× 35
A structured set of data held in a computer, esp. one that is accessible in various ways.
× 35
A slow and memory-intensive hash function designed for passwords
× 35
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…
× 34
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.
× 34
a protocol where one party commits themselves to a secret value without revealing it. At a later point, the value can be revealed.
× 33
History of cryptography and cryptanalysis. Questions that wish to ask about the history of cryptography should use this tag; if you're asking about historical ciphers you may also wish to use the clas…
× 33
a modern cryptographic protocol for password authenticated key exchange (PAKE). It provides some desireable properties, like a passive eavesdropper being unabl…
× 32
the art and science of writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message. While cryptography prot…
× 32
produces ciphertext that, by itself, does not reveal information about the original message besides its length
× 32
an encryption algorithm that can be used as a replacement for the DES or IDEA algorithms. Blowfish was designed in 1993 by Bruce Schneier as an alternative to existing encryption algorithm…
× 31
a sequence of bytes or bits, having a fixed length (the block-size).
× 31
a digital peer-to-peer currency with no central authority. It was created in 2009 by Satoshi Nakamoto. Transactions are managed entirely by the network.
× 31
based on a mathematical problem that is moderate hard to solve but easy to verify.
× 30
a family of stream ciphers built on a pseudo-random function.
× 30
part of the SHA-2 family of hash functions with a 512-bit output and a 256-bit security level.
× 29
a cryptographic hash function designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche.
× 29
Difficulty of finding another input string that hashes to the same value as a given string
× 29
a method of hierarchically hashing data. They allow efficient parallel hashing and updates and the possibility of verifying partial data.
× 28
A security property wherein past messages are protected against future compromise of the master keys.
× 28
Anonymity describes the state of being unknown or unacknowledged.
× 28
the process of generating keys for cryptographic purposes.
× 28
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…
× 27
a known plaintext attack and uses a linear approximation to describe the behavior of the block cipher. Given sufficient pairs of plaintext and corresponding ciphertext, bits of…