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:
× 9
Pseudo-Random Generator
× 9
a symmetric cipher. In number theory, the Pohlig–Hellman algorithm sometimes is a special-purpose algorithm for computing discrete logarithms in a multiplicative gro…
× 9
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…
× 9
a set of inputs used to test new and/or established cryptographic designs and/or implementations.
× 9
A symmetric block-cipher algorithm with a 128-bit block size, and key sizes up to 256 bits.
× 9
a block cipher mode of operation, which is most commonly used when random accessible data (like a hard disk or RAM) is to be encoded.
× 8
a function that is easy to perform one way, but has a secret that is required to perform the inverse calculation efficiently.
× 8
the art of chopping a secret into little bits, so that the secret can only be learned by possessing more than a threshold number of those bits.
× 8
the deliberate act of creating obfuscated code by making source or machine code difficult to understand from a human point of view.
× 8
A rainbow table allows inverting a cryptographic function (typically, a hash) at low cost, after a precomputation.
× 8
a stream cipher built on a pseudo-random function.
× 8
× 8
A “Key Derivation Function” (KDF) derives one or more secret keys from a secret value such as a master key or other known information such as a password using a pseudo-random function.
× 8
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…
× 8
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 …
× 8
a form of cryptographic attack in which the attacker possesses only the encrypted message, with no corresponding plain text or segment of the key to work with.
× 8
A commutative encryption system allows a message encrypted with two different keys to be decrypted using the keys in either order.
× 8
Convergent encryption, also known as content hash keying, is simply encrypting a file using a symmetric encryption key which is the secure hash of the plaintext of the file.
× 8
a cryptosystem which always produces the same ciphertext for a given plaintext and key, even over separate executions of the encryption algorithm.
× 7
Coding theory studies the properties of codes and their fitness for specific applications, and typically involves the removal of redundancy and the detection and/or correction of errors in transmitted…
× 7
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…
× 7
The Counter with CBC Mac mode, an authenticated encryption mode of operation for a block cipher based on the CTR mode and the CBC-MAC algorithm. .
× 7
An authenticated encryption mode of operation for a block cipher, based on the CTR mode and the OMAC/CMAC MAC algorithm.
× 7
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…
× 7
Calculating the value of a function for given inputs, especially, in the context of secure multi-party computation and/or homomorphic encryption, without disclosing the inputs to some or all parties c…
× 7
"host-proof" means that no unencrypted or insecure data is stored on the server or passed over the network.
× 7
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.
× 7
Small and/or fast ciphers and other cryptographic primitives designed for use in constrained environments, such as embedded MCUs and smart cards.
× 7
the assurance that someone cannot deny something.
× 7
In a private set intersection (PSI) protocol two parties jointly compute the intersection of their private input sets.
× 7
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.
× 7
a family of permutations where the key selects a particular permutation from that family. With a tweakable blockcipher both key and tweak are used to select a permutation. So tweak a…
× 7
a method for a group such as a meeting or an electorate to make a decision or express an opinion.
× 7
In cryptography, white box analysis means extracting a secret value from an implementation of a function that uses the value.
× 6
A classical cipher in which the ciphertext is obtained by scrambling the letters of the plaintext.
× 6
a digraph substitution cipher. It employs a table where one letter of the alphabet is omitted, and the letters are arranged in a 5x5 grid.