Parameterized Hash Functions

Autor:	Anna Grocholewska-Czuryło, Krzysztof Bucholc, Tomasz Bilski, Janusz Stokłosa
Rok vydání:	2012
Předmět:	Hash tree Collision resistance Theoretical computer science Computer science Hash function Cryptographic hash function Hash chain SWIFFT Security of cryptographic hash functions Algorithm Industrial and Manufacturing Engineering Double hashing
Zdroj:	Annales UMCS, Informatica. 12
ISSN:	2083-3628 1732-1360
DOI:	10.2478/v10065-012-0025-z
Popis:	In this paper we describe a family of highly parameterized hash functions. This parameterization results in great flexibility between performance and security of the algorithm. The three basic functions, HaF-256, HaF-512 and HaF-1024 constitute this hash function family. Lengths of message digests are 256, 512 and 1024 bits respectively. The paper discusses the details of functions structure. The method used to generate function S-box is also described in detail.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::8288c097d66e19f65caa052d2531337c https://doi.org/10.2478/v10065-012-0025-z Zobrazit plný text záznamu