Cryptanalysis of RSA and its variants using continuous midpoint subdivision analysis and lattices
The RSA cryptosystem developed in 1978 is the earliest public-key cryptosystem most widely deployed in securing digital information. One of the security features of RSA is based on the assumption that factoring its modulus N = pq is an infeasible task to be done in polynomial time. However, most...
محفوظ في:
المؤلف الرئيسي: | Wan Mohd Ruzai, Wan Nur Aqlili |
---|---|
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2021
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/98640/1/IPM%202021%201%20-%20IR.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
An improved public key cryptography based on the elliptic curve
بواسطة: Al-Daoud, Essam Faleh
منشور في: (2002) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
بواسطة: Al-Saffar, Najlae Falah Hameed
منشور في: (2015) -
A scalar multiplication in elliptic curve cryptography with binary polynomial operations in galois field /
بواسطة: Modares, Hero
منشور في: (2009) -
A parallel distributed Javaspaces implementation of RSA public key factorization using quadratic sieve /
بواسطة: Lau, Khek Hooi
منشور في: (2003) -
A New "F-Lueg" Cryptosystem and its Security
بواسطة: Choo, Mun Yoong
منشور في: (2002)