Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields

Explore the efficient design and implementation of polynomial hash functions over prime fields in this informative IEEE conference talk. Gain insights into advanced cryptographic techniques and their practical applications. Delve into the intricacies of prime field arithmetic and learn how to optimize polynomial hash functions for improved performance and security. Discover key strategies for implementing these functions in real-world systems and understand their importance in modern cryptography.

415 SoK Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields Jan G