At FSE '93, Anderson presented a modern byte-oriented ro-
tor machine that is suitable for fast software implementation. Building
on a combination of chosen ciphertexts and chosen plaintexts, we show
that in a setting with multiple recipients the recovery of an (equivalent) secret key can be feasible within minutes in a standard computer algebra system.
↧