ERINDALE: A Polynomial Based Hashing Algorithm

DOI10.1007/978-3-642-01877-0_14zbMath1248.94084OpenAlexW1513787550MaRDI QIDQ5323007

Nikolajs Volkovs, V. Kumar Murty

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_14

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items (1)

ERINDALE: A Polynomial Based Hashing Algorithm

Cites Work

• Unnamed Item
• New bounds on exponential sums related to the Diffie-Hellman distributions
• New Constructions for Secure Hash Functions
• Advances in Cryptology – CRYPTO 2004
• ERINDALE: A Polynomial Based Hashing Algorithm
• How to Break MD5 and Other Hash Functions

This page was built for publication: ERINDALE: A Polynomial Based Hashing Algorithm