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...
Saved in:
主要作者: | Wan Mohd Ruzai, Wan Nur Aqlili |
---|---|
格式: | Thesis |
語言: | 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)