A POLYNOMIAL BASED HASHING ALGORITHM

V. Kumar Murty, Nikolajs Volkovs

2008

Abstract

The aim of this article is to describe a new hash algorithm using polynomials over finite fields. It runs at speeds comparable to SHA-3. Hardware implementations seem to run at significantly faster speeds, namely at 1.8 Gb/sec on an FPGA. Unlike most other existing hash algorithms, our construction does not follow the Damgaard-Merkle philosophy. The hash has several attractive features in terms of its flexibility. In particular, the length of the hash is a parameter that can be set at the outset. Moreover, the estimated degree of collision resistance is measured in terms of another parameter whose value can be varied.

Paper Citation

in Harvard Style

Kumar Murty V. and Volkovs N. (2008). A POLYNOMIAL BASED HASHING ALGORITHM . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008) ISBN 978-989-8111-59-3, pages 103-106. DOI: 10.5220/0001929501030106

in Bibtex Style

@conference{secrypt08,
author={V. Kumar Murty and Nikolajs Volkovs},
title={A POLYNOMIAL BASED HASHING ALGORITHM},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008)},
year={2008},
pages={103-106},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001929501030106},
isbn={978-989-8111-59-3},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008)
TI - A POLYNOMIAL BASED HASHING ALGORITHM
SN - 978-989-8111-59-3
AU - Kumar Murty V.
AU - Volkovs N.
PY - 2008
SP - 103
EP - 106
DO - 10.5220/0001929501030106