General Mathematics


Fast Method of Factoring Decomposition of Rsa Cipher Vol.0

Authors: Toshiro Takami

We found that prime numbers repeat every 30, and all prime numbers are represented by 30 m + n (positive integer including m is 0, n is a prime number smaller than 30 excluding 2 and 5). If the end of the multiplication of the giant prime and the giant prime here is 5, it can be seen that any of the ends of each gigantic prime is 5. In other words, the one multiplied by a huge prime number and a huge prime number, (30 m + n) * (30 s + t) = 900 ms + 30 (mt + ns) + nt (positive integer including s is 0, t is a prime number smaller than 30 excluding 2 and 5) . nt includes something that is not a prime number. 33, 63, 93 and so on. For example 1976869607 = 27109 * 72923 (both primes 27109 and 72923) , But this factorization is unknown to third parties. 1976869607 is a 10 digit integer and has 1 first. ms is counted as a positive integer of 6 digits (although there is a possibility of 7 digits). Register with the last number of nt (the last digit) and prime factorize. In the upper number, the last digit of nt is 7. The last digit of nt is 7 (3, 19) (7, 11) (13, 19) (13, 29) (19, 23) (23, 29) . A program that prime factorization can be solved quickly when paying attention to the last 7. First, divide by 3, 7, 11, 13, 17, 19, 23, 29 to see if it is an integer. If it is an integer it has that number as a prime factor. The last 607 of 1976869607 is a prime number. A huge odd number (one multiplied by a huge prime number and a huge prime number) can be factorized using this factor. By using this, it seems that the rupture of the RSA encryption becomes faster.

Comments: 11 Pages.

Download: PDF

Submission history

[v1] 2018-09-08 02:45:06

Unique-IP document downloads: 9 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