Number Theory


Rsa Encryption 2048 NPQ

Authors: Ricardo Gil

The purpose of this paper is to provide algorithm that is 5 lines of code and that finds P & Q when N is given. It will work for RSA-2048 if the computer can float large numbers in PyCharm or Python. Also, the P&Q from Part I of the algorithm becomes the range for a for loop in Part II that returns and solves P*Q=N (True).

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2017-03-01 04:34:21

Unique-IP document downloads: 74 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus