Cryptography, information theory, and error-correction. (2021)

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