Please use this identifier to cite or link to this item:
Title: A web demo of RSA public key cryptography algorithms
Authors: Tan, Andy Ying Kun
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2019
Abstract: The Rivest-Shamir-Adleman (RSA) algorithm is an asymmetric algorithm that is used in Public-Key Cryptosystems where security is directly proportional to the key size. RSA data keys are generated from factors based on two large prime numbers using the Extended Euclidean algorithm. These prime numbers are selected at random and undergo a probabilistic primality test such as Miller-Rabin’s to ensure that they are prime. The plaintext undergoes through an encryption algorithm to produce a ciphertext to be transmitted to the receiver. The ciphertext will be decoded through a decryption algorithm to be converted back to its intended plaintext. Consisting of many complex mathematical calculations revolving around prime numbers and exponentials, students studying cryptography usually only learn the algorithm only in theory and formulas with the teaching materials given and have no way of experimenting with the variables involved to get a deeper understanding of each step of the asymmetric algorithm. The purpose of this project is to implement a web-based demonstration for all the steps of encryption and decryption of the RSA algorithm, which can be served as an accompanying learning material for students of cryptography. This includes computation subsystems such as the primality test algorithm, the Extended Euclidean algorithm, and the actual RSA encryption algorithm. The RSA Web Demonstration was developed using HTML Bootstrap and JavaScript. The demonstration collects input from the user and passes those inputs to JavaScript to be used in calculations of the algorithm. The web demonstration will then return the algorithm process and the results to step by step collapsible sections where users can understand what each step entails. In conclusion, the user will be able to use various parameters to generate a step by step visualization of the computation subsystem they wished to experiment or learn more with different variables introduced to the algorithms. For future works, it is recommended that the demonstration can handle calculations more than 8 digits.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
SCSE18-0007 Final Report.pdf
  Restricted Access
Final Year Report3.07 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 23, 2021

Download(s) 50

Updated on Jun 23, 2021

Google ScholarTM


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