PGP

Karl Lui Barrus klbarrus at owlnet.rice.edu
Tue Feb 1 15:30:42 PST 1994


-----BEGIN PGP SIGNED MESSAGE-----

>Brute-forcing IDEA takes about as much computation as factoring
>something between a 1200 and 3000 bit RSA key (I've heard both
>numbers, but I don't know the numbers).  So, in the current
>implementation, RSA is the weak link!

Yes, I think that the turnaround point is right around 1600 bits, at
which IDEA is "easier" than RSA.

Assuming of course brute force is the fastest way to break IDEA;
the fastest (known|published) factoring method runs in time
proportional to the formula I typed out, etc.

Karl Barrus
klbarrus at owlnet.rice.edu


-----BEGIN PGP SIGNATURE-----
Version: 2.3a

iQCVAgUBLU7l2IOA7OpLWtYzAQE7fwP6A6ENOTE7dUl0gbqEk17NRLPnExCHa2za
HEt3LTfbn/0gpTfrwnKUTCKP3TAvnVJJ/cDFxRR1RkaTyHxA0RvQR/b8SosFK2Uc
HEY5I5AqNVUKE9TceDXcBnYmmMbZAIMpdMMTknrn3Eyo1kcfLGTfOInH0wM35Rdl
/o/sPMmc23s=
=S2+w
-----END PGP SIGNATURE-----






More information about the cypherpunks-legacy mailing list