Code and ciphers: Julius Caesar, the Enigma and the internet
Code and ciphers: Julius Caesar, the Enigma and the internet
Code and ciphers: Julius Caesar, the Enigma and the internet
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
232<br />
references<br />
[6.7] Almost any elementary book on <strong>the</strong> <strong>the</strong>ory of numbers will include an account of<br />
continued fractions, which are used for finding good rational approximations to<br />
irrational numbers. Hardy <strong>and</strong> Wright’s book, [10.1], is particularly good.<br />
Chapter 7<br />
[7.1] Public Records Office: [1.5]. Appendix XXXIII covers garbo’s <strong>ciphers</strong> <strong>and</strong><br />
transmitting plans.<br />
Chapter 8<br />
[8.1] Feller, William: An Introduction to Probability Theory <strong>and</strong> Its Applications, Volume 1,<br />
3rd Edition, John Wiley & Sons, New York (1972).<br />
[8.2] Golomb, S.W.: Shift Register Sequences, Holden-Day, San Francisco (1967).<br />
[8.3] Hammersley, J.W. <strong>and</strong> D.C. H<strong>and</strong>scomb: Monte Carlo Methods, Methuen, London<br />
(1964).<br />
[8.4] Press, W.H., B.P. Flannery, S.A. Teukolsky <strong>and</strong> W.T. Vetterling: Numerical Recipes,<br />
Cambridge University Press (1986).<br />
Chapter 9<br />
[9.1] Churchhouse, R.F.: ‘Aclassical cipher machine: <strong>the</strong> enigma – some aspects of its<br />
history <strong>and</strong> solution’, Bulletin of <strong>the</strong> Institute of Ma<strong>the</strong>matics <strong>and</strong> Its Applications, 27<br />
(1991), 129–37. (A proof of <strong>the</strong> ‘chaining <strong>the</strong>orem’ is given on page 134.)<br />
[9.2] Hinsley, F.H. <strong>and</strong> Alan Stripp (eds): [2.5]. Chapters 11–17 (pages 81–137) are<br />
devoted to <strong>the</strong> <strong>Enigma</strong>.<br />
[9.3] Garlinski, J.: Intercept. The ENIGMA War, Magnum Books (Methuen), London<br />
(1981). In addition to covering <strong>the</strong> history of <strong>the</strong> <strong>Enigma</strong> <strong>and</strong> its solution this<br />
book contains an appendix by Colonel Tadeusz Lisicki which explains <strong>the</strong> Polish<br />
method of solution in some detail.<br />
[9.4] Deavours, C.A.: Breakthrough ’32: The Polish Solution of <strong>the</strong> enigma, Aegean Park<br />
Press, Laguna Hills, California (1988).This booklet includes an MS DOS diskette<br />
for an IBM PC (in BASIC <strong>and</strong> machine language) with fully worked examples,<br />
wheel wirings etc.<br />
[9.5] Hinsley, F.H. <strong>and</strong> Alan Stripp (eds): [2.5]. Chapter 16 (pages 123–31) by Peter<br />
Twinn deals with <strong>the</strong> Abwehr <strong>Enigma</strong>.<br />
Chapter 10<br />
[10.1] Hardy, G.H. <strong>and</strong> E.M. Wright: An Introduction to <strong>the</strong> Theory of Numbers, Oxford<br />
University Press. The chapter on ‘Partitions’ in any of <strong>the</strong> editions. The identity<br />
referred to is a classical elementary <strong>the</strong>orem in combinatorics.<br />
[10.2] Andrews, G.E.: The Theory of Partitions, Addison-Wesley, Reading, Massachusetts<br />
(1976). The formula for <strong>the</strong> number of compositions of a number is given in<br />
Example 3 on page 63.