CLMUL instruction set

Known as: PCLMULHQLQDQ, PCLMULLQLQDQ, CLMUL 
Carry-less Multiplication (CLMUL) is an extension to the x86 instruction set used by microprocessors from Intel and AMD which was proposed by Intel… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2010-2016
012320102016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
2014
2014
This paper shows how to securely authenticate messages using just 29 bit operations per authenticated bit, plus a constant… (More)
Is this relevant?
2013
2013
The 3GPP Task Force recently supplemented mobile LTE network security with an additional set of confidentiality and integrity… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2012
2012
Cyclic Redundancy Check (CRC) codes are widely used for integrity checking of data in fields such as storage and networking. Fast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
  • Iqbal Muhammad Umair
  • 2012
There have been several modes of operations available for symmetric key block ciphers, among which Galois Counter Mode (GCM) of… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2011
2011
The level of interest in Galois Counter Mode (GCM) Authenticated Encryption rose significantly within the last few years. GCM is… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2011
2011
PCLMULQDQ, a new instruction that supports GF(2)[x] multiplication, was introduced by Intel in 2010. This instruction brings… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2010
2010
Executive Summary Galois-Counter-Mode (GCM) is a block cipher mode of operation that uses universal hashing over a binary Galois… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
3 Executive Summary This paper presents a fast and efficient method of computing CRC on IA processors with generic polynomials… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?