Cryptography 101 : : From Theory to Practice.
Saved in:
: | |
---|---|
Place / Publishing House: | Norwood : : Artech House,, 2021. Ã2021. |
Year of Publication: | 2021 |
Edition: | 1st ed. |
Language: | English |
Online Access: | |
Physical Description: | 1 online resource (679 pages) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
5006683919 |
---|---|
ctrlnum |
(MiAaPQ)5006683919 (Au-PeEL)EBL6683919 (OCoLC)1263025478 |
collection |
bib_alma |
record_format |
marc |
spelling |
Oppliger, Rolf. Cryptography 101 : From Theory to Practice. 1st ed. Norwood : Artech House, 2021. Ã2021. 1 online resource (679 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Intro -- Cryptography 101: From Theory to Practice -- Contents -- Foreword -- Preface -- References -- Acknowledgments -- Chapter 1 Introduction -- 1.1 CRYPTOLOGY -- 1.2 CRYPTOGRAPHIC SYSTEMS -- 1.2.1 Classes of Cryptographic Systems -- 1.2.2 Secure Cryptographic Systems -- 1.3 HISTORICAL BACKGROUND INFORMATION -- 1.4 OUTLINE OF THE BOOK -- References -- Chapter 2 Cryptographic Systems -- 2.1 UNKEYED CRYPTOSYSTEMS -- 2.1.1 Random Generators -- 2.1.2 Random Functions -- 2.1.3 One-Way Functions -- 2.1.4 Cryptographic Hash Functions -- 2.2 SECRET KEY CRYPTOSYSTEMS -- 2.2.1 Pseudorandom Generators -- 2.2.2 Pseudorandom Functions -- 2.2.3 Symmetric Encryption -- 2.2.4 Message Authentication -- 2.2.5 Authenticated Encryption -- 2.3 PUBLIC KEY CRYPTOSYSTEMS -- 2.3.1 Key Establishment -- 2.3.2 Asymmetric Encryption Systems -- 2.4 FINAL REMARKS -- References -- Part I UNKEYEDC RYPTOSYSTEMS -- Chapter 3 Random Generators -- 3.1 INTRODUCTION -- 3.2 REALIZATIONS AND IMPLEMENTATIONS -- 3.2.1 Hardware-Based Random Generators -- 3.2.2 Software-Based Random Generators -- 3.2.3 Deskewing Techniques -- 3.3 STATISTICAL RANDOMNESS TESTING -- References -- Chapter 4 Random Functions -- 4.1 INTRODUCTION -- 4.2 IMPLEMENTATION -- 4.3 FINAL REMARKS -- Chapter 5 One-Way Functions -- 5.1 INTRODUCTION -- 5.2 CANDIDATE ONE-WAY FUNCTIONS -- 5.2.1 Discrete Exponentiation Function -- 5.2.2 RSA Function -- 5.2.3 Modular Square Function -- 5.3 INTEGER FACTORIZATION ALGORITHMS -- 5.3.1 Special-Purpose Algorithms -- 5.3.2 General-Purpose Algorithms -- 5.3.3 State of the Art -- 5.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS -- 5.4.1 Generic Algorithms -- 5.4.2 Nongeneric (Special-Purpose) Algorithms -- 5.4.3 State of the Art -- 5.5 ELLIPTIC CURVE CRYPTOGRAPHY -- 5.6 FINAL REMARKS -- References -- Chapter 6 Cryptographic Hash Functions -- 6.1 INTRODUCTION. 6.2 MERKLE-DAMGARD CONSTRUCTION -- 6.4 EXEMPLARY HASH FUNCTIONS -- 6.4.1 MD4 -- 6.4.2 MD5 -- 6.4.3 SHA-1 -- 6.4.4 SHA-2 Family -- 6.4.5 KECCAK and the SHA-3 Family -- 6.5 FINAL REMARKS -- Part II SECRET KEY CRYPTOSYSTEMS -- Chapter 7 Pseudorandom Generators -- 7.1 INTRODUCTION -- 7.2 EXEMPLARY CONSTRUCTIONS -- 7.3 CRYPTOGRAPHICALLY SECURE PRGs -- 7.3.1 Blum-Micali PRG -- 7.3.2 RSA PRG -- 7.3.3 BBS PRG -- 7.4 FINAL REMARKS -- References -- Chapter 8 Pseudorandom Functions -- 8.1 INTRODUCTION -- 8.2 SECURITY OF A PRF -- 8.3 RELATIONSHIP BETWEEN PRGs AND PRFs -- 8.3.1 PRF-Based PRG -- 8.3.2 PRG-Based PRF -- 8.4 RANDOM ORACLE MODEL -- 8.5 FINAL REMARKS -- References -- Chapter 9 Symmetric Encryption -- 9.1 INTRODUCTION -- 9.1.1 Block and Stream Ciphers -- 9.1.2 Attacks -- 9.2 HISTORICAL PERSPECTIVE -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.4 COMPUTATIONALLY SECURE ENCRYPTION -- 9.5 STREAM CIPHERS -- 9.5.1 LFSR-Based Stream Ciphers -- 9.5.2 Other Stream Ciphers -- 9.6 BLOCK CIPHERS -- 9.6.1 DES -- 9.6.2 AES -- 9.7 MODES OF OPERATION -- 9.7.1 ECB -- 9.7.2 CBC -- 9.7.3 CFB -- 9.7.4 OFB -- 9.7.5 CTR -- 9.8 FINAL REMARKS -- References -- Chapter 10 Message Authentication -- 10.1 INTRODUCTION -- 10.2 INFORMATION-THEORETICALLY SECURE MESSAGE AUTHENTICATION -- 10.3 COMPUTATIONALLY SECURE MESSAGE AUTHENTICATION -- 10.3.1 MACs Using A Symmetric Encryption System -- 10.3.2 MACs Using Keyed Hash Functions -- 10.3.3 Carter-WegmanMACs -- 10.4 FINAL REMARKS -- References -- Chapter 11 Authenticated Encryption -- 11.1 INTRODUCTION -- 11.2 AEAD CONSTRUCTIONS -- 11.2.1 CCM -- 11.2.2 GCM -- 11.3 FINAL REMARKS -- References -- Part III PUBLIC KEY CRYPTOSYSTEMS -- Chapter 12 Key Establishment -- 12.1 INTRODUCTION -- 12.2 KEY DISTRIBUTION -- 12.2.1 Merkle's Puzzles -- 12.2.2 Shamir's Three-Pass Protocol. 12.2.3 Asymmetric Encryption-Based Key Distribution Protocol -- 12.3 KEY AGREEMENT -- 12.4 QUANTUM CRYPTOGRAPHY -- 12.4.1 Basic Principles -- 12.4.2 Quantum Key Exchange Protocol -- 12.4.3 Historical and Recent Developments -- 12.5 FINAL REMARKS -- References -- Chapter 13 Asymmetric Encryption -- 13.1 INTRODUCTION -- 13.2 PROBABILISTIC ENCRYPTION -- 13.2.1 Algorithms -- 13.2.2 Assessment -- 13.3 ASYMMETRIC ENCRYPTION SYSTEMS -- 13.3.1 RSA -- 13.3.2 Rabin -- 13.3.3 Elgamal -- 13.3.4 Cramer-Shoup -- 13.4 IDENTITY-BASED ENCRYPTION -- 13.5 FULLY HOMOMORPHIC ENCRYPTION -- 13.6 FINAL REMARKS -- References -- Chapter 14 Digital Signatures -- 14.1 INTRODUCTION -- 14.2 DIGITAL SIGNATURE SYSTEMS -- 14.2.1 RSA -- 14.2.2 PSS and PSS-R -- 14.2.3 Rabin -- 14.2.4 Elgamal -- 14.2.5 Schnorr -- 14.2.6 DSA -- 14.2.7 ECDSA -- 14.2.8 Cramer-Shoup -- 14.3 IDENTITY-BASED SIGNATURES -- 14.4 ONE-TIME SIGNATURES -- 14.5 VARIANTS -- 14.5.1 Blind Signatures -- 14.5.2 Undeniable Signatures -- 14.5.3 Fail-Stop Signatures -- 14.5.4 Group Signatures -- 14.6 FINAL REMARKS -- References -- Chapter 15 Zero-Knowledge Proofs of Knowledge -- 15.1 INTRODUCTION -- 15.2 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS -- 15.2.1 Fiat-Shamir -- 15.2.2 Guillou-Quisquater -- 15.2.3 Schnorr -- 15.3 NONINTERACTIVE ZERO-KNOWLEDGE -- 15.4 FINAL REMARKS -- References -- Part IV CONCLUSIONS -- Chapter 16 Key Management -- 16.1 INTRODUCTION -- 16.1.1 Key Generation -- 16.1.2 Key Distribution -- 16.1.3 Key Storage -- 16.1.4 Key Destruction -- 16.2 SECRET SHARING -- 16.2.1 Shamir's System -- 16.2.2 Blakley's System -- 16.2.3 Verifiable Secret Sharing -- 16.2.4 Visual Cryptography -- 16.3 KEY RECOVERY -- 16.4 CERTIFICATE MANAGEMENT -- 16.4.1 Introduction -- 16.4.2 X.509 Certificates -- 16.4.3 OpenPGP Certificates -- 16.4.4 State of the Art -- 16.5 FINAL REMARKS -- References -- Chapter 17 Summary. 17.1 UNKEYED CRYPTOSYSTEMS -- 17.2 SECRET KEY CRYPTOSYSTEMS -- 17.3 PUBLIC KEY CRYPTOSYSTEMS -- 17.4 FINAL REMARKS -- Chapter 18 Outlook -- 18.1 THEORETICAL VIEWPOINT -- 18.2 PRACTICAL VIEWPOINT -- 18.3 PQC -- 18.3.1 Code-based Cryptosystems -- 18.3.2 Hash-based Cryptosystems -- 18.3.3 Lattice-based Cryptosystems -- 18.3.4 Isogeny-based Cryptosystems -- 18.3.5 Multivariate-based Cryptosystems -- 18.4 CLOSING REMARKS -- References -- Appendix A Discrete Mathematics -- A.1 ALGEBRAIC BASICS -- A.1.1 Preliminary Remarks -- A.1.2 Algebraic Structures -- A.1.3 Homomorphisms -- A.1.4 Permutations -- A.2 INTEGER ARITHMETIC -- A.2.1 Integer Division -- A.2.2 Common Divisors and Multiples -- A.2.3 Euclidean Algorithms -- A.2.4 Prime Numbers -- A.2.5 Factorization -- A.2.6 Euler's Totient Function -- A.3 MODULAR ARITHMETIC -- A.3.1 Modular Congruence -- A.3.2 Modular Exponentiation -- A.3.3 Chinese Remainder Theorem -- A.3.4 Fermat's Little Theorem -- A.3.5 Euler's Theorem -- A.3.6 Finite Fields Modulo Irreducible Polynomials -- A.3.7 Quadratic Residuosity -- A.3.8 Blum Integers -- References -- Appendix B Probability Theory -- B.1 BASIC TERMS AND CONCEPTS -- B.2 RANDOM VARIABLES -- B.2.1 Probability Distributions -- B.2.2 Marginal Distributions -- B.2.3 Conditional Probability Distributions -- B.2.4 Expectation -- B.2.5 Independence of Random Variables -- B.2.6 Markov's Inequality -- B.2.7 Variance and Standard Deviation -- B.2.8 Chebyshev's Inequality -- References -- Appendix C Information Theory -- C.1 INTRODUCTION -- C.2 ENTROPY -- C.2.1 Joint Entropy -- C.2.2 Conditional Entropy -- C.2.3 Mutual Information -- C.3 REDUNDANCY -- C.4 KEY EQUIVOCATION AND UNICITY DISTANCE -- References -- Appendix D Complexity Theory -- D.1 PRELIMINARY REMARKS -- D.2 INTRODUCTION -- D.3 ASYMPTOTIC ORDER NOTATION -- D.4 EFFICIENT COMPUTATIONS -- D.5 COMPUTATIONAL MODELS. D.6 COMPLEXITY CLASSES -- D.6.1 Complexity Class P -- D.6.2 Complexity Classes NP and coNP -- D.6.3 Complexity Class PP and Its Subclasses -- D.7 FINAL REMARKS -- References -- List of Symbols -- Abbreviations and Acronyms -- About the Author -- Index. Description based on publisher supplied metadata and other sources. Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. Data encryption (Computer science). Cryptography. Electronic books. Print version: Oppliger, Rolf Cryptography 101 Norwood : Artech House,c2021 9781630818463 ProQuest (Firm) https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6683919 Click to View |
language |
English |
format |
eBook |
author |
Oppliger, Rolf. |
spellingShingle |
Oppliger, Rolf. Cryptography 101 : From Theory to Practice. Intro -- Cryptography 101: From Theory to Practice -- Contents -- Foreword -- Preface -- References -- Acknowledgments -- Chapter 1 Introduction -- 1.1 CRYPTOLOGY -- 1.2 CRYPTOGRAPHIC SYSTEMS -- 1.2.1 Classes of Cryptographic Systems -- 1.2.2 Secure Cryptographic Systems -- 1.3 HISTORICAL BACKGROUND INFORMATION -- 1.4 OUTLINE OF THE BOOK -- References -- Chapter 2 Cryptographic Systems -- 2.1 UNKEYED CRYPTOSYSTEMS -- 2.1.1 Random Generators -- 2.1.2 Random Functions -- 2.1.3 One-Way Functions -- 2.1.4 Cryptographic Hash Functions -- 2.2 SECRET KEY CRYPTOSYSTEMS -- 2.2.1 Pseudorandom Generators -- 2.2.2 Pseudorandom Functions -- 2.2.3 Symmetric Encryption -- 2.2.4 Message Authentication -- 2.2.5 Authenticated Encryption -- 2.3 PUBLIC KEY CRYPTOSYSTEMS -- 2.3.1 Key Establishment -- 2.3.2 Asymmetric Encryption Systems -- 2.4 FINAL REMARKS -- References -- Part I UNKEYEDC RYPTOSYSTEMS -- Chapter 3 Random Generators -- 3.1 INTRODUCTION -- 3.2 REALIZATIONS AND IMPLEMENTATIONS -- 3.2.1 Hardware-Based Random Generators -- 3.2.2 Software-Based Random Generators -- 3.2.3 Deskewing Techniques -- 3.3 STATISTICAL RANDOMNESS TESTING -- References -- Chapter 4 Random Functions -- 4.1 INTRODUCTION -- 4.2 IMPLEMENTATION -- 4.3 FINAL REMARKS -- Chapter 5 One-Way Functions -- 5.1 INTRODUCTION -- 5.2 CANDIDATE ONE-WAY FUNCTIONS -- 5.2.1 Discrete Exponentiation Function -- 5.2.2 RSA Function -- 5.2.3 Modular Square Function -- 5.3 INTEGER FACTORIZATION ALGORITHMS -- 5.3.1 Special-Purpose Algorithms -- 5.3.2 General-Purpose Algorithms -- 5.3.3 State of the Art -- 5.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS -- 5.4.1 Generic Algorithms -- 5.4.2 Nongeneric (Special-Purpose) Algorithms -- 5.4.3 State of the Art -- 5.5 ELLIPTIC CURVE CRYPTOGRAPHY -- 5.6 FINAL REMARKS -- References -- Chapter 6 Cryptographic Hash Functions -- 6.1 INTRODUCTION. 6.2 MERKLE-DAMGARD CONSTRUCTION -- 6.4 EXEMPLARY HASH FUNCTIONS -- 6.4.1 MD4 -- 6.4.2 MD5 -- 6.4.3 SHA-1 -- 6.4.4 SHA-2 Family -- 6.4.5 KECCAK and the SHA-3 Family -- 6.5 FINAL REMARKS -- Part II SECRET KEY CRYPTOSYSTEMS -- Chapter 7 Pseudorandom Generators -- 7.1 INTRODUCTION -- 7.2 EXEMPLARY CONSTRUCTIONS -- 7.3 CRYPTOGRAPHICALLY SECURE PRGs -- 7.3.1 Blum-Micali PRG -- 7.3.2 RSA PRG -- 7.3.3 BBS PRG -- 7.4 FINAL REMARKS -- References -- Chapter 8 Pseudorandom Functions -- 8.1 INTRODUCTION -- 8.2 SECURITY OF A PRF -- 8.3 RELATIONSHIP BETWEEN PRGs AND PRFs -- 8.3.1 PRF-Based PRG -- 8.3.2 PRG-Based PRF -- 8.4 RANDOM ORACLE MODEL -- 8.5 FINAL REMARKS -- References -- Chapter 9 Symmetric Encryption -- 9.1 INTRODUCTION -- 9.1.1 Block and Stream Ciphers -- 9.1.2 Attacks -- 9.2 HISTORICAL PERSPECTIVE -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.4 COMPUTATIONALLY SECURE ENCRYPTION -- 9.5 STREAM CIPHERS -- 9.5.1 LFSR-Based Stream Ciphers -- 9.5.2 Other Stream Ciphers -- 9.6 BLOCK CIPHERS -- 9.6.1 DES -- 9.6.2 AES -- 9.7 MODES OF OPERATION -- 9.7.1 ECB -- 9.7.2 CBC -- 9.7.3 CFB -- 9.7.4 OFB -- 9.7.5 CTR -- 9.8 FINAL REMARKS -- References -- Chapter 10 Message Authentication -- 10.1 INTRODUCTION -- 10.2 INFORMATION-THEORETICALLY SECURE MESSAGE AUTHENTICATION -- 10.3 COMPUTATIONALLY SECURE MESSAGE AUTHENTICATION -- 10.3.1 MACs Using A Symmetric Encryption System -- 10.3.2 MACs Using Keyed Hash Functions -- 10.3.3 Carter-WegmanMACs -- 10.4 FINAL REMARKS -- References -- Chapter 11 Authenticated Encryption -- 11.1 INTRODUCTION -- 11.2 AEAD CONSTRUCTIONS -- 11.2.1 CCM -- 11.2.2 GCM -- 11.3 FINAL REMARKS -- References -- Part III PUBLIC KEY CRYPTOSYSTEMS -- Chapter 12 Key Establishment -- 12.1 INTRODUCTION -- 12.2 KEY DISTRIBUTION -- 12.2.1 Merkle's Puzzles -- 12.2.2 Shamir's Three-Pass Protocol. 12.2.3 Asymmetric Encryption-Based Key Distribution Protocol -- 12.3 KEY AGREEMENT -- 12.4 QUANTUM CRYPTOGRAPHY -- 12.4.1 Basic Principles -- 12.4.2 Quantum Key Exchange Protocol -- 12.4.3 Historical and Recent Developments -- 12.5 FINAL REMARKS -- References -- Chapter 13 Asymmetric Encryption -- 13.1 INTRODUCTION -- 13.2 PROBABILISTIC ENCRYPTION -- 13.2.1 Algorithms -- 13.2.2 Assessment -- 13.3 ASYMMETRIC ENCRYPTION SYSTEMS -- 13.3.1 RSA -- 13.3.2 Rabin -- 13.3.3 Elgamal -- 13.3.4 Cramer-Shoup -- 13.4 IDENTITY-BASED ENCRYPTION -- 13.5 FULLY HOMOMORPHIC ENCRYPTION -- 13.6 FINAL REMARKS -- References -- Chapter 14 Digital Signatures -- 14.1 INTRODUCTION -- 14.2 DIGITAL SIGNATURE SYSTEMS -- 14.2.1 RSA -- 14.2.2 PSS and PSS-R -- 14.2.3 Rabin -- 14.2.4 Elgamal -- 14.2.5 Schnorr -- 14.2.6 DSA -- 14.2.7 ECDSA -- 14.2.8 Cramer-Shoup -- 14.3 IDENTITY-BASED SIGNATURES -- 14.4 ONE-TIME SIGNATURES -- 14.5 VARIANTS -- 14.5.1 Blind Signatures -- 14.5.2 Undeniable Signatures -- 14.5.3 Fail-Stop Signatures -- 14.5.4 Group Signatures -- 14.6 FINAL REMARKS -- References -- Chapter 15 Zero-Knowledge Proofs of Knowledge -- 15.1 INTRODUCTION -- 15.2 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS -- 15.2.1 Fiat-Shamir -- 15.2.2 Guillou-Quisquater -- 15.2.3 Schnorr -- 15.3 NONINTERACTIVE ZERO-KNOWLEDGE -- 15.4 FINAL REMARKS -- References -- Part IV CONCLUSIONS -- Chapter 16 Key Management -- 16.1 INTRODUCTION -- 16.1.1 Key Generation -- 16.1.2 Key Distribution -- 16.1.3 Key Storage -- 16.1.4 Key Destruction -- 16.2 SECRET SHARING -- 16.2.1 Shamir's System -- 16.2.2 Blakley's System -- 16.2.3 Verifiable Secret Sharing -- 16.2.4 Visual Cryptography -- 16.3 KEY RECOVERY -- 16.4 CERTIFICATE MANAGEMENT -- 16.4.1 Introduction -- 16.4.2 X.509 Certificates -- 16.4.3 OpenPGP Certificates -- 16.4.4 State of the Art -- 16.5 FINAL REMARKS -- References -- Chapter 17 Summary. 17.1 UNKEYED CRYPTOSYSTEMS -- 17.2 SECRET KEY CRYPTOSYSTEMS -- 17.3 PUBLIC KEY CRYPTOSYSTEMS -- 17.4 FINAL REMARKS -- Chapter 18 Outlook -- 18.1 THEORETICAL VIEWPOINT -- 18.2 PRACTICAL VIEWPOINT -- 18.3 PQC -- 18.3.1 Code-based Cryptosystems -- 18.3.2 Hash-based Cryptosystems -- 18.3.3 Lattice-based Cryptosystems -- 18.3.4 Isogeny-based Cryptosystems -- 18.3.5 Multivariate-based Cryptosystems -- 18.4 CLOSING REMARKS -- References -- Appendix A Discrete Mathematics -- A.1 ALGEBRAIC BASICS -- A.1.1 Preliminary Remarks -- A.1.2 Algebraic Structures -- A.1.3 Homomorphisms -- A.1.4 Permutations -- A.2 INTEGER ARITHMETIC -- A.2.1 Integer Division -- A.2.2 Common Divisors and Multiples -- A.2.3 Euclidean Algorithms -- A.2.4 Prime Numbers -- A.2.5 Factorization -- A.2.6 Euler's Totient Function -- A.3 MODULAR ARITHMETIC -- A.3.1 Modular Congruence -- A.3.2 Modular Exponentiation -- A.3.3 Chinese Remainder Theorem -- A.3.4 Fermat's Little Theorem -- A.3.5 Euler's Theorem -- A.3.6 Finite Fields Modulo Irreducible Polynomials -- A.3.7 Quadratic Residuosity -- A.3.8 Blum Integers -- References -- Appendix B Probability Theory -- B.1 BASIC TERMS AND CONCEPTS -- B.2 RANDOM VARIABLES -- B.2.1 Probability Distributions -- B.2.2 Marginal Distributions -- B.2.3 Conditional Probability Distributions -- B.2.4 Expectation -- B.2.5 Independence of Random Variables -- B.2.6 Markov's Inequality -- B.2.7 Variance and Standard Deviation -- B.2.8 Chebyshev's Inequality -- References -- Appendix C Information Theory -- C.1 INTRODUCTION -- C.2 ENTROPY -- C.2.1 Joint Entropy -- C.2.2 Conditional Entropy -- C.2.3 Mutual Information -- C.3 REDUNDANCY -- C.4 KEY EQUIVOCATION AND UNICITY DISTANCE -- References -- Appendix D Complexity Theory -- D.1 PRELIMINARY REMARKS -- D.2 INTRODUCTION -- D.3 ASYMPTOTIC ORDER NOTATION -- D.4 EFFICIENT COMPUTATIONS -- D.5 COMPUTATIONAL MODELS. D.6 COMPLEXITY CLASSES -- D.6.1 Complexity Class P -- D.6.2 Complexity Classes NP and coNP -- D.6.3 Complexity Class PP and Its Subclasses -- D.7 FINAL REMARKS -- References -- List of Symbols -- Abbreviations and Acronyms -- About the Author -- Index. |
author_facet |
Oppliger, Rolf. |
author_variant |
r o ro |
author_sort |
Oppliger, Rolf. |
title |
Cryptography 101 : From Theory to Practice. |
title_sub |
From Theory to Practice. |
title_full |
Cryptography 101 : From Theory to Practice. |
title_fullStr |
Cryptography 101 : From Theory to Practice. |
title_full_unstemmed |
Cryptography 101 : From Theory to Practice. |
title_auth |
Cryptography 101 : From Theory to Practice. |
title_new |
Cryptography 101 : |
title_sort |
cryptography 101 : from theory to practice. |
publisher |
Artech House, |
publishDate |
2021 |
physical |
1 online resource (679 pages) |
edition |
1st ed. |
contents |
Intro -- Cryptography 101: From Theory to Practice -- Contents -- Foreword -- Preface -- References -- Acknowledgments -- Chapter 1 Introduction -- 1.1 CRYPTOLOGY -- 1.2 CRYPTOGRAPHIC SYSTEMS -- 1.2.1 Classes of Cryptographic Systems -- 1.2.2 Secure Cryptographic Systems -- 1.3 HISTORICAL BACKGROUND INFORMATION -- 1.4 OUTLINE OF THE BOOK -- References -- Chapter 2 Cryptographic Systems -- 2.1 UNKEYED CRYPTOSYSTEMS -- 2.1.1 Random Generators -- 2.1.2 Random Functions -- 2.1.3 One-Way Functions -- 2.1.4 Cryptographic Hash Functions -- 2.2 SECRET KEY CRYPTOSYSTEMS -- 2.2.1 Pseudorandom Generators -- 2.2.2 Pseudorandom Functions -- 2.2.3 Symmetric Encryption -- 2.2.4 Message Authentication -- 2.2.5 Authenticated Encryption -- 2.3 PUBLIC KEY CRYPTOSYSTEMS -- 2.3.1 Key Establishment -- 2.3.2 Asymmetric Encryption Systems -- 2.4 FINAL REMARKS -- References -- Part I UNKEYEDC RYPTOSYSTEMS -- Chapter 3 Random Generators -- 3.1 INTRODUCTION -- 3.2 REALIZATIONS AND IMPLEMENTATIONS -- 3.2.1 Hardware-Based Random Generators -- 3.2.2 Software-Based Random Generators -- 3.2.3 Deskewing Techniques -- 3.3 STATISTICAL RANDOMNESS TESTING -- References -- Chapter 4 Random Functions -- 4.1 INTRODUCTION -- 4.2 IMPLEMENTATION -- 4.3 FINAL REMARKS -- Chapter 5 One-Way Functions -- 5.1 INTRODUCTION -- 5.2 CANDIDATE ONE-WAY FUNCTIONS -- 5.2.1 Discrete Exponentiation Function -- 5.2.2 RSA Function -- 5.2.3 Modular Square Function -- 5.3 INTEGER FACTORIZATION ALGORITHMS -- 5.3.1 Special-Purpose Algorithms -- 5.3.2 General-Purpose Algorithms -- 5.3.3 State of the Art -- 5.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS -- 5.4.1 Generic Algorithms -- 5.4.2 Nongeneric (Special-Purpose) Algorithms -- 5.4.3 State of the Art -- 5.5 ELLIPTIC CURVE CRYPTOGRAPHY -- 5.6 FINAL REMARKS -- References -- Chapter 6 Cryptographic Hash Functions -- 6.1 INTRODUCTION. 6.2 MERKLE-DAMGARD CONSTRUCTION -- 6.4 EXEMPLARY HASH FUNCTIONS -- 6.4.1 MD4 -- 6.4.2 MD5 -- 6.4.3 SHA-1 -- 6.4.4 SHA-2 Family -- 6.4.5 KECCAK and the SHA-3 Family -- 6.5 FINAL REMARKS -- Part II SECRET KEY CRYPTOSYSTEMS -- Chapter 7 Pseudorandom Generators -- 7.1 INTRODUCTION -- 7.2 EXEMPLARY CONSTRUCTIONS -- 7.3 CRYPTOGRAPHICALLY SECURE PRGs -- 7.3.1 Blum-Micali PRG -- 7.3.2 RSA PRG -- 7.3.3 BBS PRG -- 7.4 FINAL REMARKS -- References -- Chapter 8 Pseudorandom Functions -- 8.1 INTRODUCTION -- 8.2 SECURITY OF A PRF -- 8.3 RELATIONSHIP BETWEEN PRGs AND PRFs -- 8.3.1 PRF-Based PRG -- 8.3.2 PRG-Based PRF -- 8.4 RANDOM ORACLE MODEL -- 8.5 FINAL REMARKS -- References -- Chapter 9 Symmetric Encryption -- 9.1 INTRODUCTION -- 9.1.1 Block and Stream Ciphers -- 9.1.2 Attacks -- 9.2 HISTORICAL PERSPECTIVE -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.4 COMPUTATIONALLY SECURE ENCRYPTION -- 9.5 STREAM CIPHERS -- 9.5.1 LFSR-Based Stream Ciphers -- 9.5.2 Other Stream Ciphers -- 9.6 BLOCK CIPHERS -- 9.6.1 DES -- 9.6.2 AES -- 9.7 MODES OF OPERATION -- 9.7.1 ECB -- 9.7.2 CBC -- 9.7.3 CFB -- 9.7.4 OFB -- 9.7.5 CTR -- 9.8 FINAL REMARKS -- References -- Chapter 10 Message Authentication -- 10.1 INTRODUCTION -- 10.2 INFORMATION-THEORETICALLY SECURE MESSAGE AUTHENTICATION -- 10.3 COMPUTATIONALLY SECURE MESSAGE AUTHENTICATION -- 10.3.1 MACs Using A Symmetric Encryption System -- 10.3.2 MACs Using Keyed Hash Functions -- 10.3.3 Carter-WegmanMACs -- 10.4 FINAL REMARKS -- References -- Chapter 11 Authenticated Encryption -- 11.1 INTRODUCTION -- 11.2 AEAD CONSTRUCTIONS -- 11.2.1 CCM -- 11.2.2 GCM -- 11.3 FINAL REMARKS -- References -- Part III PUBLIC KEY CRYPTOSYSTEMS -- Chapter 12 Key Establishment -- 12.1 INTRODUCTION -- 12.2 KEY DISTRIBUTION -- 12.2.1 Merkle's Puzzles -- 12.2.2 Shamir's Three-Pass Protocol. 12.2.3 Asymmetric Encryption-Based Key Distribution Protocol -- 12.3 KEY AGREEMENT -- 12.4 QUANTUM CRYPTOGRAPHY -- 12.4.1 Basic Principles -- 12.4.2 Quantum Key Exchange Protocol -- 12.4.3 Historical and Recent Developments -- 12.5 FINAL REMARKS -- References -- Chapter 13 Asymmetric Encryption -- 13.1 INTRODUCTION -- 13.2 PROBABILISTIC ENCRYPTION -- 13.2.1 Algorithms -- 13.2.2 Assessment -- 13.3 ASYMMETRIC ENCRYPTION SYSTEMS -- 13.3.1 RSA -- 13.3.2 Rabin -- 13.3.3 Elgamal -- 13.3.4 Cramer-Shoup -- 13.4 IDENTITY-BASED ENCRYPTION -- 13.5 FULLY HOMOMORPHIC ENCRYPTION -- 13.6 FINAL REMARKS -- References -- Chapter 14 Digital Signatures -- 14.1 INTRODUCTION -- 14.2 DIGITAL SIGNATURE SYSTEMS -- 14.2.1 RSA -- 14.2.2 PSS and PSS-R -- 14.2.3 Rabin -- 14.2.4 Elgamal -- 14.2.5 Schnorr -- 14.2.6 DSA -- 14.2.7 ECDSA -- 14.2.8 Cramer-Shoup -- 14.3 IDENTITY-BASED SIGNATURES -- 14.4 ONE-TIME SIGNATURES -- 14.5 VARIANTS -- 14.5.1 Blind Signatures -- 14.5.2 Undeniable Signatures -- 14.5.3 Fail-Stop Signatures -- 14.5.4 Group Signatures -- 14.6 FINAL REMARKS -- References -- Chapter 15 Zero-Knowledge Proofs of Knowledge -- 15.1 INTRODUCTION -- 15.2 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS -- 15.2.1 Fiat-Shamir -- 15.2.2 Guillou-Quisquater -- 15.2.3 Schnorr -- 15.3 NONINTERACTIVE ZERO-KNOWLEDGE -- 15.4 FINAL REMARKS -- References -- Part IV CONCLUSIONS -- Chapter 16 Key Management -- 16.1 INTRODUCTION -- 16.1.1 Key Generation -- 16.1.2 Key Distribution -- 16.1.3 Key Storage -- 16.1.4 Key Destruction -- 16.2 SECRET SHARING -- 16.2.1 Shamir's System -- 16.2.2 Blakley's System -- 16.2.3 Verifiable Secret Sharing -- 16.2.4 Visual Cryptography -- 16.3 KEY RECOVERY -- 16.4 CERTIFICATE MANAGEMENT -- 16.4.1 Introduction -- 16.4.2 X.509 Certificates -- 16.4.3 OpenPGP Certificates -- 16.4.4 State of the Art -- 16.5 FINAL REMARKS -- References -- Chapter 17 Summary. 17.1 UNKEYED CRYPTOSYSTEMS -- 17.2 SECRET KEY CRYPTOSYSTEMS -- 17.3 PUBLIC KEY CRYPTOSYSTEMS -- 17.4 FINAL REMARKS -- Chapter 18 Outlook -- 18.1 THEORETICAL VIEWPOINT -- 18.2 PRACTICAL VIEWPOINT -- 18.3 PQC -- 18.3.1 Code-based Cryptosystems -- 18.3.2 Hash-based Cryptosystems -- 18.3.3 Lattice-based Cryptosystems -- 18.3.4 Isogeny-based Cryptosystems -- 18.3.5 Multivariate-based Cryptosystems -- 18.4 CLOSING REMARKS -- References -- Appendix A Discrete Mathematics -- A.1 ALGEBRAIC BASICS -- A.1.1 Preliminary Remarks -- A.1.2 Algebraic Structures -- A.1.3 Homomorphisms -- A.1.4 Permutations -- A.2 INTEGER ARITHMETIC -- A.2.1 Integer Division -- A.2.2 Common Divisors and Multiples -- A.2.3 Euclidean Algorithms -- A.2.4 Prime Numbers -- A.2.5 Factorization -- A.2.6 Euler's Totient Function -- A.3 MODULAR ARITHMETIC -- A.3.1 Modular Congruence -- A.3.2 Modular Exponentiation -- A.3.3 Chinese Remainder Theorem -- A.3.4 Fermat's Little Theorem -- A.3.5 Euler's Theorem -- A.3.6 Finite Fields Modulo Irreducible Polynomials -- A.3.7 Quadratic Residuosity -- A.3.8 Blum Integers -- References -- Appendix B Probability Theory -- B.1 BASIC TERMS AND CONCEPTS -- B.2 RANDOM VARIABLES -- B.2.1 Probability Distributions -- B.2.2 Marginal Distributions -- B.2.3 Conditional Probability Distributions -- B.2.4 Expectation -- B.2.5 Independence of Random Variables -- B.2.6 Markov's Inequality -- B.2.7 Variance and Standard Deviation -- B.2.8 Chebyshev's Inequality -- References -- Appendix C Information Theory -- C.1 INTRODUCTION -- C.2 ENTROPY -- C.2.1 Joint Entropy -- C.2.2 Conditional Entropy -- C.2.3 Mutual Information -- C.3 REDUNDANCY -- C.4 KEY EQUIVOCATION AND UNICITY DISTANCE -- References -- Appendix D Complexity Theory -- D.1 PRELIMINARY REMARKS -- D.2 INTRODUCTION -- D.3 ASYMPTOTIC ORDER NOTATION -- D.4 EFFICIENT COMPUTATIONS -- D.5 COMPUTATIONAL MODELS. D.6 COMPLEXITY CLASSES -- D.6.1 Complexity Class P -- D.6.2 Complexity Classes NP and coNP -- D.6.3 Complexity Class PP and Its Subclasses -- D.7 FINAL REMARKS -- References -- List of Symbols -- Abbreviations and Acronyms -- About the Author -- Index. |
isbn |
9781630818470 9781630818463 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA76 |
callnumber-sort |
QA 276.9 A25 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6683919 |
illustrated |
Not Illustrated |
dewey-hundreds |
000 - Computer science, information & general works |
dewey-tens |
000 - Computer science, knowledge & systems |
dewey-ones |
005 - Computer programming, programs & data |
dewey-full |
005.824 |
dewey-sort |
15.824 |
dewey-raw |
005.824 |
dewey-search |
005.824 |
oclc_num |
1263025478 |
work_keys_str_mv |
AT oppligerrolf cryptography101fromtheorytopractice |
status_str |
n |
ids_txt_mv |
(MiAaPQ)5006683919 (Au-PeEL)EBL6683919 (OCoLC)1263025478 |
carrierType_str_mv |
cr |
is_hierarchy_title |
Cryptography 101 : From Theory to Practice. |
marc_error |
Info : Unimarc and ISO-8859-1 translations identical, choosing ISO-8859-1. --- [ 856 : z ] |
_version_ |
1792331060086833153 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09268nam a22004573i 4500</leader><controlfield tag="001">5006683919</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20240229073842.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">240229s2021 xx o ||||0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781630818470</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781630818463</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5006683919</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL6683919</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1263025478</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A25</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.824</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Oppliger, Rolf.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cryptography 101 :</subfield><subfield code="b">From Theory to Practice.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Norwood :</subfield><subfield code="b">Artech House,</subfield><subfield code="c">2021.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">Ã2021.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (679 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Intro -- Cryptography 101: From Theory to Practice -- Contents -- Foreword -- Preface -- References -- Acknowledgments -- Chapter 1 Introduction -- 1.1 CRYPTOLOGY -- 1.2 CRYPTOGRAPHIC SYSTEMS -- 1.2.1 Classes of Cryptographic Systems -- 1.2.2 Secure Cryptographic Systems -- 1.3 HISTORICAL BACKGROUND INFORMATION -- 1.4 OUTLINE OF THE BOOK -- References -- Chapter 2 Cryptographic Systems -- 2.1 UNKEYED CRYPTOSYSTEMS -- 2.1.1 Random Generators -- 2.1.2 Random Functions -- 2.1.3 One-Way Functions -- 2.1.4 Cryptographic Hash Functions -- 2.2 SECRET KEY CRYPTOSYSTEMS -- 2.2.1 Pseudorandom Generators -- 2.2.2 Pseudorandom Functions -- 2.2.3 Symmetric Encryption -- 2.2.4 Message Authentication -- 2.2.5 Authenticated Encryption -- 2.3 PUBLIC KEY CRYPTOSYSTEMS -- 2.3.1 Key Establishment -- 2.3.2 Asymmetric Encryption Systems -- 2.4 FINAL REMARKS -- References -- Part I UNKEYEDC RYPTOSYSTEMS -- Chapter 3 Random Generators -- 3.1 INTRODUCTION -- 3.2 REALIZATIONS AND IMPLEMENTATIONS -- 3.2.1 Hardware-Based Random Generators -- 3.2.2 Software-Based Random Generators -- 3.2.3 Deskewing Techniques -- 3.3 STATISTICAL RANDOMNESS TESTING -- References -- Chapter 4 Random Functions -- 4.1 INTRODUCTION -- 4.2 IMPLEMENTATION -- 4.3 FINAL REMARKS -- Chapter 5 One-Way Functions -- 5.1 INTRODUCTION -- 5.2 CANDIDATE ONE-WAY FUNCTIONS -- 5.2.1 Discrete Exponentiation Function -- 5.2.2 RSA Function -- 5.2.3 Modular Square Function -- 5.3 INTEGER FACTORIZATION ALGORITHMS -- 5.3.1 Special-Purpose Algorithms -- 5.3.2 General-Purpose Algorithms -- 5.3.3 State of the Art -- 5.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS -- 5.4.1 Generic Algorithms -- 5.4.2 Nongeneric (Special-Purpose) Algorithms -- 5.4.3 State of the Art -- 5.5 ELLIPTIC CURVE CRYPTOGRAPHY -- 5.6 FINAL REMARKS -- References -- Chapter 6 Cryptographic Hash Functions -- 6.1 INTRODUCTION.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">6.2 MERKLE-DAMGARD CONSTRUCTION -- 6.4 EXEMPLARY HASH FUNCTIONS -- 6.4.1 MD4 -- 6.4.2 MD5 -- 6.4.3 SHA-1 -- 6.4.4 SHA-2 Family -- 6.4.5 KECCAK and the SHA-3 Family -- 6.5 FINAL REMARKS -- Part II SECRET KEY CRYPTOSYSTEMS -- Chapter 7 Pseudorandom Generators -- 7.1 INTRODUCTION -- 7.2 EXEMPLARY CONSTRUCTIONS -- 7.3 CRYPTOGRAPHICALLY SECURE PRGs -- 7.3.1 Blum-Micali PRG -- 7.3.2 RSA PRG -- 7.3.3 BBS PRG -- 7.4 FINAL REMARKS -- References -- Chapter 8 Pseudorandom Functions -- 8.1 INTRODUCTION -- 8.2 SECURITY OF A PRF -- 8.3 RELATIONSHIP BETWEEN PRGs AND PRFs -- 8.3.1 PRF-Based PRG -- 8.3.2 PRG-Based PRF -- 8.4 RANDOM ORACLE MODEL -- 8.5 FINAL REMARKS -- References -- Chapter 9 Symmetric Encryption -- 9.1 INTRODUCTION -- 9.1.1 Block and Stream Ciphers -- 9.1.2 Attacks -- 9.2 HISTORICAL PERSPECTIVE -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.3 PERFECTLY SECURE ENCRYPTION -- 9.4 COMPUTATIONALLY SECURE ENCRYPTION -- 9.5 STREAM CIPHERS -- 9.5.1 LFSR-Based Stream Ciphers -- 9.5.2 Other Stream Ciphers -- 9.6 BLOCK CIPHERS -- 9.6.1 DES -- 9.6.2 AES -- 9.7 MODES OF OPERATION -- 9.7.1 ECB -- 9.7.2 CBC -- 9.7.3 CFB -- 9.7.4 OFB -- 9.7.5 CTR -- 9.8 FINAL REMARKS -- References -- Chapter 10 Message Authentication -- 10.1 INTRODUCTION -- 10.2 INFORMATION-THEORETICALLY SECURE MESSAGE AUTHENTICATION -- 10.3 COMPUTATIONALLY SECURE MESSAGE AUTHENTICATION -- 10.3.1 MACs Using A Symmetric Encryption System -- 10.3.2 MACs Using Keyed Hash Functions -- 10.3.3 Carter-WegmanMACs -- 10.4 FINAL REMARKS -- References -- Chapter 11 Authenticated Encryption -- 11.1 INTRODUCTION -- 11.2 AEAD CONSTRUCTIONS -- 11.2.1 CCM -- 11.2.2 GCM -- 11.3 FINAL REMARKS -- References -- Part III PUBLIC KEY CRYPTOSYSTEMS -- Chapter 12 Key Establishment -- 12.1 INTRODUCTION -- 12.2 KEY DISTRIBUTION -- 12.2.1 Merkle's Puzzles -- 12.2.2 Shamir's Three-Pass Protocol.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">12.2.3 Asymmetric Encryption-Based Key Distribution Protocol -- 12.3 KEY AGREEMENT -- 12.4 QUANTUM CRYPTOGRAPHY -- 12.4.1 Basic Principles -- 12.4.2 Quantum Key Exchange Protocol -- 12.4.3 Historical and Recent Developments -- 12.5 FINAL REMARKS -- References -- Chapter 13 Asymmetric Encryption -- 13.1 INTRODUCTION -- 13.2 PROBABILISTIC ENCRYPTION -- 13.2.1 Algorithms -- 13.2.2 Assessment -- 13.3 ASYMMETRIC ENCRYPTION SYSTEMS -- 13.3.1 RSA -- 13.3.2 Rabin -- 13.3.3 Elgamal -- 13.3.4 Cramer-Shoup -- 13.4 IDENTITY-BASED ENCRYPTION -- 13.5 FULLY HOMOMORPHIC ENCRYPTION -- 13.6 FINAL REMARKS -- References -- Chapter 14 Digital Signatures -- 14.1 INTRODUCTION -- 14.2 DIGITAL SIGNATURE SYSTEMS -- 14.2.1 RSA -- 14.2.2 PSS and PSS-R -- 14.2.3 Rabin -- 14.2.4 Elgamal -- 14.2.5 Schnorr -- 14.2.6 DSA -- 14.2.7 ECDSA -- 14.2.8 Cramer-Shoup -- 14.3 IDENTITY-BASED SIGNATURES -- 14.4 ONE-TIME SIGNATURES -- 14.5 VARIANTS -- 14.5.1 Blind Signatures -- 14.5.2 Undeniable Signatures -- 14.5.3 Fail-Stop Signatures -- 14.5.4 Group Signatures -- 14.6 FINAL REMARKS -- References -- Chapter 15 Zero-Knowledge Proofs of Knowledge -- 15.1 INTRODUCTION -- 15.2 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS -- 15.2.1 Fiat-Shamir -- 15.2.2 Guillou-Quisquater -- 15.2.3 Schnorr -- 15.3 NONINTERACTIVE ZERO-KNOWLEDGE -- 15.4 FINAL REMARKS -- References -- Part IV CONCLUSIONS -- Chapter 16 Key Management -- 16.1 INTRODUCTION -- 16.1.1 Key Generation -- 16.1.2 Key Distribution -- 16.1.3 Key Storage -- 16.1.4 Key Destruction -- 16.2 SECRET SHARING -- 16.2.1 Shamir's System -- 16.2.2 Blakley's System -- 16.2.3 Verifiable Secret Sharing -- 16.2.4 Visual Cryptography -- 16.3 KEY RECOVERY -- 16.4 CERTIFICATE MANAGEMENT -- 16.4.1 Introduction -- 16.4.2 X.509 Certificates -- 16.4.3 OpenPGP Certificates -- 16.4.4 State of the Art -- 16.5 FINAL REMARKS -- References -- Chapter 17 Summary.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">17.1 UNKEYED CRYPTOSYSTEMS -- 17.2 SECRET KEY CRYPTOSYSTEMS -- 17.3 PUBLIC KEY CRYPTOSYSTEMS -- 17.4 FINAL REMARKS -- Chapter 18 Outlook -- 18.1 THEORETICAL VIEWPOINT -- 18.2 PRACTICAL VIEWPOINT -- 18.3 PQC -- 18.3.1 Code-based Cryptosystems -- 18.3.2 Hash-based Cryptosystems -- 18.3.3 Lattice-based Cryptosystems -- 18.3.4 Isogeny-based Cryptosystems -- 18.3.5 Multivariate-based Cryptosystems -- 18.4 CLOSING REMARKS -- References -- Appendix A Discrete Mathematics -- A.1 ALGEBRAIC BASICS -- A.1.1 Preliminary Remarks -- A.1.2 Algebraic Structures -- A.1.3 Homomorphisms -- A.1.4 Permutations -- A.2 INTEGER ARITHMETIC -- A.2.1 Integer Division -- A.2.2 Common Divisors and Multiples -- A.2.3 Euclidean Algorithms -- A.2.4 Prime Numbers -- A.2.5 Factorization -- A.2.6 Euler's Totient Function -- A.3 MODULAR ARITHMETIC -- A.3.1 Modular Congruence -- A.3.2 Modular Exponentiation -- A.3.3 Chinese Remainder Theorem -- A.3.4 Fermat's Little Theorem -- A.3.5 Euler's Theorem -- A.3.6 Finite Fields Modulo Irreducible Polynomials -- A.3.7 Quadratic Residuosity -- A.3.8 Blum Integers -- References -- Appendix B Probability Theory -- B.1 BASIC TERMS AND CONCEPTS -- B.2 RANDOM VARIABLES -- B.2.1 Probability Distributions -- B.2.2 Marginal Distributions -- B.2.3 Conditional Probability Distributions -- B.2.4 Expectation -- B.2.5 Independence of Random Variables -- B.2.6 Markov's Inequality -- B.2.7 Variance and Standard Deviation -- B.2.8 Chebyshev's Inequality -- References -- Appendix C Information Theory -- C.1 INTRODUCTION -- C.2 ENTROPY -- C.2.1 Joint Entropy -- C.2.2 Conditional Entropy -- C.2.3 Mutual Information -- C.3 REDUNDANCY -- C.4 KEY EQUIVOCATION AND UNICITY DISTANCE -- References -- Appendix D Complexity Theory -- D.1 PRELIMINARY REMARKS -- D.2 INTRODUCTION -- D.3 ASYMPTOTIC ORDER NOTATION -- D.4 EFFICIENT COMPUTATIONS -- D.5 COMPUTATIONAL MODELS.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">D.6 COMPLEXITY CLASSES -- D.6.1 Complexity Class P -- D.6.2 Complexity Classes NP and coNP -- D.6.3 Complexity Class PP and Its Subclasses -- D.7 FINAL REMARKS -- References -- List of Symbols -- Abbreviations and Acronyms -- About the Author -- Index.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. </subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data encryption (Computer science).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Cryptography.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Oppliger, Rolf</subfield><subfield code="t">Cryptography 101</subfield><subfield code="d">Norwood : Artech House,c2021</subfield><subfield code="z">9781630818463</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6683919</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |