There is a serious flaw in cryptography based on semiprimes. While attempts
at breaking such cryptography typically focus on factoring semiprimes, the
approach I have identified sidesteps this challenge entirely. I have yet to
evaluate my techniques performance on keys of practical length, a
I made a mistake with my description of finding the decryption key. You
actually need to find loop exponents for both the cipher text and a
reencryption of it (the second search is scaled to be faster and sometimes
the first exponent works for both). This is to make sure that the exponent
picked
at 12:31 AM, Damien Miller <d...@mindrot.org> wrote:
> can you demonstrate this attack with small-modulus RSA key?
>
> E.g. the attached
>
> On Tue, 16 Jan 2018, Gabriel Withington wrote:
>
> > There is a serious flaw in cryptography based on semiprimes. Wh
The common complaint that I've received about my attack is that it doesn't
work on real keys in real time on my laptop. Now, this is a silly bar to
set. The real question is what happens on a fast computer. (If I can break
a 1024 bit key in 1000 years on my computer, this is a significant
16, 2018 at 1:10 PM, Gabriel Withington <
gabriel.withing...@gmail.com> wrote:
> There is a serious flaw in cryptography based on semiprimes. While
> attempts at breaking such cryptography typically focus on factoring
> semiprimes, the approach I have identified sidesteps this chall
