YoVDO

Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields

Offered By: IEEE via YouTube

Tags

Cryptography Courses Number Theory Courses Algorithm Optimization Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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


Taught by

IEEE Symposium on Security and Privacy

Tags

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera