Polynomial hashing over prime order fields

DOI10.3934/amc.2024001MaRDI QIDQ6646806

Kaushik Nath, Palash Sarkar, Sreyosi Bhattacharyya

Publication date: 3 December 2024

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

zbMATH Keywords

efficient implementationHornerpolynomial hashalmost XOR universal hash functionBRW hash

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• A new multi-linear universal hash family
• Universal classes of hash functions
• Advances in cryptology - CRYPTO '93. 13th annual international cryptology conference, Santa Barbara, CA, USA, August 22 - 26, 1993. Proceedings
• Evaluating Bernstein-Rabin-Winograd polynomials
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• A trade-off between collision probability and key size in universal hashing using polynomials
• <monospace>STES</monospace>: A Stream Cipher Based Low Cost Scheme for Securing Stored Data
• 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
• Fast Software Encryption

This page was built for publication: Polynomial hashing over prime order fields

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