Cryptography and Key Generation using RSA Algorithm

Running head: INFORMATION TECHNOLOGY
Information Technology
Name of the student
Name of the University
Author’s note

1
Mobile Systems
Introduction
These report is professional representation of the solutions done on the assignment given on
Creating Key from the Student ID and Breaking the same keys. It also aimed at providing an
insight on how Cryptography works and How Keys are generated using cryptography. This report
will provide an overview of Encryption and Public –Key Cryptosystems.
Below, Is an introductions to the common words to make us aware of the process that I undertake.
Encryption as a term refers to a method of converting plain text into a cipher text message and
decryption is the of converting the cipher text message into plaintext.
Key is a parameter used in the process of encryption and Decryption of message.
The Algorithm used to Generate keys was RSA Algorithm. The Security of RSA relies mostly on
Complex computational difficulty of using and factoring large integers called prime numbers for
example The Student ID. The ability to factor large and larger prime numbers increases the
encryption power. Encryption strength is directly tied to key size and length of the exponential.
Linkage Between Creating Keys and Breaking Keys
In order to encrypt any message, you must create a private key and public key to be use. The
relationship between creating the key and breaking the key is an important part of securing
message content from eavesdropping.
In both of the part 1 and 2 is that, A public key is used for encryption and private key is used for
decrypting.
primes of the type 4x+1 are weaker than primes of type 4x+3 because one of its digit changes
when the other single digit is changed. Primes of this Form is smaller than the average of the two
primes surrounding primes