PMAC (cryptography)

Known as: PMAC 
PMAC, which stands for Parallelizable MAC, is a message authentication code algorithm. It was created by Phillip Rogaway (patent pending). PMAC is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper proposes an authenticated encryption scheme, called SIVx, that preserves BBB security also without the requirement for… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
The need for a reduction in healthcare cost has escalated over the past decade. Therefore, preventive medicine through remote… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?
2007
2007
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these… (More)
  • figure 1
Is this relevant?
2007
2007
We present an improved security analysis of OMAC, the construction is widely used as a candidate of MAC or Pseudo Random Function… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The detection of noncatastrophic faults in conjunction with other factors can be used to determine the remaining life of an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2006
2006
Stream ciphers are encryption algorithms used for ensuring the privacy of digital telecommunications. They have been widely used… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A highly robust automatic disturbances rejection controller (ADRC) is developed to implement high-precision motion control of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a novel adaptive MAC protocol for wireless sensor networks. In existing protocols such as SMAC, the sensor nodes are… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe highly efficient constructions, XE and XEX, that turn a blockcipher E: K×{0, 1} → {0, 1} into a tweakable blockcipher… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Fair allocation of bandwidth and maximization of channel utilization are two important issues when designing a contention-based… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?