RSA & EXTENDED EUCLIDEAN ALGORITHM WITH EXAMPLES OF EXPONENTIAL RSA CIPHERS, RSA EXAMPLE SOLUTION WITH EXTENDED EUCLIDEAN ALGORITHM
RSA & EXTENDED EUCLIDEAN ALGORITHM WITH EXAMPLES OF EXPONENTIAL RSA CIPHERS, RSA EXAMPLE SOLUTION WITH EXTENDED EUCLIDEAN ALGORITHM

Summary/Abstract: In inter-system connections or between any two points in communication, it is necessary to make sure that the data goes securely. This is achieved by encrypting the sent data. As the disciplines of cryptography and network security matured, more practical applications were developed that were not readily available to ensure network security.Today, encryption has become a necessity in the digital environment. In this study, basic cryptography terms arementioned. The RSA algorithm (Rivest-Shamir-Adleman)is the basis of a cryptographic system, a suite ofcryptographic algorithms used for private security servicesor purposes, and this allows public key encryption, widelyused to secure particularly sensitive data sent over aninsecure network such as the internet. Commonly usedmethods were examined and RSA encryption method waschosen in accordance with the purpose of the study. RSA,a public key encryption technique, is built on the difficultyof generating and processing very large integers. In thisstudy, operations with large numbers that take a long time are completed in a short time using various methods. It hasbeen reflected in the study by creating a more secure structure by using large prime numbers for the keygeneration process.

• Details
• Contents