{"id":164,"date":"2017-01-30T20:22:43","date_gmt":"2017-01-30T20:22:43","guid":{"rendered":"http:\/\/wordpress.rose-hulman.edu\/holden\/?page_id=164"},"modified":"2021-07-30T18:02:43","modified_gmt":"2021-07-30T18:02:43","slug":"errata","status":"publish","type":"page","link":"https:\/\/wordpress.rose-hulman.edu\/holden\/the-mathematics-of-secrets\/errata\/","title":{"rendered":"Errata"},"content":{"rendered":"

Errors and Omissions:<\/h2>\n

(Errors in black have been fixed in the paperback printing.\u00a0 Errors in blue<\/span> have not.)<\/p>\n

In Section 1.3, on page 13, the second example should be:<\/p>\n

26 = 6 \u00d7 4 + 2
\n6 = 2 \u00d7 3 + 0<\/p>\n

Also, just under that example it should say “We see that 6 is a bad key, since 2 divides 6 and 2 divides 26.”<\/p>\n

In Section 1.6, on page 23, the last paragraph should say that the number of good keys for a Hill cipher is about 160,000 for a block size of 2, and about 1,600,000,000,000 for a block size of 3.<\/p>\n

In Section 1.6, on page 24, near the end of the second paragraph it should say \u201cEven in 1929, Hill designed a machine that used a set of gears to mechanically encipher texts using block size 6 and was thus essentially unbreakable using frequency analysis.\u201d\u00a0 [Chris Christensen points out that the machine seems never to have been built.]<\/p>\n

In Section 1.7, on page 26, we find that the example does not work as stated because (5 \u00d7 24 \u2212 22 \u00d7 5) does not have an inverse modulo 26.\u00a0 If Eve was in this position she would have to try again with a different pair of plaintext blocks.\u00a0 For example, if she used the first and last block she would find (10 \u00d7 24 \u2212 1 \u00d7 5) does have an inverse, so she could finish the attack.<\/p>\n

(In the paperback printing, the example on page 26 is correct except that the equation for k<\/em>1 <\/sub>should be:<\/span><\/p>\n

\"equation\")<\/span><\/p>\n

In Section 2.1, on page 30, in the first paragraph the four symbols described should each occur with just over 3% frequency, not 4%.<\/p>\n

In Section 2.2, on page 35, the last paragraph should say:<\/p>\n

On the other hand, the following ciphertext can be calculated to have an index of coincidence of approximately .046\u2014not as low as random text, but much lower than a simple substitution cipher in the majority (though not all) of the world’s most commonly spoken languages.<\/p>\n

In Section 2.5, on pages 44, 45, and 47, the numbers .038 and .066 are consistently switched.\u00a0 The probability that two letters enciphered the same way are the same is .066, and so is the index of coincidence if \u2113=1.\u00a0 The probability that two letters enciphered with different keys are the same is .038, and so is the index of coincidence if \u2113=n<\/em>.\u00a0 For n<\/em> = 25 and \u2113 = 4, we would expect the index to be about (5.25\/24) \u00d7 .066 + (18.75\/24) \u00d7 .038, which is about .044.\u00a0 The first equation on page 47 has the numbers switched but the second equation is correct.<\/span><\/p>\n

In Section 2.5, on page 50, the second line marked “keyword 2” should end in “E E E”.<\/p>\n

In Section 2.5, in the middle of page 51, it should say “So going back to our mystery ciphertext from page 46”.<\/p>\n

The caption for Table 2.5 on page 54 should say “Sums of the letter frequencies for each<\/span>
\npossible key applied to column II of our ciphertext” and the first (partial) paragraph on page 55 should end with “Table 2.5 shows the sums of the frequencies for<\/span>
\neach possible key applied to the second column of the ciphertext.”<\/span><\/p>\n

Figure 2.3 on page 59 was created by Wikipedia user “Matt Crypto”.<\/p>\n

Figure 2.5 on page 60 was created by Eric Pierce, Wikipedia user name “Wapcaplet”.<\/p>\n

Figure 2.6 on page 65 was created by Wikipedia user “RadioFan”.<\/p>\n

In Section 2.8, in the example on page 65, the second-last line should be:<\/p>\n

minus 1: 5 8 11 14 17 20 23 26 3 \u00b7 \u00b7 \u00b7 22 25 2<\/p>\n

Figure 3.1 should be:<\/p>\n

\"\"<\/p>\n

Figure 3.1. A scytale.<\/p>\n

In Section 3.3, at the bottom of page 84, there are two ! symbols missing.\u00a0 It should say:<\/p>\n

Mathematicians use the symbol n<\/em>! to represent this number and call it the factorial of n<\/em>, or just n<\/em> factorial. Factorials get pretty big pretty fast; for example 12! = 479,001,600, so there are 479,001,600 different permutation ciphers using 12-letter groups.<\/p>\n

In Section 3.6, the first sentence of the last paragraph on page 99 should say “The grand total turns out to be \u2248 41.387; dividing that by 23 (the number of rows minus 1) gives \u2248 1.799 for the variance.”<\/p>\n

At the beginning of Sidebar 5.1, on page 150, it should say “When you got to the part of this book about the contact method, in Section 3.7”.<\/p>\n

In Sidebar 5.1, in the second paragraph on page 151, it should say “The chance of picking the letter a (for instance) out of the suspected plaintext is na <\/sub><\/em>\/ n<\/em>“.<\/p>\n

In the first paragraph of Section 5.3, on page 157, it should say “His idea was to use the plaintext itself as a \u201ckey\u201d to construct the ciphertext”.<\/p>\n

Also in Section 5.3, on page 157, the end of the first example is incorrect.\u00a0 It should be (and the ciphertext on the next page should match):<\/p>\n

        keystream: O N O N C A S T I O N C O N C\r\n        plaintext: o n c a s t i n g t h e d i e\r\n       ciphertext: D B R O V U B H P I V H S W H\r\n<\/pre>\n
Still in Section 5.3, on page 159, just before the second example on that page, it should say “For example, we could apply the 25P<\/em> + 1, or atbash, transformation to each plaintext
\nletter before using it”.<\/p>\n
In Figure 5.2, the picture for “ECB encryption” should be:<\/p>\n
(*&&&!(*&&&!(\r\n*&&&&&&&&&&&!\r\n(*&&&&&&&&&!(\r\n(((*&&&&&!(((\r\n(((((*&!(((((<\/pre>\n
Figure 5.15 should be:<\/p>\n
\"\"<\/p>\n
Figure 5.15. The Trivium cipher.<\/p>\n
In Sidebar 6.1, near the bottom of page 198, it should say “If n = pa<\/sup>qb<\/sup>rc<\/sup> is a product containing three different primes”.<\/p>\n
In Section 7.4, at the top of page 217, the first sentence of the paragraph should say “What the factoring problem was missing was a trap door”, and the end of the paragraph should say “the one-way function of multiplication would be the trap door in the one-way function of exponentiation.”<\/p>\n
In Section 7.7, on pages 229 and 230, “Zanzibar” is unfortunately misspelled in the example.\u00a0 (“Zanzibari” is also misspelled on page 230.)\u00a0 The second line of each part of the example should be:<\/p>\n
        plaintext: za    nz      ib     ar     zo     os\r\n          numbers: 0, 1  14, 0   9, 2   1, 18  0, 15  15, 19\r\n         together: 001   1400    902    118    015    1519\r\n to the 3rd power: 1     1585    3022   2364   3375   581\r\n\r\n       ciphertext: 1     1585    3022   2364   3375   581\r\n to the 1\/3 power: 1.00  11.66   14.46  13.32  15.00  8.34\r\nplaintext numbers: 001   ??      ??     ??     015    ??\r\n        plaintext: za    ??      ??     ??     zo     ??<\/pre>\n
Also in Section 7.7, the chosen-ciphertext attack example on page 230 is incorrect.\u00a0 The modulus n<\/em> should be 4069, the encryption exponent e<\/em> should be 749, and Eve’s “ciphertext” should be:<\/p>\n
    \u201cciphertext\u201d: 3029 1064 1402 3   5    1172 3917 1483\r\nto the dth power: 1612 501  1905 243 3125 2008 114  1119\r\n     \u201cplaintext\u201d: pl   ea   se   b?  ?y   th   an   ks\r\n<\/pre>\n
Also in Section 7.7,\u00a0 at the bottom of page 231, it should say:<\/p>\n
2214 \u2261 P <\/em>3<\/sup> modulo 3763\u00a0\u00a0\u00a0\u00a0\u00a0 and\u00a0\u00a0\u00a0\u00a0\u00a0 2019 \u2261 P <\/em>17<\/sup> modulo 3763.<\/p>\n
In Appendix A, on page 239 (and also in the Index), Malcolm Williamson’s name is misspelled.<\/p>\n
In Section 8.3, at the bottom of page 256, the last equation should be:<\/p>\n
\"\"<\/p>\n
Also in Section 8.3, the second set of equations on page 257 should be:<\/p>\n
\u00a0\"\"<\/p>\n
Still in Section 8.3, on page 259, the second and third equations should be:<\/p>\n
32<\/sup> = 53<\/sup> + 17<\/p>\n
and<\/p>\n
32<\/sup> \u2261 53<\/sup> + 17 modulo 7<\/p>\n
In Section 8.5, on page 274, in the middle of the second paragraph, it should say:\u00a0 “As the name suggests, Dual EC DRBG uses two elliptic curve discrete logarithm problems.”<\/p>\n
The caption for Figure 9.13 should read:\u00a0\u00a0 “A good set of generators (top) and a bad set of generators (bottom) for the same lattice.”<\/p>\n
In Section 9.2, on page 289, the letter t should correspond to the number 20 in four places.<\/span><\/p>\n
In Section 9.3, near the bottom of page 293, it should say “Such a filter is designed to let photons through only if they are vibrating in the same direction as the filter.”<\/p>\n
Figure 9.17 should be:<\/p>\n
\"\"<\/p>\n
Figure 9.17. Polarized photons after passing through a filter.<\/p>\n
Typos:<\/h2>\n
In Section 1.3, in the middle of page 7, it should say\u00a0 “Well, we should translate our letters into numbers, of course.”<\/p>\n
Also in Section 1.3, in the first paragraph of page 15, “a number and its inverse” should not have an apostrophe.<\/p>\n
In Section 2.7, near the bottom of page 57, it should say “tabula recta encryption”.<\/p>\n
In Sidebar 3.1, the ratio of the perimeter of a circle to its diameter should be 3.14159….<\/p>\n
The caption for Table 5.1 should read “A series of ciphertexts encrypted with the same running key.”<\/p>\n
In Section 5.4, after the second displayed equation on page 169, it should say \u201cwhere i<\/em> and j<\/em> tell us how far back in the keystream to go\u201d.<\/span><\/p>\n
On pages 175, 180, and 323, it should say “LFSR” and “NLFSR” instead of “LSFR” and “NLSFR”.<\/p>\n
In Section 9.2, on page 287, the first sentence of the first full paragraph should say “How do we make that into an asymmetric-key cryptographic system?”<\/p>\n
In the List of Symbols, page 303, the third entry should be:<\/p>\n
C\u00a0\u00a0\u00a0 <\/em>A number representing ciphertext.\u00a0\u00a0\u00a0 16<\/p>\n
In the Notes, on page 310, it should say:<\/p>\n
(Page 66) once every 26 letters<\/strong>: Note that in most versions of the famous German Enigma rotor machine, the motion is more complicated than this.<\/p>\n
In the Notes, on page 324, it should say:<\/p>\n
(Page 177) various logistical reasons<\/strong>: Audio data or file transfers would need to be
\ncarefully synchronized; raw digital data collection requires access to the phone itself
\nor a computer connected to it, and so on.<\/p>\n
In the Notes, on page 336, it should say:<\/p>\n
(Page 268) Alice signs and then encrypts<\/strong><\/p>\n
Other notes:<\/h2>\n
Karst Koymans and Liu Mingxing both pointed out an even faster way to do the multiplication on page 189.\u00a0 Start by making a table of P<\/em>2<\/sup>, P<\/em>3<\/sup>, …, P<\/em>10<\/sup>.\u00a0 This takes 9 multiplications.\u00a0 Then use P<\/em>10<\/sup> to make another table of P<\/em>20<\/sup>, P<\/em>30<\/sup>, …, P<\/em>100<\/sup>, taking another 9 multiplications.\u00a0 Now use\u00a0P<\/em>100<\/sup> to calculate P<\/em>200<\/sup>, P<\/em>300<\/sup>, P<\/em>400<\/sup>, P<\/em>500<\/sup>, P<\/em>600<\/sup>, P<\/em>700<\/sup>, taking 6 more multiplications.\u00a0 Finally, multiply P<\/em>700<\/sup> from the third list by P<\/em>60 <\/sup>from the second list and P<\/em>9 <\/sup>from the first list with 2 more multiplications, for 26 total.\u00a0\u00a0 (Incidentally, the method using binary numbers mentioned in the note on page 326 takes only 11 multiplications.)<\/p>\n
\n
Thanks to Richard Bean, Chris Christensen, John Fuqua, Tom Jerardi, Steve Greenfield, Karst Koymans,\u00a0 Liu Mingxing, and David Miller.\u00a0 (So far.)\u00a0 My apologies to anyone I’ve forgotten.<\/p>\n
\n
\n
<\/div>\n<\/div>\n
<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Errors and Omissions: (Errors in black have been fixed in the paperback printing.\u00a0 Errors in blue have not.) In Section 1.3, on page 13, the second example should be: 26 = 6 \u00d7 4 + 2 6 = 2 \u00d7 3 + 0 Also, just under that example it should say “We see that 6 … Continue reading Errata<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":938,"featured_media":0,"parent":155,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-164","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/P8uE0W-2E","_links":{"self":[{"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/pages\/164","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/users\/938"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/comments?post=164"}],"version-history":[{"count":60,"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/pages\/164\/revisions"}],"predecessor-version":[{"id":1633,"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/pages\/164\/revisions\/1633"}],"up":[{"embeddable":true,"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/pages\/155"}],"wp:attachment":[{"href":"https:\/\/wordpress.rose-hulman.edu\/holden\/wp-json\/wp\/v2\/media?parent=164"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}