Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/226264
Title: Improvement in performance of RSA cryptosystem
Researcher: Verma, Seema
Guide(s): Garg, Deepak
Keywords: Computer Science
Cryptography
University: Thapar Institute of Engineering and Technology
Completed Date: 2015
Abstract: Cryptography is used to communicate the critical information over an insecure network. Symmetric key cryptographic algorithms are used to encrypt the information so that the intruder cannot get the information of the original message. These algorithms are fast due to small (secret) key size, say 128 bits. As the secret key between the sender and receiver is communicated over insecure channel, one cannot use symmetric key algorithms for complete communication. Shared key can be compromised over insecure network. Public key cryptographic algorithms are needed at least to communicate the shared key used by the symmetric key algorithms. In public key algorithms, key used is very large to secure the message to be communicated. The large sized key comes at its own cost. The key size a ects the computational performance of the cryptosystem. Also, due to the large key size, it creates storage problem. In resource constrained devices, large key size in public key algorithms becomes bottleneck for the performance. RSA is the most popular and widely studied public key algorithm. As with the other public key algorithms, it also requires very large key size. This drawback of RSA prompts one to shift from this public key cryptosystem to other having smaller key size for resource constrained devices. Also, the use of other public key cryptosystems with smaller key size comes with their own shortcomings. Hence there is a need to improve RSA cryptosystem so that it results in better e ciency when used in resource constrained devices. This thesis proposes methods to improve the computational e ciency and memory consumption for di erent RSA variants. Thesis includes the study of di erent existing RSA variants. The variants are studied in terms of their encryption and decryption e ciency. Some of the variants work on encryption performance and some on decryption performance. Based on the computational e ciency, comparative analysis of these variants is carried out to better understand the performance of RSA variants.
Pagination: xi, 147p.
URI: http://hdl.handle.net/10603/226264
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
file10(references).pdfAttached File139.88 kBAdobe PDFView/Open
file1(title).pdf43.07 kBAdobe PDFView/Open
file2(certificate).pdf68.76 kBAdobe PDFView/Open
file3(preliminary pages).pdf208.33 kBAdobe PDFView/Open
file4(chapter 1).pdf157.45 kBAdobe PDFView/Open
file5(chapter 2).pdf409.53 kBAdobe PDFView/Open
file6(chapter 3).pdf303.22 kBAdobe PDFView/Open
file7(chapter 4).pdf401.31 kBAdobe PDFView/Open
file8(chapter 5).pdf91.73 kBAdobe PDFView/Open
file9(appendix).pdf260.6 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: