| Description |
1 online resource |
| Contents |
<P>Preface to the Second Edition xvii</p> <p>Acknowledgments for the Second Edition xxiii</p> <p>Book Website xxv</p> <p>About the Authors xxvii</p> <p><b>I Mainly Cryptography 1</b></p> <p><b>1 Historical Introduction and the Life and Work of Claude E. Shannon 3</b></p> <p>1.1 Historical Background 3</p> <p>1.2 Brief Biography of Claude E. Shannon 9</p> <p>1.3 Career 10</p> <p>1.4 Personal -- Professional 10</p> <p>1.5 Scientific Legacy 11</p> <p>1.6 The Data Encryption Standard Code, DES, 1977-2005 14</p> <p>1.7 Post-Shannon Developments 15</p> <p><b>2 Classical Ciphers and Their Cryptanalysis 21</b></p> <p>2.1 Introduction 22</p> <p>2.2 The Caesar Cipher 22</p> <p>2.3 The Scytale Cipher 24</p> <p>2.4 The Vigeǹere Cipher 25</p> <p>2.5 Frequency Analysis 26</p> <p>2.6 Breaking the Vigeǹere Cipher, Babbage-Kasiski 27</p> <p>2.7 The Enigma Machine and Its Mathematics 33</p> <p>2.8 Modern Enciphering Systems 37</p> <p>2.9 Problems 37</p> <p>2.10 Solutions 39</p> <p><b>3 RSA, Key Searches, TLS, and Encrypting Email 47</b></p> <p>3.1 The Basic Idea of Cryptography 49</p> <p>3.2 Public Key Cryptography and RSA on a Calculator 53</p> <p>3.3 The General RSA Algorithm 56</p> <p>3.4 Public Key Versus Symmetric Key 60</p> <p>3.5 Attacks, Security, Catch-22 of Cryptography 62</p> <p>3.6 Summary of Encryption 65</p> <p>3.7 The Diffie-Hellman Key Exchange 66</p> <p>3.8 Intruder-in-the-Middle Attack on the Diffie-Hellman (or Elliptic Curve) Key-Exchange 69</p> <p>3.9 TLS (Transport Layer Security) 70</p> <p>3.10 PGP and GPG 72</p> <p>3.11 Problems 73</p> <p>3.12 Solutions 76</p> <p><b>4 The Fundamentals of Modern Cryptography 83</b></p> <p>4.1 Encryption Revisited 83</p> <p>4.2 Block Ciphers, Shannon's Confusion and Diffusion 86</p> <p>4.3 Perfect Secrecy, Stream Ciphers, One-Time Pad 87</p> <p>4.4 Hash Functions 91</p> <p>4.5 Message Integrity Using Symmetric Cryptography 93</p> <p>4.6 General Public Key Cryptosystems 94</p> <p>4.7 Digital Signatures 97</p> <p>4.8 Modifying Encrypted Data and Homomorphic Encryption 99</p> <p>4.9 Quantum Encryption Using Polarized Photons 99</p> <p>4.10 Quantum Encryption Using Entanglement 102</p> <p>4.11 Quantum Key Distribution is Not a Silver Bullet 103</p> <p>4.12 Postquantum Cryptography 104</p> <p>4.13 Key Management and Kerberos 104</p> <p>4.14 Problems 106</p> <p>4.15 Solutions 107</p> <p><b>5 Modes of Operation for AES and Symmetric Algorithms 109</b></p> <p>5.1 Modes of Operation 109</p> <p>5.2 The Advanced Encryption Standard Code 111</p> <p>5.3 Overview of AES 114</p> <p><b>6 Elliptic Curve Cryptography (ECC) 125</b></p> <p>6.1 Abelian Integrals, Fields, Groups 126</p> <p>6.2 Curves, Cryptography 128</p> <p>6.3 The Hasse Theorem, and an Example 129</p> <p>6.4 More Examples 131</p> <p>6.5 The Group Law on Elliptic Curves 131</p> <p>6.6 Key Exchange with Elliptic Curves 134</p> <p>6.7 Elliptic Curves mod <i>n </i>134</p> <p>6.8 Encoding Plain Text 135</p> <p>6.9 Security of ECC 135</p> <p>6.10 More Geometry of Cubic Curves 135</p> <p>6.11 Cubic Curves and Arcs 136</p> <p>6.12 Homogeneous Coordinates 137</p> <p>6.13 Fermat's Last Theorem, Elliptic Curves, Gerhard Frey 137</p> <p>6.14 A Modification of the Standard Version of Elliptic Curve Cryptography 138</p> <p>6.15 Problems 139</p> <p>6.16 Solutions 140</p> <p><b>7 General and Mathematical Attacks in Cryptography 143</b></p> <p>7.1 Cryptanalysis 143</p> <p>7.2 Soft Attacks 144</p> <p>7.3 Brute-Force Attacks 145</p> <p>7.4 Man-in-the-Middle Attacks 146</p> <p>7.5 Relay Attacks, Car Key Fobs 148</p> <p>7.6 Known Plain Text Attacks 150</p> <p>7.7 Known Cipher Text Attacks 151</p> <p>7.8 Chosen Plain Text Attacks 151</p> <p>7.9 Chosen Cipher Text Attacks, Digital Signatures 151</p> <p>7.10 Replay Attacks 152</p> <p>7.11 Birthday Attacks 152</p> <p>7.12 Birthday Attack on Digital Signatures 154</p> <p>7.13 Birthday Attack on the Discrete Log Problem 154</p> <p>7.14 Attacks on RSA 155</p> <p>7.15 Attacks on RSA using Low-Exponents 156</p> <p>7.16 Timing Attack 156</p> <p>7.17 Differential Cryptanalysis 157</p> <p>7.18 Attacks Utilizing Preprocessing 157</p> <p>7.19 Cold Boot Attacks on Encryption Keys 159</p> <p>7.20 Implementation Errors and Unforeseen States 159</p> <p>7.21 Tracking. Bluetooth, WiFi, and Your Smart Phone 163</p> <p>7.22 Keep Up with the Latest Attacks (If You Can) 164</p> <p><b>8 Practical Issues in Modern Cryptography and Communications 165</b></p> <p>8.1 Introduction 165</p> <p>8.2 Hot Issues 167</p> <p>8.3 Authentication 167</p> <p>8.4 User Anonymity 174</p> <p>8.5 E-commerce 175</p> <p>8.6 E-government 176</p> <p>8.7 Key Lengths 178</p> <p>8.8 Digital Rights 179</p> <p>8.9 Wireless Networks 179</p> <p>8.10 Communication Protocols 180</p> <p><b>II Mainly Information Theory 183</b></p> <p><b>9 Information Theory and its Applications 185</b></p> <p>9.1 Axioms, Physics, Computation 186</p> <p>9.2 Entropy 186</p> <p>9.3 Information Gained, Cryptography 188</p> <p>9.4 Practical Applications of Information Theory 190</p> <p>9.5 Information Theory and Physics 192</p> <p>9.6 Axiomatics of Information Theory 193</p> <p>9.7 Number Bases, Erd¨os and the Hand of God 194</p> <p>9.8 Weighing Problems and Your MBA 196</p> <p>9.9 Shannon Bits, the Big Picture 200</p> <p><b>10 Random Variables and Entropy 201</b></p> <p>10.1 Random Variables 201</p> <p>10.2 Mathematics of Entropy 205</p> <p>10.3 Calculating Entropy 206</p> <p>10.4 Conditional Probability 207</p> <p>10.5 Bernoulli Trials 211</p> <p>10.6 Typical Sequences 213</p> <p>10.7 Law of Large Numbers 214</p> <p>10.8 Joint and Conditional Entropy 215</p> <p>10.9 Applications of Entropy 221</p> <p>10.10 Calculation of Mutual Information 221</p> <p>10.11 Mutual Information and Channels 223</p> <p>10.12 The Entropy of <i>X </i>+ <i>Y </i>224</p> <p>10.13 Subadditivity of the Function <i>−x </i>log <i>x </i>225</p> <p>10.14 Entropy and Cryptography 225</p> <p>10.15 Problems 226</p> <p>10.16 Solutions 227</p> <p><b>11 Source Coding, Redundancy 233</b></p> <p>11.1 Introduction, Source Extensions 234</p> <p>11.2 Encodings, Kraft, McMillan 235</p> <p>11.3 Block Coding, the Oracle, Yes-No Questions 241</p> <p>11.4 Optimal Codes 242</p> <p>11.5 Huffman Coding 243</p> <p>11.6 Optimality of Huffman Coding 248</p> <p>11.7 Data Compression, Redundancy 249</p> <p>11.8 Problems 251</p> <p>11.9 Solutions 252</p> <p><b>12 Channels, Capacity, the Fundamental Theorem 255</b></p> <p>12.1 Abstract Channels 256</p> <p>12.2 More Specific Channels 257</p> <p>12.3 New Channels from Old, Cascades 258</p> <p>12.4 Input Probability, Channel Capacity 261</p> <p>12.5 Capacity for General Binary Channels, Entropy 265</p> <p>12.6 Hamming Distance 266</p> <p>12.7 Improving Reliability of a Binary Symmetric Channel 268</p> <p>12.8 Error Correction, Error Reduction, Good Redundancy 268</p> <p>12.9 The Fundamental Theorem of Information Theory 272</p> <p>12.10 Proving the Fundamental Theorem 279</p> <p>12.11 Summary, the Big Picture 281</p> <p>12.12 Postscript: The Capacity of the Binary Symmetric Channel 282</p> <p>12.13 Problems 283</p> <p>12.14 Solutions 284</p> <p><b>13 Signals, Sampling, Coding Gain, Shannon's Information Capacity Theorem 287</b></p> <p>13.1 Continuous Signals, Shannon's Sampling Theorem 288</p> <p>13.2 The Band-Limited Capacity Theorem 290</p> <p>13.3 The Coding Gain 296</p> <p><b>14 Ergodic and Markov Sources, Language Entropy 299</b></p> <p>14.1 General and Stationary Sources 300</p> <p>14.2 Ergodic Sources 302</p> <p>14.3 Markov Chains and Markov Sources 304</p> <p>14.4 Irreducible Markov Sources, Adjoint Source 308</p> <p>14.5 Cascades and the Data Processing Theorem 310</p> <p>14.6 The Redunda |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Description based on CIP data; resource not viewed |
| Subject |
Computer security.
|
|
Telecommunication systems -- Security measures
|
|
Cryptography.
|
|
Computer security.
|
|
Cryptography.
|
|
Telecommunication systems -- Security measures.
|
| Form |
Electronic book
|
| Author |
Forcinito, Mario, 1962- author.
|
|
McQuillan, James M., author
|
| ISBN |
9781119582403 |
|
1119582407 |
|
