Abstract
© 2016, Copyright © Taylor & Francis.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.
Original language | English |
---|---|
Pages (from-to) | 515-521 |
Journal | Cryptologia |
Volume | 40 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1 Nov 2016 |
Externally published | Yes |