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 mailbox.org is useful. Maybe we'll have to look at this topic again in 10 years or so. Have a nice day. -- PGP: 0x7694EB9B (http://rosetree.de/pgp) http://www.email-nur-an-dich.de/
signature.asc
Description: OpenPGP digital signature
_______________________________________________ Gnupg-users mailing list [email protected] http://lists.gnupg.org/mailman/listinfo/gnupg-users
