Faster access than browser!
19 relations: Advanced Encryption Standard, Block cipher mode of operation, C (programming language), Cryptographic nonce, Cryptography, Data integrity, Finite field, Initialization vector, Internet Engineering Task Force, Message, Message authentication code, Modular arithmetic, One-time pad, Poly1305, Prime number, Pseudorandom generator, SIMD, Universal hashing, VMAC.
Advanced Encryption Standard
The Advanced Encryption Standard (AES), also known by its original name Rijndael, is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.
New!!: UMAC and Advanced Encryption Standard · See more »
Block cipher mode of operation
In cryptography, a block cipher mode of operation is an algorithm that uses a block cipher to provide an information service such as confidentiality or authenticity.
New!!: UMAC and Block cipher mode of operation · See more »
C (programming language)
C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.
New!!: UMAC and C (programming language) · See more »
Cryptographic nonce
In cryptography, a nonce is an arbitrary number that can be used just once.
New!!: UMAC and Cryptographic nonce · See more »
Cryptography
Cryptography or cryptology (from κρυπτός|translit.
New!!: UMAC and Cryptography · See more »
Data integrity
Data integrity is the maintenance of, and the assurance of the accuracy and consistency of, data over its entire life-cycle, and is a critical aspect to the design, implementation and usage of any system which stores, processes, or retrieves data.
New!!: UMAC and Data integrity · See more »
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.
New!!: UMAC and Finite field · See more »
Initialization vector
In cryptography, an initialization vector (IV) or starting variable (SV) is a fixed-size input to a cryptographic primitive that is typically required to be random or pseudorandom.
New!!: UMAC and Initialization vector · See more »
Internet Engineering Task Force
The Internet Engineering Task Force (IETF) develops and promotes voluntary Internet standards, in particular the standards that comprise the Internet protocol suite (TCP/IP).
New!!: UMAC and Internet Engineering Task Force · See more »
Message
A message is a discrete unit of communication intended by the source for consumption by some recipient or group of recipients.
New!!: UMAC and Message · See more »
Message authentication code
In cryptography, a message authentication code (MAC), sometimes known as a tag, is a short piece of information used to authenticate a message—in other words, to confirm that the message came from the stated sender (its authenticity) and has not been changed.
New!!: UMAC and Message authentication code · See more »
Modular arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus (plural moduli).
New!!: UMAC and Modular arithmetic · See more »
One-time pad
In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked, but requires the use of a one-time pre-shared key the same size as, or longer than, the message being sent.
New!!: UMAC and One-time pad · See more »
Poly1305
Poly1305 is a cryptographic message authentication code (MAC) created by Daniel J. Bernstein.
New!!: UMAC and Poly1305 · See more »
Prime number
A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
New!!: UMAC and Prime number · See more »
Pseudorandom generator
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and the uniform distribution.
New!!: UMAC and Pseudorandom generator · See more »
SIMD
Single instruction, multiple data (SIMD) is a class of parallel computers in Flynn's taxonomy.
New!!: UMAC and SIMD · See more »
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).
New!!: UMAC and Universal hashing · See more »
VMAC
VMAC is a block cipher-based message authentication code (MAC) algorithm using a universal hash proposed by Ted Krovetz and Wei Dai in April 2007.
New!!: UMAC and VMAC · See more »
