Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Cryptography Algorithms

You're reading from   Cryptography Algorithms Explore New Algorithms in Zero-knowledge, Homomorphic Encryption, and Quantum Cryptography

Arrow left icon
Product type Paperback
Published in Aug 2024
Publisher Packt
ISBN-13 9781835080030
Length 410 pages
Edition 2nd Edition
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 (17) Chapters Close

Preface 1. Section 1: A Brief History and Outline of Cryptography FREE CHAPTER
2. Deep Dive into Cryptography 3. Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
4. Symmetric Encryption Algorithms 5. Asymmetric Encryption Algorithms 6. Hash Functions and Digital Signatures 7. Section 3: New Cryptography Algorithms and Protocols
8. Zero-Knowledge Protocols 9. New Inventions in Cryptography and Logical Attacks 10. Elliptic Curves 11. Homomorphic Encryption and Crypto Search Engine 12. Section 4: Quantum Cryptography
13. Quantum Cryptography 14. Quantum Search Algorithms and Quantum Computing 15. Other Books You May Enjoy
16. Index

Introduction to trees: graph theory

A tree graph is a discrete mathematic structure visualized in a geometrical representation as a tree. Graphs are used in mathematics such as in AI and other fields of applications to make decisions, to represent the best path to reach a destination. As we will see in the next section, the Huffman code can be used in tree graphs to encode text.

A tree graph uses vertices (v), also called nodes or points, that are related to each other. Each of the related pairs of nodes is called an edge (or link or line) and two nodes are connected by only one path.

In the following figure, you can see a tree where 1 is the root of the tree, 2 to 7 are the nodes, and 8 to 15 are the leaves. The segments that link each of the points are the edges.

Figure 8.11: A tree graph

We have seen many cryptographic algorithms in this book. The main scope of these algorithms is related to data security. However, the main scope of the algorithms we are now...

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 €18.99/month. Cancel anytime