Cryptanalysis of a modern rotor machine in a multicast setting

S. Kepley; D. Russo; R. Steinwandt

doi:10.1080/01611194.2015.1115443

Cryptanalysis of a modern rotor machine in a multicast setting

S. Kepley, D. Russo, R. Steinwandt

Research output: Contribution to Journal › Article › Academic › peer-review

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	https://doi.org/10.1080/01611194.2015.1115443
Publication status	Published - 1 Nov 2016
Externally published	Yes

Access to Document

10.1080/01611194.2015.1115443

Handle.net

Persistent link

Cite this

@article{e38c29a8d0d44ab9bd0ed6712b843d35,

title = "Cryptanalysis of a modern rotor machine in a multicast setting",

abstract = "{\textcopyright} 2016, Copyright {\textcopyright} Taylor & Francis.At FSE {\textquoteright}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.",

author = "S. Kepley and D. Russo and R. Steinwandt",

year = "2016",

month = nov,

day = "1",

doi = "10.1080/01611194.2015.1115443",

language = "English",

volume = "40",

pages = "515--521",

journal = "Cryptologia",

issn = "0161-1194",

publisher = "Routledge",

number = "6",

}

TY - JOUR

T1 - Cryptanalysis of a modern rotor machine in a multicast setting

AU - Kepley, S.

AU - Russo, D.

AU - Steinwandt, R.

PY - 2016/11/1

Y1 - 2016/11/1

N2 - © 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.

AB - © 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.

U2 - 10.1080/01611194.2015.1115443

DO - 10.1080/01611194.2015.1115443

M3 - Article

VL - 40

SP - 515

EP - 521

JO - Cryptologia

JF - Cryptologia

SN - 0161-1194

IS - 6

ER -

Cryptanalysis of a modern rotor machine in a multicast setting

Abstract

Access to Document

Handle.net

Fingerprint

Cite this