Rotor in Jython?

[brueckd at tbye.com]

On 1 Mar 2002, Paul Rubin wrote:

> <brueckd at tbye.com> writes:
> > Put another way: sorting by key length, AES beats rotors hands down.
> > Sorting by computational cost, rotors always win because you can just make
> > the keys longer (without having to reimplement your crypto).
>
> Longer keys are only relevant if breaking the cipher requires searching
> for the key.

Heheh... that's essentially what cryptanalysis is - finding the key since
in most cases the algorithm itself is known. If you're referring to
non-brute force key searches, then key length is relevent there as well
(unless the algorithm itself is flawed). For example, in differential
cryptanalysis of DES you're basically deducing bits of the key until you
have so few remaining that a brute force attack becomes feasible. Longer
key sizes (and a higher number of rounds) have an enormous impact on
whether or not you'll ultimately be successful.

-Dave