bugtraq - Re: Breaking RSA: Totient indirect factorization

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-ID: <8cf636140711151933j15a7a888m848246af8fda3767@mail.gmail.com>
Date: Thu, 15 Nov 2007 22:33:16 -0500
From: "Erick Galinkin" <erick.galinkin@...il.com>
Cc: bugtraq@...urityfocus.com
Subject: Re: Breaking RSA: Totient indirect factorization

Gandlf, I'm working on a bizarrely similar project (you don't happen
to hail from New York, do you?) and have found that using the totient
function, you'd need an absurdly large number of CPU cycles to factor
RSA properly, slightly less than brute force... like, 2^5 cycles less.
The algorithm has such an absurdly high order of complexity that you'd
be wasting your time. You'd sooner solve the Riemann Hypothesis.

I have books of data on what is seemingly an identical algorithm;
please e-mail me directly if you're interested in doing this type of
research

~Erick