This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
- 285 views
- 552 downloads
Using the LLL-algorithm to break the RSA cryptosystem
-
- Author(s) / Creator(s)
-
The Rivest-Shamir-Adleman (RSA) cryptosystem is one of the most popular cryptosystems being used in secure data transmission. Until today, the cryptosystem is still considered to be safe due to the hardness of the factorization problem. The LenstraLenstra-Lovã¡sz (LLL) algorithm offers various methods to attack the RSA cryptosystem, even going as far as potentially breaking the system by solving the factorization problem. In this presentation, we will discuss how a weak parameter creates deadly vulnerabilities in the RSA cryptosystem, and the usage of LLL-algorithm in the factorization problem.
-
- Date created
- 2021-04-16
-
- Type of Item
- Conference/Workshop Poster