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:
× 6
material that can be referenced for further information on cryptography.
× 6
concerned with sending messages via electronic signals in the most efficient and error-free way.
× 6
The International Data Encryption Algorithm (IDEA) is a block cipher developed in 1991 by James Massey and Xuejia Lai.
× 6
× 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.
× 6 × 6
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.
× 6
× 6
Wi-Fi Protected Access 2 - Pre-Shared Key (also called WPA or WPA2 Personal) is a method of securing your network using WPA2 with the use of the optional Pre-Shared Key (PSK) authentication, which was…
× 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…
× 5
a subfield of cryptography which constructs and analyzes cryptosystems that preserve the ability to 'search' over encrypted data, for some definition of 'search'.
× 5
A family of lightweight symmetric block-ciphers designed for good performance in hardware with block sizes ranging from 32 to 128 bits and key sizes ranging from 64 to 256 bits.
× 5
a two-pass AEAD block cipher mode of operation described in RFC 5297. It can be used either for key-wrap (nonce-less deterministic authenticated encryption) or…
× 5
Secure/Multipurpose Internet Mail Extensions, or short S-MIME, is a standard for public key encryption and signing of MIME data.
× 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…
× 5
× 5
Fixed, more or less arbitrary parameter values that appear in the definitions of cryptographic schemes, such as fixed initialization vectors for hash functions or S-box tables for block ciphers.
× 5
a variant of ID-based cryptography intended to prevent the key escrow problem. Only a partial private key is generated by the key generation center (KGC) and the other …
× 5
evident if, when an input is changed slightly (for example, flipping a single bit) the output changes significantly (e.g., half the output bits flip).
× 5
short for Dual Elliptic Curve Deterministic Random Bit Generator; a pseudorandom number generator based on the elliptic curve discrete logarithm problem.
× 5
Questions related to the teaching and learning of cryptography.
× 5
a computer system with a dedicated function within a larger mechanical or electrical system, often with real-time computing constraints.
× 5
× 4
a family of binary, linear error-correcting codes that are used to detect and correct data transmission errors. Hamming codes are able detect up to two simultaneous bit errors and ca…
× 4
× 4
Elliptic Curve Integrated Encryption Scheme (ECIES) is a public key encryption system proposed by Victor Shoup in 2001.
× 4
a 128-bit, symmetrical block cipher jointly developed by Mitsubishi and NTT of Japan.
× 4
The Offset CodeBook Mode, an authenticated encryption mode of operation for a block cipher.
× 4
an encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data.
× 4
A means of recovering cryptographic keys when the usual means for obtaining them is unavailable.; the ability to uncover the secret key to a cryptographic message.
× 4
"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-…
× 4
× 4
× 4
Needham–Schroeder refers to both, a symmetric key or a public key authentication protocol.
× 4
so unimportant, that it isn't worth considering. For example, if a flaw in a cryptographic algorithm is considered to be negligible, it is insignificant to both the …
× 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…