Am Di 01.07.2014, 17:28:36 schrieb Robert J. Hansen: > The integer factorization problem (the math RSA is built upon) is > conjectured to be infeasible to break.
Yeah, but someone told us (pointed us at) here some time ago that breaking RSA was NOT the same like breaking RSA... ;-) -- Crypto für alle: http://www.openpgp-schulungen.de/fuer/unterstuetzer/ http://userbase.kde.org/Concepts/OpenPGP_Help_Spread OpenPGP: 7D82 FB9F D25A 2CE4 5241 6C37 BF4B 8EEF 1A57 1DF5
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ Gnupg-users mailing list [email protected] http://lists.gnupg.org/mailman/listinfo/gnupg-users
