Open AccessTHE GENERALIZED CONSTRUCTION OF PSEUDONONDETERMINISTIC HASHING
Author(s) -
Volodymyr Luzhetsky,
Yuriy Baryshev
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.11.3.574
Subject(s) - hash function , sha 2 , double hashing , cryptanalysis , computer science , secure hash algorithm , collision resistance , dynamic perfect hashing , theoretical computer science , universal hashing , hash chain , cryptographic hash function , mathematics , algorithm , cryptography , programming language
This article is devoted to the development of hash constructions, which are based on the pseudonondeterministic hash conception. The conception allows to design hash functions with improved infeasibility to cryptanalysis. Both proposed constructions and known ones are generalized as pseudonondeterministic constructions.