Cryptography: Key Generation from Student ID using RSA Algorithm

This report provides a professional overview of cryptography, focusing on key generation from a Student ID using the RSA algorithm, and the subsequent process of breaking these keys. It introduces fundamental concepts such as encryption, decryption, and the role of keys in securing electronic communication. The report highlights the linkage between creating and breaking keys, emphasizing the importance of public and private keys in encryption and decryption. It also discusses the security aspects of RSA, particularly its reliance on the computational difficulty of factoring large prime numbers. The conclusion underscores the significance of encryption as a tool for ensuring privacy and confidentiality in electronic communications, addressing the challenges posed by the increasing volumes of data transmitted and stored daily.

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

2
Mobile Systems
Conclusion
As Discussed, the growth of internet has brought about the issue of privacy in Electronic
Communication, internet and E-Commerce platforms. Every day of our lives, volumes and
volumes of our data and information are transmitted, shared and stored. We do not have a
guarantee that the messages we exchange to another person is not intercepted and read without our
knowledge or consent. In electronic communications arena, there are a lot of Tools to ensure
privacy and confidentiality of the information we share and exchanges between our peers and
other organizations.
Encryption as a tool is the most standard and secure way for making communication private. If
anyone intends to send a private message to another person, S/he encrypts it with the keys which
are private and only he and the recipient will understand. Any person between trying to eavesdrop
will not understand the message. In such this, Encryption can ensure secure electronic
communication.

3
Mobile Systems
References
Tao, T., 2011. A remark on primality testing and decimal expansions. Journal of the Australian
Mathematical Society, 91(3), pp.405-413.
Girault, M., 1991, April. Self-certified public keys. In Workshop on the Theory and Application of
of Cryptographic Techniques(pp. 490-497). Springer, Berlin, Heidelberg.
Lindell, Y. and Katz, J., 2014. Introduction to modern cryptography. Chapman and Hall/CRC.
Mahto, D., Khan, D.A. and Yadav, D.K., 2016, June. Security Analysis of Elliptic Curve
Cryptography and RSA. In Proceedings of the World Congress on Engineering WCE (Vol. 1).
Barrett, P., 1986, August. Implementing the Rivest Shamir and Adleman public key encryption
algorithm on a standard digital signal processor. In Conference on the Theory and Application of
Cryptographic Techniques (pp. 311-323). Springer, Berlin, Heidelberg.
Ingham, A.E. and Ingham, A.E., 1990. The distribution of prime numbers (No. 30). Cambridge
University Press.
Crandall, R. and Pomerance, C.B., 2006. Prime numbers: a computational perspective (Vol. 182).
Springer Science & Business Media.
Mahto, D., Khan, D.A. and Yadav, D.K., 2016, June. Security Analysis of Elliptic Curve
Cryptography and RSA. In Proceedings of the World Congress on Engineering WCE (Vol. 1).