New compendium of RSA vulnerabilities

RSA cryptosystem is the most widely deployed public-key encryption scheme in the digital world. It utilizes a hard mathematical problem known as the integer factorization problem (IFP) to confide digital data in transit or at rest. Cryptanalysis against RSA and its variants is vital to point out...

Full description

Saved in:

Bibliographic Details
Main Author:	Abd Ghafar, Amir Hamzah
Format:	Thesis
Language:	English
Published:	2020
Subjects:	Cryptography Data encryption (Computer science) Computer networks - Security measures
Online Access:	http://psasir.upm.edu.my/id/eprint/90077/1/IPM%202020%2010%20ir.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.90077
record_format	uketd_dc
spelling	my-upm-ir.900772021-12-02T06:31:15Z New compendium of RSA vulnerabilities 2020-01 Abd Ghafar, Amir Hamzah RSA cryptosystem is the most widely deployed public-key encryption scheme in the digital world. It utilizes a hard mathematical problem known as the integer factorization problem (IFP) to confide digital data in transit or at rest. Cryptanalysis against RSA and its variants is vital to point out the weaknesses in the cryptosystem. It also acts as reference points to maintain beyond doubt security aspects of the cryptosystem. Most cryptanalysis or commonly called ‘attacks’ upon RSA focuses on solving the IFP in feasible time. It is based on strategies exploiting the mathematical structures or the implementation workflows of the scheme in hope that it can be emulated by real-world adversary. This thesis compiles five new attacks against the RSA cryptosystem. In the first attack, the RSA primes, p and q do not have small primes factors for p-1 and q-1. This result extends the Pollard’s attack. The second attack focuses on RSA primes with the structure of p = am +rp and q = bm +rq where a,b are very large integers, rp, rq are small integers and m is the power of 2. The attack also takes into the consideration when rp and rq are the least significant bits of p and q. In the third attack, the adversary is assumed capable to retrieve some most significant bits of the RSA private exponent, d of a standard RSA scheme. The fourth attack runs the similar strategies used by the third attack with one exception, it is conducted on an RSA variant known as Chinese Remainder Theorem-RSA. Both third and fourth attacks outlines new weaknesses within RSA public parameters that lead to the factorization of N. We also provide an estimation on the number of possible occurrence. In the final attack, the thesis explores the possibility on how an adversary can break the security of RSA by using vulnerable digital certificates due to its weak RSA key pairs, (N,e). The attack is conducted on a single modified RSA key equation and also the system of modified RSA key equations. Cryptography Data encryption (Computer science) Computer networks - Security measures 2020-01 Thesis http://psasir.upm.edu.my/id/eprint/90077/ http://psasir.upm.edu.my/id/eprint/90077/1/IPM%202020%2010%20ir.pdf text en public doctoral Universiti Putra Malaysia Cryptography Data encryption (Computer science) Computer networks - Security measures Kamel Ariffin, Muhammad Rezal
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
advisor	Kamel Ariffin, Muhammad Rezal
topic	Cryptography Data encryption (Computer science) Computer networks - Security measures
spellingShingle	Cryptography Data encryption (Computer science) Computer networks - Security measures Abd Ghafar, Amir Hamzah New compendium of RSA vulnerabilities
description	RSA cryptosystem is the most widely deployed public-key encryption scheme in the digital world. It utilizes a hard mathematical problem known as the integer factorization problem (IFP) to confide digital data in transit or at rest. Cryptanalysis against RSA and its variants is vital to point out the weaknesses in the cryptosystem. It also acts as reference points to maintain beyond doubt security aspects of the cryptosystem. Most cryptanalysis or commonly called ‘attacks’ upon RSA focuses on solving the IFP in feasible time. It is based on strategies exploiting the mathematical structures or the implementation workflows of the scheme in hope that it can be emulated by real-world adversary. This thesis compiles five new attacks against the RSA cryptosystem. In the first attack, the RSA primes, p and q do not have small primes factors for p-1 and q-1. This result extends the Pollard’s attack. The second attack focuses on RSA primes with the structure of p = am +rp and q = bm +rq where a,b are very large integers, rp, rq are small integers and m is the power of 2. The attack also takes into the consideration when rp and rq are the least significant bits of p and q. In the third attack, the adversary is assumed capable to retrieve some most significant bits of the RSA private exponent, d of a standard RSA scheme. The fourth attack runs the similar strategies used by the third attack with one exception, it is conducted on an RSA variant known as Chinese Remainder Theorem-RSA. Both third and fourth attacks outlines new weaknesses within RSA public parameters that lead to the factorization of N. We also provide an estimation on the number of possible occurrence. In the final attack, the thesis explores the possibility on how an adversary can break the security of RSA by using vulnerable digital certificates due to its weak RSA key pairs, (N,e). The attack is conducted on a single modified RSA key equation and also the system of modified RSA key equations.
format	Thesis
qualification_level	Doctorate
author	Abd Ghafar, Amir Hamzah
author_facet	Abd Ghafar, Amir Hamzah
author_sort	Abd Ghafar, Amir Hamzah
title	New compendium of RSA vulnerabilities
title_short	New compendium of RSA vulnerabilities
title_full	New compendium of RSA vulnerabilities
title_fullStr	New compendium of RSA vulnerabilities
title_full_unstemmed	New compendium of RSA vulnerabilities
title_sort	new compendium of rsa vulnerabilities
granting_institution	Universiti Putra Malaysia
publishDate	2020
url	http://psasir.upm.edu.my/id/eprint/90077/1/IPM%202020%2010%20ir.pdf
_version_	1747813608232845312

New compendium of RSA vulnerabilities

Similar Items