Cryptography Algorithms: A guide to algorithms in blockchain, quantum cryptography, zero-knowledge protocols, and homomorphic encryption

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