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

RSA

Among the cryptography algorithms, RSA shines like a star. Its beauty is equal to its logical simplicity and hidden inside is such a force that, after 40 years, it’s still used to protect more than 80 percent of commercial transactions in the world.

Its acronym is made up of the names of its three inventors: Rivest, Shamir, and Aldemar. RSA is what we call the perfect asymmetric algorithm. Actually, in 1997, the CESG, an English cryptography agency, attributed the invention of public-key encryption to James Allis in 1970 and the same agency declared that in 1973, a document was written by Clifford Cocks that demonstrates a similar version of the RSA algorithm.

The essential concept of the asymmetric algorithm is that the keys for encryption and decryption are different.

Recalling the analogy to padlocks I made in the The Diffie-Hellman algorithm section, when I described the D-H algorithm, we saw that anybody (not just Alice and Bob) could lock the box with...

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