The Poly1305-AES message-authentication code. Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length message, using a 16-byte AES key, a 16-byte additional key, and a 16-byte nonce. The security of Poly1305-AES is very close to the security of AES; the security gap is at most 14D⌈L/16⌉/2106 if messages have at most L bytes, the attacker sees at most 264 authenticated messages, and the attacker attempts D forgeries. Poly1305-AES can be computed at extremely high speed: for example, fewer than 3.1l + 780 Athlon cycles for an ℓ-byte message. This speed is achieved without precomputation; consequently, 1000 keys can be handled simultaneously without cache misses. Special-purpose hardware can compute Poly1305-AES at even higher speed. Poly1305-AES is parallelizable, incremental, and not subject to any intellectual-property claims.

References in zbMATH (referenced in 20 articles , 1 standard article )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Araujo, Filipe; Neves, Samuel: The circulant hash revisited (2021)
  2. Ghosh, Sebati; Sarkar, Palash: Variants of Wegman-Carter message authentication code supporting variable tag lengths (2021)
  3. Krovetz, Ted; Rogaway, Phillip: The design and evolution of OCB (2021)
  4. Ghosh, Sebati; Sarkar, Palash: Evaluating Bernstein-Rabin-Winograd polynomials (2019)
  5. Lee, Jooyoung; Luykx, Atul; Mennink, Bart; Minematsu, Kazuhiko: Connecting tweakable and multi-key blockcipher security (2018)
  6. Chakraborty, Debrup; Sarkar, Palash: On modes of operations of a block cipher for authentication and authenticated encryption (2016)
  7. Cogliati, Benoît; Seurin, Yannick: EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC (2016)
  8. Imamura, Kazuya; Minematsu, Kazuhiko; Iwata, Tetsu: Integrity analysis of authenticated encryption based on stream ciphers (2016)
  9. Procter, Gordon; Cid, Carlos: On weak keys and forgery attacks against polynomial-based MAC schemes (2015)
  10. Sarkar, Palash: Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector (2014)
  11. Sarkar, Palash: A new multi-linear universal hash family (2013)
  12. Chatterjee, Sanjit; Menezes, Alfred; Sarkar, Palash: Another look at tightness (2012)
  13. Krovetz, Ted; Rogaway, Phillip: The software performance of authenticated-encryption modes (2011)
  14. Minematsu, Kazuhiko; Iwata, Tetsu: Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal (2011)
  15. Sarkar, Palash: A trade-off between collision probability and key size in universal hashing using polynomials (2011)
  16. Zhang, Liting; Wu, Wenling; Wang, Peng: Polye+CTR: a swiss-army-knife mode for block ciphers (2011)
  17. Zhang, Liting; Wu, Wenling; Zhang, Lei; Wang, Peng: CBCR: CBC MAC with rotating transformations (2011)
  18. Vasserman, Eugene Y.; Hopper, Nicholas; Tyra, James: Silent knock : practical, provably undetectable authentication (2009) ioport
  19. Krovetz, Ted; Rogaway, Phillip: Variationally universal hashing (2006)
  20. Bernstein, Daniel J.: The Poly1305-AES message-authentication code (2005)