Finite fields

field that contains a finite number of elements

type of hash function used to detect errors in data storage or transmission

problem of inverting exponentiation in finite groups

approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields

probabilistic primality test

primality test

class of error correction code

error-correcting codes

endomorphism of a commutative ring of non-zero characteristics

theorem

authenticated encryption mode for block ciphers

block code where the circular shifts of each codeword gives another word that belongs to the code

function whose logarithmic derivative is a generating function for the number of solutions of a set of equations defined over a finite field

algorithm for integer factorization

In mathematics, the nimbers, also called Grundy numbers (not to be confused with Grundy chromatic numbers), are introduced in combinatorial game theory, where they are defined as the values of heaps in the game Nim. The nimbers are the same proper class as the ordinal numbers but endowed with nimber addition and nimber multiplication, which are distinct from ordinal addition and ordinal multiplication.

polynomial factorisation algorithm

computer Networking Program

theorem in number theory

(also denoted \mathbb F_2, or \mathbb Z/2\mathbb Z) is the finite field with two elements.

problem in cryptography

error-correcting codes

branch of finite geometry

kind of mathematical linear code

efficient algorithm to count points on elliptic curves

Error correcting algorithm

algorithm for factoring polynomials over finite fields