Evaluating Bernstein-Rabin-Winograd polynomials

DOI10.1007/S10623-018-0561-7MaRDI QIDQ1727367zbMATH OpenOpenAlexFDO

Authors Sebati Ghosh, Palash Sarkar

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

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

Recommendations

• Ubiquitous weak-key classes of BRW-polynomial function
• Evaluation of Polynomials Using the Structure of the Coefficients
• Multivariates Polynomials for Hashing
• ERINDALE: A Polynomial Based Hashing Algorithm
• scientific article; zbMATH DE number 883364

Cites work

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

Cited in

(2)

• Ubiquitous weak-key classes of BRW-polynomial function
• Polynomial hashing over prime order fields

Describes a project that uses

Uses Software

• Poly1305-AES

This page was built for publication: Evaluating Bernstein-Rabin-Winograd polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727367)