Cryptanalysis of a modern rotor machine in a multicast setting
S Kepley, D Russo, R Steinwandt - Cryptologia, 2016 - Taylor & Francis
S Kepley, D Russo, R Steinwandt
Cryptologia, 2016•Taylor & FrancisAt FSE'93, Anderson presented a modern byte-oriented rotor machine that is suitable for fast
software implementation. Building on a combination of chosen ciphertexts and chosen
plaintexts, the authors 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.
software implementation. Building on a combination of chosen ciphertexts and chosen
plaintexts, the authors 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.
Abstract
At FSE ’93, Anderson presented a modern byte-oriented rotor machine that is suitable for fast software implementation. Building on a combination of chosen ciphertexts and chosen plaintexts, the authors 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.
Taylor & Francis OnlineShowing the best result for this search. See all results