Cryptography Algorithms Explore New Algorithms in Zero-Knowledge, Homomorphic Encryption, and Quantum Cryptography
This updated edition takes you on an journey through the realm of cryptographic science, providing an in-depth exploration of its history, principles, and the latest cutting-edge developments. You will learn the mathematical logic of how algorithms encrypt and decrypt messages, introducing more comp...
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Birmingham, England :
Packt Publishing Ltd
[2022]
|
| Edición: | Second edition |
| Colección: | Expert insight.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009843335506719 |
Tabla de Contenidos:
- Cover
- Copyright
- Contributors
- Table of Contents
- Preface
- Section 1: A Brief History and Outline of Cryptography
- Chapter 1: Deep Dive 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
- The Caesar cipher
- ROT13
- The Beale ciphers
- The Vernam cipher
- Notes on security and computation
- Summary
- Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
- Chapter 2: Symmetric Encryption Algorithms
- Notations and operations in Boolean logic
- DES algorithms
- Simple DES
- Bit initialization
- Bit expansion
- Key generation
- Bit encryption
- DES
- Key generation in DES
- Analysis of the DES algorithm
- Violation of DES
- Triple DES
- DESX
- AES Rijndael
- Description of AES
- Attacks and vulnerabilities in AES
- Summary
- Chapter 3: Asymmetric Encryption Algorithms
- 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: 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
- Example of one block encoded with SHA- 1
- Authentication and digital signatures
- RSA digital signatures
- Why do digital signatures work?.
- Digital signatures with the ElGamal algorithm
- Blind signatures
- Blind signature with RSA
- Notes on the blind signature protocol
- Summary
- Section 3: New Cryptography Algorithms and Protocols
- Chapter 5: Zero-Knowledge Protocols
- The main scenario of a ZKP - the digital cave
- Non-interactive ZKPs
- Demonstration of a non-interactive ZKP
- Demonstrating an attack on an RSA ZKP
- Schnorr's interactive ZKP
- A demonstration of an interactive ZKP
- A challenge for a disruptive attack on an interactive ZKP
- One-round ZKP
- How it works mathematically
- Numerical example
- Notes on the one-round protocol
- An introduction to zk-SNARKs - spooky moon math
- Understanding how a zk-SNARK works
- Demonstrating an attack on a zk-SNARK protocol
- ZK13 - a ZKP for authentication and key exchange
- ZK13 explained
- Demonstrating the ZK13 protocol
- Notes and possible attacks on the ZK13 protocol
- Possible attacks on ZK13
- Summary
- Chapter 6: New Inventions in Cryptography and Logical Attacks
- The genesis of the MB09 algorithm and blockchain
- Introducing the MB09 algorithm and an attempt at demonstrating Fermat's Last Theorem
- An extensive explanation of the MB09 algorithm
- Introducing the MBXI algorithm
- A numerical example of MBXI
- Notes on the MBXI algorithm and the prelude to an attack on RSA
- Unconventional attacks and self-reverse decryption on RSA
- A new protocol to protect RSA and asymmetric algorithms from spying
- 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
- Notes on the MBXX protocol
- Conclusions on the MBXX protocol
- Lightweight encryption.
- Encryption with Cybpher
- 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 1: Generating keys
- Step 2: Performing the digital signature in secp256k1
- Step 3: Verifying the digital signature
- A numerical exercise on a digital signature on secp256k1
- Attacks on ECDSA and the security of elliptic curves
- Step 1: Discovering the random key, [k]
- Step 2: Recovering the private key, [d]
- Considerations about the future of ECC
- Summary
- Chapter 8: Introduction to Homomorphic Encryption and 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
- The new frontier of CSE and a new quantum algorithm for message transmission: QTM
- Summary
- Section 4: Quantum Cryptography
- Chapter 9: Quantum Cryptography
- Introduction to Q-Mechanics and Q-Cryptography
- An experiment that changed the story of quantum
- An imaginary experiment to understand the elements of Q-Mechanics
- Step 1: superposition
- Step 2: the indeterminacy principle
- Step 3: spin and entanglement
- Origin of Q-Cryptography: quantum money
- QKD: BB84
- Step 1: initializing the quantum channel
- Step 2: transmitting the photons
- Step 3: determining the shared key
- Analysis of attack and technical issues
- Quantum computing
- Shor's algorithm
- Hypothesis and thesis
- Step 1: initializing the qubits.
- Step 2: choosing the random number, (a)
- Step 3: quantum measurement
- Step 4: finding the right candidate, (r)
- QFT
- Step 5: factorizing (n)
- Notes on Shor's algorithm
- Post-Q-Cryptography
- Summary
- Chapter 10: Quantum Search Algorithms and Quantum Computing
- An overview of Grover's algorithm
- Elements of quantum programming: quantum information and circuits
- Classical information
- Quantum information, gates, and circuits
- Pauli gates (X, Z)
- Identity gate
- Hadamard gate
- Deep dive into Grover's algorithm
- Pseudocode for running Grover's algorithm
- Step 1: Allocate the register of qubits in superposition
- Step 2: Iterations on Grover's operator: G
- The unique search problem and the amplitude amplification probability
- Step 1: The promise of the inputs
- Step 2: Grover's operation G
- Step 3: Quantum measurement
- Summary
- Other Books You May Enjoy
- Index.
