DSpace on Chitkara University >
Thesis - Chitkara University Himachal Pradesh >
Phd Thesis 2015 HP >
Please use this identifier to cite or link to this item:
|Title: ||PARALLEL HASHING ALGORITHMS FOR SECURITY AND FORENSIC APPLICATIONS|
|Authors: ||Kishore, Neha Kishore|
|Issue Date: ||31-Dec-2014|
|Publisher: ||Chitkara University Punlications|
|Abstract: ||Modern computing is now using parallelism to achieve higher performance as opposed to scaling frequency in the past. Security algorithms are compute intensive and can benefit significantly in their performance from parallel implementations. Parallel computing can also be used for more energy-efficient implementation of security algorithm making them more usable in areas like mobile computing, personal computing, and cloud computing.
Cryptographic hashing algorithms are considered to be one of the important requirements for the digital data security and digital forensics. Many secure hashing algorithms are available but most of them are serial in nature. Not much work has been done to parallelize these algorithms to exploit parallel computing resources that are available in modern computing devices.
The design of new secure and fast hashing algorithms is important for many applications in today’s information-based world. In this thesis, we broadly explore the analysis and design of key security primitives, cryptographic hash functions and digital signatures, used for assuring authentication and data integrity. A novel hashing transformation has been proposed and the security of the proposed algorithms have been analyzed using some well-known statistical tests in the field. Several analyses and computer simulations are performed to verify their characteristics, confirming the satisfaction of the characteristics and conditions of the cryptographic hashing algorithms. In addition to this, tests have been also performed in some of the application areas of hash functions such as the digital signatures and the digital forensic applications.
We have also compared the performance of algorithms based on proposed transformation with the well-known hashing algorithms. Our comparison of results show that the proposed algorithms have a better performance than other existing algorithms. Apart from the speedup gained due to parallel implementation, the energy efficiency of the algorithms has also been measured. Energy-efficient parallel algorithms make them suitable for their use in the handheld devices. The
proposed algorithms in this thesis have a high potential for their adoption in the area of secure and forensic applications.|
|Appears in Collections:||Phd Thesis 2015 HP|
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.