17 Dec
2003
17 Dec
'03
11:17 p.m.
-----BEGIN PGP SIGNED MESSAGE-----
"Raph" == Raph Levien <raph@CS.Berkeley.EDU> writes:
Raph> Since RSA decryption is cubic in key size, it takes about Raph> twenty times as long to sign or decrypt a message. Since Actually Sedgewick shows an algorithm that runs in O(N*N*log N). Andreas -----BEGIN PGP SIGNATURE----- Version: 2.6.2 Comment: Processed by Mailcrypt 3.4, an Emacs/PGP interface iQCVAgUBMKNApkyjTSyISdw9AQHSVQP/eUBnTOX/kzZU4/T3w/60mnj0GpT88Saa qsgLq3N2b2U2lOOmQYE5JGb9FTds/3Hj9kxKMGxmSlyt3nOjgWmAKLJf5AvDMY1Y MzSVaswzst/EyQYeQBZcUl+ahy3HFLLR8CUMX/IIeJS0w3iJbW4FNsmsTqCf/7Tg p1Pa+TXQKYk= =Vrsb -----END PGP SIGNATURE-----