Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Cryptography Algorithms

You're reading from   Cryptography Algorithms A guide to algorithms in blockchain, quantum cryptography, zero-knowledge protocols, and homomorphic encryption

Arrow left icon
Product type Paperback
Published in Mar 2022
Publisher Packt
ISBN-13 9781789617139
Length 358 pages
Edition 1st Edition
Languages
Concepts
Arrow right icon
Author (1):
Arrow left icon
Massimo Bertaccini Massimo Bertaccini
Author Profile Icon Massimo Bertaccini
Massimo Bertaccini
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Section 1: A Brief History and Outline of Cryptography
2. Chapter 1: Deep Diving into Cryptography FREE CHAPTER 3. Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
4. Chapter 2: Introduction to Symmetric Encryption 5. Chapter 3: Asymmetric Encryption 6. Chapter 4: Introducing Hash Functions and Digital Signatures 7. Section 3: New Cryptography Algorithms and Protocols
8. Chapter 5: Introduction to Zero-Knowledge Protocols 9. Chapter 6: New Algorithms in Public/Private Key Cryptography 10. Chapter 7: Elliptic Curves 11. Chapter 8: Quantum Cryptography 12. Section 4: Homomorphic Encryption and the Crypto Search Engine
13. Chapter 9: Crypto Search Engine 14. Other Books You May Enjoy

Conventions used

There are a number of text conventions used throughout this book.

Code in text: Indicates code words in text, database table names, folder names, filenames, file extensions, pathnames, dummy URLs, mathematical equations, user input, and Twitter handles. Here is an example: "Encrypt the plaintext blocks using single DES with the [K1] key."

A block of code/mathematical equations are set as follows:

t = (3XP^2 + a)/ 2YP
t= (3*2^2 + 0)/ 2*22= 12/ 44 = Reduce[44*x == 12, x, Modulus -> (67)] = 49
t = 49

Bold: Indicates a new term, an important word, or words that you see onscreen. For example, words in menus or dialog boxes appear in the text like this. Here is an example: "Hash functions are candidates for being quantum resistant, which means that hash functions can overcome a quantum computer's attack under certain conditions."

Tips or Important Notes

Appear like this.

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image