Calculating the Private Key

Micha Rosenbaum micha at
Wed Jul 2 08:37:28 CEST 2014

On 01.07.2014 23:28, Robert J. Hansen wrote:
> Assuming you mean "RSA as used in GnuPG", it is not feasible with the
> kinds of computers we know how to build.  It will take science-fiction
> level breakthroughs in either engineering, mathematics, or both, to do this.
> The integer factorization problem (the math RSA is built upon) is
> conjectured to be infeasible to break.  There is no formal proof of it,
> though.

Thanks for your answer. Then I am convinced that the feature offered by is useful. Maybe we'll have to look at this topic again in
10 years or so.

Have a nice day.

PGP: 0x7694EB9B (

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: OpenPGP digital signature
URL: </pipermail/attachments/20140702/1be7ef23/attachment.sig>

More information about the Gnupg-users mailing list