A STUDY OF REJEWSKI'S EQUATIONS
暂无分享,去创建一个
ABSTRACT We look at a question of Marian Rejewski. Can the system of six equations, by which he solved the internal wiring of the Enigma, be solved without knowing specific plugboard settings? A complexity result and some counting arguments give some partial results but Rejewski's question remains open. We also look at Rejewski's proposed solution of the plugboard problem.
[1] R. Lyndon. Equations in groups , 1980 .
[2] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .
[3] Hugh Sebag-Montefiore. Enigma: The Battle for the Code , 2000 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[6] J. Rotman. An Introduction to the Theory of Groups , 1965 .