Computational Complexity Analysis of Block Ciphers of Transport Layer Security

Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/14689

Full metadata record

DC Field	Value	Language
dc.contributor.author	Joshi N.S.
dc.contributor.author	Raghuwanshi R.
dc.contributor.author	Chandavarkar B.R.
dc.date.accessioned	2021-05-05T10:15:40Z	-
dc.date.available	2021-05-05T10:15:40Z	-
dc.date.issued	2021
dc.identifier.citation	2021 International Conference on COMmunication Systems and NETworkS, COMSNETS 2021 , Vol. , , p. 207 - 211	en_US
dc.identifier.uri	https://doi.org/10.1109/COMSNETS51098.2021.9352926
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/14689	-
dc.description.abstract	This 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.title	Computational Complexity Analysis of Block Ciphers of Transport Layer Security	en_US
dc.type	Conference Paper	en_US
Appears in Collections:	2. Conference Papers

Files in This Item:

There are no files associated with this item.