A POLYNOMIAL BASED HASHING ALGORITHM

V. Kumar Murty; Nikolajs Volkovs

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

A POLYNOMIAL BASED HASHING ALGORITHM

Topics: Data Integrity

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 103-106, 2008 , Porto, Portugal

Authors: V. Kumar Murty ¹ and Nikolajs Volkovs ²

Affiliations: ¹ University of Toronto, Canada ; ² University of Toronto - Mississauga, Canada

Keyword(s): Hash function, data integrity, polynomials over finite fields.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Data Integrity ; Databases and Data Security ; Information and Systems Security

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.12.162.179

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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

@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 (ICETE 2008) - SECRYPT},
year={2008},
pages={103-106},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001929501030106},
isbn={978-989-8111-59-3},
issn={2184-3236},
}

TY - CONF

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