Rotor in Jython?

[Paul Rubin]

<brueckd at tbye.com> writes:
> > <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). 

Yes, that's the point.  AES appears to be very attack resistant.
Compared to AES, rotors have a pretty sorry history of falling to
cryptanalysis.  There's no reason to think brute force is the best
way to solve a rotor cipher.