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:
Main Author: | Wan Mohd Ruzai, Wan Nur Aqlili |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/98640/1/IPM%202021%201%20-%20IR.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015) -
A scalar multiplication in elliptic curve cryptography with binary polynomial operations in galois field /
by: Modares, Hero
Published: (2009) -
A parallel distributed Javaspaces implementation of RSA public key factorization using quadratic sieve /
by: Lau, Khek Hooi
Published: (2003) -
A New "F-Lueg" Cryptosystem and its Security
by: Choo, Mun Yoong
Published: (2002)