Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/24028
DC FieldValueLanguage
dc.contributor.authorGligoroski, Daniloen_US
dc.contributor.authorSteinsmo Ødegard, Runeen_US
dc.contributor.authorMihova, Marijaen_US
dc.contributor.authorJohan Knapskog, Sveinen_US
dc.contributor.authorKocarev, Ljupchoen_US
dc.date.accessioned2022-11-01T08:36:44Z-
dc.date.available2022-11-01T08:36:44Z-
dc.date.issued2012-04-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/24028-
dc.description.abstractThis is the version 02 of the supporting documentation that describes in details the cryptographic hash function Edon-R which was submitted as a candidate for SHA-3 hash competition organized by National Institute of Standards and Technology (NIST), according to the public call [NIS07]. The difference between version 01 and version 02 of the documentation is in the produced test vectors for HMAC. That is due to the fact that there was mismatch between rotation values defined in the documentation and implemented C code. Accordingly, C source code (in the accompanied CD) has been changed with the correct rotation values. So, in this documentation we do not change anything in the originally submitted algorithm, but just give the correct HMAC test values. In this version a minor change in the performance has been measured with Microsoft Visual Studio 2005, but we add new measurements performed by Intel C++ v 11.0.066 (that are slightly better than those obtained by Microsoft Visual Studio 2005). Additionally, we put a remark that our claims about free-start collisions in the Section 3.14 are not correct. Edon-R is a cryptographic hash function with output size of n bits where n = 224, 256, 384 or 512. Its conjectured cryptographic security is: O(2 n 2 ) hash computations for finding collisions, O(2n ) hash computations for finding preimages, O(2n−k ) hash computations for finding second preimages for messages shorter than 2k bits. Additionally, it is resistant against lengthextension attacks, resistant against multicollision attacks and it is provably resistant against differential cryptanalysis. Edon-R has been designed to be much more efficient than SHA-2 cryptographic hash functions, while in the same time offering same or better security. The speed of the optimized 32-bit version on defined reference platform with Intel C++ v 11.0.066 is 6.26 cycles/byte for n = 224, 256 and 9.99 cycles/byte for n = 384, 512. The speed of the optimized 64-bit version on defined reference platform with Intel C++ v 11.0.066 is 4.40 cycles/byte for n = 224, 256 and 2.29 cycles/byte for n = 384, 512.en_US
dc.publisherNorwegian University of Science and Technologyen_US
dc.relation.ispartofHash Functions and Gröbner Bases Cryptanalysisen_US
dc.subjectHash function, SHA-3, quasigroup string transformationen_US
dc.titleCRYPTOGRAPHIC HASH FUNCTION Edon-모en_US
dc.typeArticleen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles
Files in This Item:
File Description SizeFormat 
524494_FULLTEXT01.pdf2.27 MBAdobe PDFView/Open
Show simple item record

Page view(s)

48
checked on May 3, 2024

Download(s)

10
checked on May 3, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.