The Generalized Construction of Pseudonondeterministic Hashing

dc.contributor.author	Luzhetsky, V. A.	en
dc.contributor.author	Baryshev, Yu. V.	en
dc.contributor.author	Лужецький, В. А.	uk
dc.contributor.author	Баришев, Ю. В.	uk
dc.date.accessioned	2017-02-20T08:36:28Z
dc.date.available	2017-02-20T08:36:28Z
dc.date.issued	2012-11-03
dc.identifier.citation	Luzhetsky V. A. The Generalized Construction of Pseudonondeterministic Hashing [Text] / V. A. Luzhetsky, Yu. V. Baryshev // International Journal of Computing. - 2012. - Vol. 11, issue 3. - P. 302-308.	en
dc.identifier.issn	1727-6209
dc.identifier.issn	1727-6209
dc.identifier.uri	http://ir.lib.vntu.edu.ua/handle/123456789/14230
dc.description.abstract	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.	en
dc.language.iso	en	en
dc.publisher	Тернопільський національний економічний університет	uk
dc.relation.ispartof	International Journal of Computing. Vol. 11, issue 3 : 302-308.
dc.subject	hashing	en
dc.subject	multipipe	en
dc.subject	the pseudonondeterminancy	en
dc.subject	the automaton	en
dc.subject	the cryptography	en
dc.title	The Generalized Construction of Pseudonondeterministic Hashing	en
dc.type	Article