Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/15130
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDubey P.K.
dc.contributor.authorJangid A.
dc.contributor.authorChandavarkar B.R.
dc.date.accessioned2021-05-05T10:16:31Z-
dc.date.available2021-05-05T10:16:31Z-
dc.date.issued2020
dc.identifier.citation2020 11th International Conference on Computing, Communication and Networking Technologies, ICCCNT 2020 , Vol. , , p. -en_US
dc.identifier.urihttps://doi.org/10.1109/ICCCNT49239.2020.9225412
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/15130-
dc.description.abstractSymmetric ciphers are one of the most famous cryptographic paradigms in cryptography. Its simplistic algorithm makes it easy to understand, and it has not very complex implementation. Hash functions, on the other hand, are the fundamental algorithm in managing the integrity of the transmitted data. It is also widely popular. Symmetric ciphers and hash functions are very much dependent on each other to make them more secure and robust application. In this paper, we will see how symmetric ciphers and hash functions are connected, and their different use cases in real life. This paper also includes different symmetric ciphers, hash functions, and we will see their relationship. First, this paper will introduce what a security service is, then the classes of cryptographic algorithms are illustrated where we have discussed different paradigms of cryptography. After that, we have addressed different types of symmetric ciphers and hash functions. Based on some use cases, we have shown the inter-dependency of symmetric cipher and hash function. Next, we have presented a comparison in various approaches to dependency. © 2020 IEEE.en_US
dc.titleAn Interdependency between Symmetric Ciphers and Hash Functions: A Surveyen_US
dc.typeConference Paperen_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.