Construction of family of hash functions based on ideal lattice

Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/81105

Full metadata record

DC Field	Value	Language
dc.contributor.author	Guritman, Sugi	-
dc.contributor.author	Aliatiningtyas, Nur	-
dc.contributor.author	Wulandari, Teduh	-
dc.contributor.author	Ilyas, Muhammad	-
dc.date.accessioned	2016-06-30T03:43:25Z	-
dc.date.available	2016-06-30T03:43:25Z	-
dc.date.issued	2015	-
dc.identifier.issn	0972-5555	-
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/81105	-
dc.description.abstract	Cryptographic hash function is a function h : D -> R with \| D \| >> \| R \| which has the security properties: one-way (computationally not feasible to calculate x e D from known y e R so that y = h(x)) and collision resistant (not feasible determining x =/ y so that h(x) = h(y)).	id
dc.language.iso	id	id
dc.publisher	Pushpa Publishing House, Allahabad, India	id
dc.relation.ispartofseries	Volume 36, Number 2;Pages 177-188	-
dc.title	Construction of family of hash functions based on ideal lattice	id
dc.type	Article	id
Appears in Collections:	Faculty of Mathematics and Natural Sciences

Files in This Item:

File	Size	Format
JPANTAApr2015_177_188.pdf	86.47 kB	Adobe PDF	View/Open

DSpace JSPUI