Re: Breaking RSA: Totient indirect factorization
This is an OpenPGP/MIME signed message (RFC 2440 and 3156)
--------------enig357643D7A6333DFB4E2A1033
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
This is an exponential space algorithm and therefore utterly and
completely useless with regards to factoring.
>=20
> Algorithm
> ---------
>=20
> - Repeat "a =3D a^n mod m" with n from 2 to m, saving all the results i=
n
> a table until a =3D=3D 1 (Statement 4).
> - Examine the table from end to begining printing "n" if the number of
> "ones" is divided by "n" (Statements 1,2,3),
>=20
>=20
--------------enig357643D7A6333DFB4E2A1033
Content-Type: application/pgp-signature; name="signature.asc"
Content-Description: OpenPGP digital signature
Content-Disposition: attachment; filename="signature.asc"
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.7 (Darwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
iD8DBQFHO4dwGV+aWVfIlEMRA+x0AKCkVSxmKgxE5R6eGv4LV6GP0T9VUwCglspi
xGXbvsDhYlLg73V6AjwC8ug=
=nh7b
-----END PGP SIGNATURE-----
--------------enig357643D7A6333DFB4E2A1033--
討論串 (同標題文章)
完整討論串 (本文為第 6 之 6 篇)：