28 June 2018. J.D.L.R.G.

RSA R.I.P. or why RSA is unsafe

I will try to do my best, I´m not a native english speaker.

This has been in the back of my mind for a long time now. What if the most advanced encryption
protocol for communication is actualy unsafe? What if we got everything wrong? Maybe we need
new math for the NEW CENTURY.

Here´s in theory what should be verified but nobody has proved yet: unreversible functions (trap
functions or one-way functions, http://mathworld.wolfram.com/One-WayFunction.html) do exist
(we only want to believe it exists),

But what if n = p x q, p and q primes, is reversible in a strange but possible and valid in a way?

Here´s the catch:

First we will treat a dependent variable as if it is an independent variable!, that’s right you read it
right, this step is required to find a continuous value in a discontinuous curve (you read right),

We have the equation

N=pxq

and then we will get an equation like this,

q(p) = n/p

which is a ligature. The relation, R, between p and q its non-linear. As p linearly approaches √n, q
non-linearly approaches √n
As we only need one of its prime composites to be less than √n, its respective function or graph is
the following,

From here on its just a matter of optimization, if we work out a smart search of values over the
curve, that is, a logarithmic search,
we can find an answer for

N=pxq

in at least logarithmic time complexity O(log(n)), smartly trying each multiplication p x q and
observing the fractional part, that is k/y, in p = x + (k/y).

We can see an answer can be approximated using a quadrature, actually it would be easier to start
from there and search upwards to higher or lower values depending on the correct direction.

The “magic” happens when the residues or fractional part of the primes becomes the objective
“function” for the optimization of our “y(x) = c/x” type of curve. We can observe how the
fractional part of our objective function (factor) is always increasing or decreasing UNTIL it crosses
A precise boundary, a boundary necessary for RSA to work properly, the equilibrium point!

As a final step we use the answer value to reverse engineer the correct answer to decrypt RSA,
that’s the extended euclidean algorithm,

Pseudo-pseudocode:

1. Derive the continuous equation.

2. Solve for equilibrium of fractional part of division (mod).

3. Calculate modular multiplicative inverse of n.

And that´s it, with all the above it´s only a matter of derivation of the respective algorithm, to
unlock RSA.

If you want to support me contact me at jon.dlrg@gmail.com

If you want to send code, Subject: rsa-code