Theory of cryptography

In mathematics, a semiprime is a natural number that is the product of exactly two prime numbers. The two primes in the product may equal each other, so the semiprimes include the squares of prime numbers. Because there are infinitely many prime numbers, there are also infinitely many semiprimes. Semiprimes are also called biprimes, since they include two primes, or second numbers, by analogy with how "prime" means "first". Alternatively semiprimes are called almost-prime numbers, specifically the "2-almost-prime" biprime and "3-almost-prime" triprime.

prime number p where 2p+1 is also prime

providing validity without revealing any other data

prime number of the form 2p+1 where p is also prime

type of function that is easy to compute in one direction, yet difficult to compute in the opposite direction without special information

oracle that responds to every unique query with a (truly) random response chosen uniformly from its output domain

statistical privacy protection mechanism

subfield of cryptography

security of a cryptosystem which derives purely from information theory

security guarantee in which any probabilistic polynomial-time algorithm (PPTA) given the ciphertext and the message length can’t find any information on the message with probability nonnegligibly higher than a PPTA only given the message length

class of algorithms with finite internal state that take an input bit stream of any length and produce an output bit stream of any desired length that can be used to model or implement many cryptographic primitives

computer security method

information retrieval husing cryptography

type of prime number

Property of some cryptosystems

collection of efficiently-computable functions which emulate a random oracle

algorithm for finding a basis of short vectors in a lattice

method for implementing fingerprints using polynomials over a finite field, proposed by Michael O. Rabin

in information security

Cryptographic technique

property of some cryptographic algorithms

set of rules for defining and analyzing information exchange protocols

property of cryptographic hash functions

hypothesis in computational complexity theory

secure multi-party computation problem introduced in 1982 by Andrew Yao: two millionaires wish to know which of them is richer without revealing their actual wealth

concept in cryptography