Next-generation cryptography algorithms explained: get to grips with new-age cryptography algorithms, protocols, and their implementation /

Description

Cover Title Page Copyright and Credits Dedication Contributors Table of Contents Preface Section 1: A Brief History and Outline of Cryptography Chapter 1: Deep Diving into Cryptography An introduction to cryptography Binary numbers, ASCII code, and notations Fermat's Last Theorem, prime numbers, and modular mathematics A brief history and a panoramic overview of cryptographic algorithms Rosetta Stone Caesar cipher ROT13 The Beale cipher The Vernam cipher Notes on security and computation Summary Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption) Chapter 2: Introduction to Symmetric Encryption Notations and operations in Boolean logic DES algorithms Simple DES DES Triple DES DESX AES Rijndael Description of AES Attacks and vulnerabilities in AES Summary Chapter 3: Asymmetric Encryption Introduction to asymmetric encryption The pioneers The Diffie-Hellman algorithm The discrete logarithm Explaining the D-H algorithm Analyzing the algorithm Possible attacks and cryptanalysis on the D-H algorithm RSA Explaining RSA Analyzing RSA Conventional attacks on the algorithm The application of RSA to verify international treaties Unconventional attacks PGP The ElGamal algorithm Summary Chapter 4: Introducing Hash Functions and Digital Signatures A basic explanation of hash functions Overview of the main hash algorithms Logic and notations to implement hash functions Explanation of the SHA-1 algorithm Notes and example on SHA-1 Authentication and digital signatures RSA digital signatures Digital signatures with the El Gamal algorithm Blind signatures Summary Section 3: New Cryptography Algorithms and Protocols Chapter 5: Introduction to Zero-Knowledge Protocols The main scenario of a ZKP – the digital cave Non-interactive ZKPs Schnorr's interactive ZKP An introduction to zk-SNARKs – spooky moon math Zk-SNARKs in Zcash cryptocurrency One-round ZKP ZK13 – a ZKP for identification and key exchange Summary Chapter 6: New Algorithms in Public/Private Key Cryptography The genesis of the MB09 algorithm Introducing the MB09 algorithm An explanation of MB09 Introducing the MBXI algorithm A numerical example of MBXI Unconventional attacks on RSA Digital signatures on MBXI A direct signature method in MBXI The appendix signature method with MBXI A mathematical demonstration of the MBXI digital signature algorithm The evolution of MB09 and MBXI – an introduction to MBXX An explanation of the MBXX protocol Summary Chapter 7: Elliptic Curves An overview of elliptic curves Operations on elliptic curves Scalar multiplication Implementing the D-H algorithm on elliptic curves Elliptic curve secp256k1 – the Bitcoin digital signature Step one – generating keys Step two – performing the digital signature in secp256k1 Step three – verifying the digital signature A numerical exercise on a digital signature on secp256k1 Attacks on EDCSA and the security of elliptic curves Step one – discovering the random key, [k] Step two – recovering the private key, [d] Considerations about the future of ECC Summary Chapter 8: Quantum Cryptography Introduction to Q-Mechanics and Q-Cryptography An imaginary experiment to understand the elements of Q-Mechanics Step 1 – Superposition Step 2 – The indetermination process Step 3 – Spin and entanglement Q-Cryptography Quantum key distribution – BB84 Step 1 – Initializing the quantum channel Step 2 – Transmitting the photons Step 3 – Determining the shared key Analysis attack and technical issues Quantum computing Shor's algorithm Step 1 – Initializing the qubits Step 2 – Choosing the random number, a Step 3 – Quantum measurement Step 4 – Finding the right candidate, (r) Quantum Fourier Transform Step 5 – Factorizing (n) Notes on Shor's algorithm Post-Q-Cryptography Summary Section 4: Homomorphic Encryption and the Crypto Search Engine Chapter 9: Crypto Search Engine Introduction to CSE – homomorphism Partial homomorphism in RSA Analysis of homomorphic encryption and its implications Math and logic behind search engines Introduction to trees – graph theory Huffman code Hash and Boolean logic CSE explained The innovation in CSE Computational analysis on CSE Example of computational brute-force cracking Applications of CSE Summary Index About Packt Other Books You May Enjoy