Abstract

RSA cryptography is a strong encryption method widely used in online transactions. Using the extended Euclidean algorithm is an important and efficient technique for finding the secret key in RSA cryptography. This study provides an implementation of the extended Euclidean algorithm to find secret keys based on RSA cryptography and hopes that it can be of help to experts in the field of information security.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call