Table of Contents
25 relations: Confusion and diffusion, Convolution, Convolution theorem, Cryptographic hash function, Cryptography, Discrete Fourier transform over a ring, Fast Fourier transform, Finite field, Fourier series, Fourier transform, Ideal lattice, Lenstra–Lenstra–Lovász lattice basis reduction algorithm, Linear combination, National Institute of Standards and Technology, NIST hash function competition, Polynomial, Polynomial ring, Polynomial-time reduction, Prime number, Pseudorandom function family, Random oracle, Randomness extractor, Security of cryptographic hash functions, Universal hashing, Worst-case complexity.
Confusion and diffusion
In cryptography, confusion and diffusion are two properties of a secure cipher identified by Claude Shannon in his 1945 classified report A Mathematical Theory of Cryptography.
See SWIFFT and Confusion and diffusion
Convolution
In mathematics (in particular, functional analysis), convolution is a mathematical operation on two functions (f and g) that produces a third function (f*g).
Convolution theorem
In mathematics, the convolution theorem states that under suitable conditions the Fourier transform of a convolution of two functions (or signals) is the pointwise product of their Fourier transforms.
See SWIFFT and Convolution theorem
Cryptographic hash function
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n bits) that has special properties desirable for a cryptographic application. SWIFFT and cryptographic hash function are cryptographic hash functions.
See SWIFFT and Cryptographic hash function
Cryptography
Cryptography, or cryptology (from κρυπτός|translit.
Discrete Fourier transform over a ring
In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring.
See SWIFFT and Discrete Fourier transform over a ring
Fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT).
See SWIFFT and Fast Fourier transform
Finite field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements.
Fourier series
A Fourier series is an expansion of a periodic function into a sum of trigonometric functions.
Fourier transform
In physics, engineering and mathematics, the Fourier transform (FT) is an integral transform that takes a function as input and outputs another function that describes the extent to which various frequencies are present in the original function.
See SWIFFT and Fourier transform
Ideal lattice
In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices.
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982.
See SWIFFT and Lenstra–Lenstra–Lovász lattice basis reduction algorithm
Linear combination
In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants).
See SWIFFT and Linear combination
National Institute of Standards and Technology
The National Institute of Standards and Technology (NIST) is an agency of the United States Department of Commerce whose mission is to promote American innovation and industrial competitiveness.
See SWIFFT and National Institute of Standards and Technology
NIST hash function competition
The NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function called SHA-3 to complement the older SHA-1 and SHA-2. SWIFFT and NIST hash function competition are cryptographic hash functions.
See SWIFFT and NIST hash function competition
Polynomial
In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication and exponentiation to nonnegative integer powers, and has a finite number of terms.
Polynomial ring
In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field.
See SWIFFT and Polynomial ring
Polynomial-time reduction
In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another.
See SWIFFT and Polynomial-time reduction
Prime number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.
Pseudorandom function family
In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in the following way: no efficient algorithm can distinguish (with significant advantage) between a function chosen randomly from the PRF family and a random oracle (a function whose outputs are fixed completely at random).
See SWIFFT and Pseudorandom function family
Random oracle
In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every unique query with a (truly) random response chosen uniformly from its output domain. SWIFFT and random oracle are cryptographic hash functions.
Randomness extractor
A randomness extractor, often simply called an "extractor", is a function, which being applied to output from a weak entropy source, together with a short, uniformly random seed, generates a highly random output that appears independent from the source and uniformly distributed.
See SWIFFT and Randomness extractor
Security of cryptographic hash functions
In cryptography, cryptographic hash functions can be divided into two main categories. SWIFFT and Security of cryptographic hash functions are cryptographic hash functions.
See SWIFFT and Security of cryptographic hash functions
Universal hashing
In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). SWIFFT and universal hashing are cryptographic hash functions.
See SWIFFT and Universal hashing
Worst-case complexity
In computer science (specifically computational complexity theory), the worst-case complexity measures the resources (e.g. running time, memory) that an algorithm requires given an input of arbitrary size (commonly denoted as in asymptotic notation).
See SWIFFT and Worst-case complexity