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:
× 37
Using the same key for more than one purpose, e.g. to encrypt two messages or to encrypt and authenticate a message. Some cryptosystems may be vulnerable to attacks if keys are inappropriately reused.
× 4
Key rotation refers to a schedule or process for changing the key material.
× 214
usually secret information used as input to various kinds of cryptographic algorithms, like encryption, signature, MAC, to select the concrete transformation done by the algorithm.
× 9
an algorithm that expands a relatively short master key to a relatively large expanded key for later use in an encryption and decryption algorithm.
× 80
the size measured in bits of the key used in a cryptographic algorithm.
× 6 × 5
the problem of determining which numbers from a given collection of numbers have been added together to yield a specific sum: used in cryptography to encipher (and sometimes decipher) mess…
× 73
The attacker knows at least one sample of both the plain text and the cipher text.
× 22 × 17
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.
× 29
Linear Feedback Shift Register, a pseudorandom bit generator which can be efficiently implemented in hardware.
× 5
"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-…
× 8
a typically short alphanumeric code used as a software copy-protection mechanism, by requiring a user to enter a valid key before they can use the software.
× 8
Small and/or fast ciphers and other cryptographic primitives designed for use in constrained environments, such as embedded MCUs and smart cards.
× 18
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…
× 6
Literature describes everything that has been written and/or visualized (here: in relation cryptography), which ranges from papers to books, and from publications to presentations.
× 2
An attack on TLS and related protocols as of may 2015. This attack uses pre-computations to attack short prime diffie hellmann key exchange, primes with up to 1024 bits length are considered broken. I…
× 4
a Feistel cipher where in each round the nonlinear function used is assumed to be chosen uniformly at random from the set of all such functions. These ciphers are mainly of th…
× 2
× 177
(or message authentication code), a short piece of information used to authenticate a message, and the algorithm to create and check such information, using a secret key.
× 19
said to be malleable if it is feasible to modify ciphertext to produce meaningful changes in the corresponding plaintext without knowing the encryption key.
× 26
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…
a 128-bit block cipher with variable key size of between 128 and 448 bits. It has a heterogeneous structure: several rounds of a cryptographic core are “jacketed” by un-keyed mixing rounds, to…
× 11
Matrix multiplication indicates a row-by-column multiplication, where the entries in the Xth row of A are multiplied by the corresponding entries in the Yth column of B and then adding the results.
× 17
an asymmetric encryption algorithm and is a candidate for "post-quantum cryptography", as it is immune to attacks using Shor's algorithm and — more generally — measuring coset…
RFC 1319 — The MD2 Message-Digest Algorithm is a cryptographic hash function which is no longer considered secure.
× 4
RFC 1320 — the MD4 message-digest algorithm — is a cryptographic hash function with a digest length is 128 bits, developed by Ronald Rivest in 1990.
× 86
a hash function that is no longer considered secure from a cryptographic point of view. Therefore, it should only be used for backward compatibility.
× 22
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…
× 2
a property that, if proven to be possesed, makes an algorithm "immune" to time-memory tradeoffs, by "punishing" memory reductions. Usually algorithms possesing this property can't e…
× 7
the common description for a set of cryptographic problems related to playing a fair game over a distance without the need for any trusted third party.
× 16
The Merkle–Damgård construction — used in the design of many popular hash algorithms such as MD5, SHA1 and SHA2 — is a method of building collision-resistant cryptographic hash functions from collisio…
× 3
to "scramble" or mix the internal state of a hash (or cipher) function. The input to the function is the current internal state and the output of the function bec…