# Tags

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:
 permutation× 38 A way, esp. one of several possible variations, in which a set or number of things can be ordered or arranged. pgp× 64 The OpenPGP encrypted data format (RFC 4880), and its implementations PGP and GnuPG. pir× 3 A PIR (Private Information Retrieval) protocol allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved. pkcs11× 12 PKCS #11 (Public-Key Cryptography Standard 11) defines a platform-independent API to cryptographic tokens, such as hardware security modules (HSM) and smart cards called *Cryptoki*. pkcs8× 2 Public-Key Cryptography Standard, number 8, describes the Private-Key Information Syntax Standard which is used to carry (encrypted or unencrypted) private certificate keypairs. See [RFC 5208](http://… pke pki× 34 short for Public Key Infrastructure. The foundation of a PKI is the certificate authority (CA), which issues digital certificates that authenticate the identity of organizations and individuals… plausible-deniability× 3 Plausible deniability may refer $1)$ to deniable encryption schemes allowing to decrypt a ciphertext for a message $m$ to some distinct message $m'$ or $2)$ to a feature provided by deniable file syst… playfair× 9 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. pohlig-hellman× 11 a symmetric cipher. In number theory, the Pohlig–Hellman algorithm sometimes is a special-purpose algorithm for computing discrete logarithms in a multiplicative gro… poly1305× 9 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. post-quantum-cryptography× 69 Cryptography that will remain secure should large-scale quantum computing become feasible. Based on hard problems with no known polynomial-time quantum algorithm (e.g., Shor's algorithm). predicate-encryption× 4 an encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. preimage-resistance× 27 Difficulty of finding an input string that hashes to a given value prf prg× 11 Pseudo-Random Generator prime-numbers× 107 an integer greater than 1 with no divisors other than itself and 1. Primes and prime products play an important role in public key cryptography. primitives private-set-intersection× 10 In a private set intersection (PSI) protocol two parties jointly compute the intersection of their private input sets. prng proof-of-work× 23 based on a mathematical problem that is moderate hard to solve but easy to verify. protocol-analysis× 46 the detailed analysis of the security of an abstract or concrete cryptographic protocol. protocol-design× 243 Design of cryptographic protocols, i.e. ways of using algorithms (primitives) to achieve one or more security goals like integrity, confidentiality, authenticity (maybe together with non-security-rela… provable-security× 149 A primitive or protocol with provable security is accompanied by a mathematical proof that shows how to reduce the security claims about the protocol to a set of assumptions. proxy-re-encryption× 5 prp pseudo-random-function× 66 an efficiently-computable function which emulates a random oracle. pseudo-random-generator× 66 In cryptography, a pseudo-random generator (PRG) is a deterministic procedure that maps a random seed to a longer pseudo-random string such that no statistical test can distinguish between the output … pseudo-random-permutation× 21 a function that cannot be distinguished (with practical effort) from a permutation selected at random with uniform probability from the family of all permutations … public-key× 493 an encryption scheme using a pair of keys, one to encrypt and a second to decrypt a message. A special class of asymmetric ciphers are public-key ciphers, in which the encrypti… public-private-key-pair quadratic-residuosity× 11 A residue of order 2. A number $a$ for which the congruence $x^2 ≡ a \pmod m$ has a solution is called a quadratic residue modulo $m$. quantum-cryptography× 23 Quantum cryptography describes the use of quantum mechanical effects to perform cryptographic tasks or to break cryptographic systems. rabin-cryptosystem× 7 A public-key cryptosystem based on squaring modulo the product of two primes, introduced in 1979 by Michael O. Rabin and proven to have security reducible to the hardness of integer factorization. rainbow-table× 12 A rainbow table allows inverting a cryptographic function (typically, a hash) at low cost, after a precomputation. randomness× 98 Usage of randomness (i.e. non-predictable data, usually in the form of bits or numbers) for cryptographic purposes.