Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/14689
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJoshi N.S.
dc.contributor.authorRaghuwanshi R.
dc.contributor.authorChandavarkar B.R.
dc.date.accessioned2021-05-05T10:15:40Z-
dc.date.available2021-05-05T10:15:40Z-
dc.date.issued2021
dc.identifier.citation2021 International Conference on COMmunication Systems and NETworkS, COMSNETS 2021 , Vol. , , p. 207 - 211en_US
dc.identifier.urihttps://doi.org/10.1109/COMSNETS51098.2021.9352926
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14689-
dc.description.abstractThis paper aims to analyze the computational complexity by calculating the cost in terms of the total number of primitive operations like AND, OR, XOR, SHIFT per block of data of three major block ciphers: Data Encryption Standard (DES), Triple Data Encryption Standard (3DES), and Advanced Encryption Standard (AES) that form the backbone of Transport Layer Security (TLS). Further, the proposed analysis can be applied as a universal analysis free from any hardware or architecture. © 2021 IEEE.en_US
dc.titleComputational Complexity Analysis of Block Ciphers of Transport Layer Securityen_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.