Evaluating Bernstein-Rabin-Winograd polynomials

DOI10.1007/s10623-018-0561-7zbMath1434.94067OpenAlexW2613083948MaRDI QIDQ1727367

Palash Sarkar, Sebati Ghosh

Publication date: 20 February 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0561-7

zbMATH Keywords

reductionmessage authentication codealmost universal hash functionBRW polynomialsfield multiplication

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• Poly1305-AES

Cites Work

• A new multi-linear universal hash family
• Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• The Software Performance of Authenticated-Encryption Modes
• Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
• Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
• Fast Software Encryption
• Fast evaluation of polynomials by rational preparation