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...
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
Birmingham, UK
Packt Publishing Ltd.
2024
|
Edition: | Second edition |
Series: | Expert insight
|
Subjects: | |
Online Access: | |
Collection: | O'Reilly - Collection details see MPG.ReNa |
Table of Contents:
- 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
- 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
- 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
- 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
- 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)
- Includes bibliographical references and index