رمزنگاری 101: از تئوری تا عمل

This exciting new resource provides a comprehensive overview of the field of cryptography and the current state of the art. It delivers an overview about cryptography as a field of study and the various unkeyed, secret key, and public key cryptosystems that are available, and it then delves more deeply into the technical details of the systems. It introduces, discusses, and puts into perspective the cryptographic technologies and techniques, mechanisms, and systems that are available today. Random generators and random functions are discussed, as well as one-way functions and cryptography hash functions. Pseudorandom generators and their functions are presented and described. Symmetric encryption is explored, and message authentical and authenticated encryption are introduced. Readers are given overview of discrete mathematics, probability theory and complexity theory. Key establishment is explained. Asymmetric encryption and digital signatures are also identified. Written by an expert in the field, this book provides ideas and concepts that are beneficial to novice as well as experienced practitioners. Artech House Computer Security Library Cryptography 101: From Theory to Practice 2 Contents 8 Foreword 18 Preface 20 References 25 Acknowledgments 28 Chapter 1 Introduction 30 1.1 CRYPTOLOGY 30 1.2 CRYPTOGRAPHIC SYSTEMS 33 1.2.1 Classes of Cryptographic Systems 37 1.2.2 Secure Cryptographic Systems 38 1.3 HISTORICAL BACKGROUND INFORMATION 48 1.4 OUTLINE OF THE BOOK 51 References 53 Chapter 2 Cryptographic Systems 56 2.1 UNKEYED CRYPTOSYSTEMS 56 2.1.1 Random Generators 56 2.1.2 Random Functions 57 2.1.3 One-Way Functions 59 2.1.4 Cryptographic Hash Functions 62 2.2 SECRET KEY CRYPTOSYSTEMS 64 2.2.1 Pseudorandom Generators 65 2.2.2 Pseudorandom Functions 66 2.2.3 Symmetric Encryption 67 2.2.4 Message Authentication 70 2.2.5 Authenticated Encryption 72 2.3 PUBLIC KEY CRYPTOSYSTEMS 73 2.3.1 Key Establishment 74 2.3.2 Asymmetric Encryption Systems 76 2.4 FINAL REMARKS 82 References 83 Part I UNKEYEDC RYPTOSYSTEMS 84 Chapter 3 Random Generators 86 3.1 INTRODUCTION 86 3.2 REALIZATIONS AND IMPLEMENTATIONS 88 3.2.1 Hardware-Based Random Generators 88 3.2.2 Software-Based Random Generators 89 3.2.3 Deskewing Techniques 91 3.3 STATISTICAL RANDOMNESS TESTING 92 References 94 Chapter 4 Random Functions 96 4.1 INTRODUCTION 96 4.2 IMPLEMENTATION 97 4.3 FINAL REMARKS 99 Chapter 5 One-Way Functions 100 5.1 INTRODUCTION 100 5.2 CANDIDATE ONE-WAY FUNCTIONS 104 5.2.1 Discrete Exponentiation Function 106 5.2.2 RSA Function 110 5.2.3 Modular Square Function 112 5.3 INTEGER FACTORIZATION ALGORITHMS 114 5.3.1 Special-Purpose Algorithms 115 5.3.2 General-Purpose Algorithms 121 5.3.3 State of the Art 123 5.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS 124 5.4.1 Generic Algorithms 125 5.4.2 Nongeneric (Special-Purpose) Algorithms 128 5.4.3 State of the Art 129 5.5 ELLIPTIC CURVE CRYPTOGRAPHY 130 5.6 FINAL REMARKS 137 References 138 Chapter 6 Cryptographic Hash Functions 142 6.1 INTRODUCTION 142 6.2 MERKLE-DAMGARD CONSTRUCTION 150 6.4 EXEMPLARY HASH FUNCTIONS 157 6.4.1 MD4 158 6.4.2 MD5 162 6.4.3 SHA-1 164 6.4.4 SHA-2 Family 168 6.4.5 KECCAK and the SHA-3 Family 177 6.5 FINAL REMARKS 192 Part II SECRET KEY CRYPTOSYSTEMS 196 Chapter 7 Pseudorandom Generators 198 7.1 INTRODUCTION 198 7.2 EXEMPLARY CONSTRUCTIONS 201 7.3 CRYPTOGRAPHICALLY SECURE PRGs 204 7.3.1 Blum-Micali PRG 208 7.3.2 RSA PRG 208 7.3.3 BBS PRG 209 7.4 FINAL REMARKS 210 References 212 Chapter 8 Pseudorandom Functions 214 8.1 INTRODUCTION 214 8.2 SECURITY OF A PRF 215 8.3 RELATIONSHIP BETWEEN PRGs AND PRFs 216 8.3.1 PRF-Based PRG 217 8.3.2 PRG-Based PRF 217 8.4 RANDOM ORACLE MODEL 218 8.5 FINAL REMARKS 220 References 220 Chapter 9 Symmetric Encryption 222 9.1 INTRODUCTION 222 9.1.1 Block and Stream Ciphers 225 9.1.2 Attacks 226 9.2 HISTORICAL PERSPECTIVE 228 9.3 PERFECTLY SECURE ENCRYPTION 231 9.3 PERFECTLY SECURE ENCRYPTION 231 9.4 COMPUTATIONALLY SECURE ENCRYPTION 239 9.5 STREAM CIPHERS 241 9.5.1 LFSR-Based Stream Ciphers 241 9.5.2 Other Stream Ciphers 245 9.6 BLOCK CIPHERS 257 9.6.1 DES 259 9.6.2 AES 279 9.7 MODES OF OPERATION 296 9.7.1 ECB 298 9.7.2 CBC 300 9.7.3 CFB 306 9.7.4 OFB 308 9.7.5 CTR 309 9.8 FINAL REMARKS 310 References 311 Chapter 10 Message Authentication 316 10.1 INTRODUCTION 316 10.2 INFORMATION-THEORETICALLY SECURE MESSAGE AUTHENTICATION 319 10.3 COMPUTATIONALLY SECURE MESSAGE AUTHENTICATION 322 10.3.1 MACs Using A Symmetric Encryption System 322 10.3.2 MACs Using Keyed Hash Functions 328 10.3.3 Carter-WegmanMACs 333 10.4 FINAL REMARKS 335 References 336 Chapter 11 Authenticated Encryption 340 11.1 INTRODUCTION 340 11.2 AEAD CONSTRUCTIONS 341 11.2.1 CCM 342 11.2.2 GCM 344 11.3 FINAL REMARKS 350 References 351 Part III PUBLIC KEY CRYPTOSYSTEMS 354 Chapter 12 Key Establishment 356 12.1 INTRODUCTION 356 12.2 KEY DISTRIBUTION 357 12.2.1 Merkle’s Puzzles 357 12.2.2 Shamir’s Three-Pass Protocol 359 12.2.3 Asymmetric Encryption-Based Key Distribution Protocol 362 12.3 KEY AGREEMENT 363 12.4 QUANTUM CRYPTOGRAPHY 368 12.4.1 Basic Principles 369 12.4.2 Quantum Key Exchange Protocol 370 12.4.3 Historical and Recent Developments 373 12.5 FINAL REMARKS 375 References 376 Chapter 13 Asymmetric Encryption 378 13.1 INTRODUCTION 378 13.2 PROBABILISTIC ENCRYPTION 382 13.2.1 Algorithms 383 13.2.2 Assessment 385 13.3 ASYMMETRIC ENCRYPTION SYSTEMS 386 13.3.1 RSA 386 13.3.2 Rabin 402 13.3.3 Elgamal 408 13.3.4 Cramer-Shoup 414 13.4 IDENTITY-BASED ENCRYPTION 416 13.5 FULLY HOMOMORPHIC ENCRYPTION 418 13.6 FINAL REMARKS 419 References 420 Chapter 14 Digital Signatures 424 14.1 INTRODUCTION 424 14.2 DIGITAL SIGNATURE SYSTEMS 429 14.2.1 RSA 429 14.2.2 PSS and PSS-R 435 14.2.3 Rabin 440 14.2.4 Elgamal 442 14.2.5 Schnorr 446 14.2.6 DSA 450 14.2.7 ECDSA 453 14.2.8 Cramer-Shoup 457 14.3 IDENTITY-BASED SIGNATURES 459 14.4 ONE-TIME SIGNATURES 460 14.5 VARIANTS 463 14.5.1 Blind Signatures 463 14.5.2 Undeniable Signatures 464 14.5.3 Fail-Stop Signatures 465 14.5.4 Group Signatures 465 14.6 FINAL REMARKS 465 References 466 Chapter 15 Zero-Knowledge Proofs of Knowledge 470 15.1 INTRODUCTION 470 15.2 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS 475 15.2.1 Fiat-Shamir 475 15.2.2 Guillou-Quisquater 478 15.2.3 Schnorr 480 15.3 NONINTERACTIVE ZERO-KNOWLEDGE 481 15.4 FINAL REMARKS 482 References 483 Part IV CONCLUSIONS 486 Chapter 16 Key Management 488 16.1 INTRODUCTION 488 16.1.1 Key Generation 489 16.1.2 Key Distribution 489 16.1.3 Key Storage 489 16.1.4 Key Destruction 490 16.2 SECRET SHARING 490 16.2.1 Shamir’s System 492 16.2.2 Blakley’s System 493 16.2.3 Verifiable Secret Sharing 493 16.2.4 Visual Cryptography 494 16.3 KEY RECOVERY 494 16.4 CERTIFICATE MANAGEMENT 496 16.4.1 Introduction 496 16.4.2 X.509 Certificates 500 16.4.3 OpenPGP Certificates 506 16.4.4 State of the Art 508 16.5 FINAL REMARKS 509 References 510 Chapter 17 Summary 512 17.1 UNKEYED CRYPTOSYSTEMS 512 17.2 SECRET KEY CRYPTOSYSTEMS 514 17.3 PUBLIC KEY CRYPTOSYSTEMS 516 17.4 FINAL REMARKS 517 Chapter 18 Outlook 520 18.1 THEORETICAL VIEWPOINT 521 18.2 PRACTICAL VIEWPOINT 522 18.3 PQC 524 18.3.1 Code-based Cryptosystems 526 18.3.2 Hash-based Cryptosystems 526 18.3.3 Lattice-based Cryptosystems 527 18.3.4 Isogeny-based Cryptosystems 528 18.3.5 Multivariate-based Cryptosystems 528 18.4 CLOSING REMARKS 529 References 531 Appendix A Discrete Mathematics 532 A.1 ALGEBRAIC BASICS 532 A.1.1 Preliminary Remarks 532 A.1.2 Algebraic Structures 536 A.1.3 Homomorphisms 546 A.1.4 Permutations 547 A.2 INTEGER ARITHMETIC 548 A.2.1 Integer Division 548 A.2.2 Common Divisors and Multiples 550 A.2.3 Euclidean Algorithms 551 A.2.4 Prime Numbers 555 A.2.5 Factorization 565 A.2.6 Euler’s Totient Function 566 A.3 MODULAR ARITHMETIC 568 A.3.1 Modular Congruence 568 A.3.2 Modular Exponentiation 570 A.3.3 Chinese Remainder Theorem 572 A.3.4 Fermat’s Little Theorem 574 A.3.5 Euler’s Theorem 575 A.3.6 Finite Fields Modulo Irreducible Polynomials 575 A.3.7 Quadratic Residuosity 577 A.3.8 Blum Integers 585 References 587 Appendix B Probability Theory 588 B.1 BASIC TERMS AND CONCEPTS 588 B.2 RANDOM VARIABLES 594 B.2.1 Probability Distributions 595 B.2.2 Marginal Distributions 598 B.2.3 Conditional Probability Distributions 599 B.2.4 Expectation 599 B.2.5 Independence of Random Variables 601 B.2.6 Markov’s Inequality 602 B.2.7 Variance and Standard Deviation 603 B.2.8 Chebyshev’s Inequality 605 References 606 Appendix C Information Theory 608 C.1 INTRODUCTION 608 C.2 ENTROPY 612 C.2.1 Joint Entropy 615 C.2.2 Conditional Entropy 616 C.2.3 Mutual Information 617 C.3 REDUNDANCY 618 C.4 KEY EQUIVOCATION AND UNICITY DISTANCE 620 References 621 Appendix D Complexity Theory 622 D.1 PRELIMINARY REMARKS 622 D.2 INTRODUCTION 624 D.3 ASYMPTOTIC ORDER NOTATION 626 D.4 EFFICIENT COMPUTATIONS 629 D.5 COMPUTATIONAL MODELS 631 D.6 COMPLEXITY CLASSES 635 D.6.1 Complexity Class P 636 D.6.2 Complexity Classes NP and coNP 636 D.6.3 Complexity Class PP and Its Subclasses 640 D.7 FINAL REMARKS 642 References 643 List of Symbols 646 Abbreviations and Acronyms 652 About the Author 660 Index 662 Cryptography;,Cryptography,theory;,Computer,security;,Artech,House;,978-1-63081-846-3 Cryptography,Cryptography theory,Computer security,Artech House,978-1-63081-846-3