Cryptanalysis of a modern rotor machine in a multicast setting
Abstract
Abstract. 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 systemSimilar works
This paper was published in CiteSeerX.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.