Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/83155
Title: Optimising implementation of block ciphers
Authors: Tan, Quan Quan
Keywords: Science::Mathematics::Discrete mathematics::Cryptography
Issue Date: 2019
Source: Tan, Q. Q. (2019). Optimising implementation of block ciphers. Master's thesis, Nanyang Technological University, Singapore.
Abstract: With the increasing need to protect information digitally, the study of cryptography has become of paramount importance. The digital world requires strong and efficient encryption algorithms in order to ensure private information are not compromised. As we strive towards making our devices smaller, the cost of the cryptographic implementation becomes more significant. In this thesis, we will look at new optimising algorithms to reduce the number of exclusive or (XOR) boolean operations in the workhorses algorithms for encryption. The algorithms presented in this thesis are new and based on an improved version of the Boyar and Peralta's algorithm. It was motivated by a graph search approach to find a path towards the various targets. We will be drawing comparisons to the results obtained by various algorithms out there such as Paar's algorithm, Boyar and Peralta's algorithm. Overall, the results obtained from the new heuristic showed that this algorithm fares better than those mentioned above.
URI: https://hdl.handle.net/10356/83155
http://hdl.handle.net/10220/49160
DOI: 10.32657/10220/49160
Schools: School of Physical and Mathematical Sciences 
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Theses

Files in This Item:
File Description SizeFormat 
Masters_Thesis_TAN_QUAN_QUAN.pdfMain Article701.82 kBAdobe PDFThumbnail
View/Open

Page view(s) 50

519
Updated on Jun 12, 2024

Download(s) 20

280
Updated on Jun 12, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.