Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/8408
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Soni, M.P. | |
dc.contributor.author | Pais, A.R. | |
dc.date.accessioned | 2020-03-30T10:18:37Z | - |
dc.date.available | 2020-03-30T10:18:37Z | - |
dc.date.issued | 2017 | |
dc.identifier.citation | ACM International Conference Proceeding Series, 2017, Vol., , pp.206-211 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8408 | - |
dc.description.abstract | A cryptographic hash fuction is used to protect the authenticity of information. Commonly used hash functions require huge computational overhead which is not available in most of the IOT devices Hence light weight cryptographic hash functions such as ARMADILLO, DM-PRESENT, GLUON, PHOTON, QUARK, SIPHASH, SPNHASH, SPONGENTA [1�3, 5, 6, 8�10], have been proposed in the literature for IOT device applications. Permutation operations in these algorithms are time consuming operations. In this paper, we are modifying the permutation operation of DM-PRESENT and SPONGENT algorithms using GRP instruction to achieve faster execution of algorithms. Using our technique we are able to save 465 cycles for DM-PRESENT(for 128- bits) and 670 cycles for SPONGENT(for 80-bits) algorithm over table look up implementation. In comparison to SHIFT-AND-OR technique of implementation we are able to save 7,688 cycles for DM-PRESENT(for 128- bits) and 11,160 for SPONGENT(for 80-bits) algorithms. � 2017 Copyright held by the owner/author(s). | en_US |
dc.title | Light-Weight Hash Algorithms Using GRP instruction | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.