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

The evolution of MB09 and MBXI: an introduction to MBXX

In 2020, I developed and patented another protocol that involves both MB09 and MBXI algorithms.

In my mind, one of the problems not wholly solved in Satoshi Nakamoto’s paper was the consensus problem. Another issue (also noticed in MB09) is that we are dealing with a centralized system.

I wanted to overcome these problems, so I needed to implement a scheme such that the following conditions are met:

  • The protocol runs in a decentralized model.
  • The consensus for the validity of transactions is given by a mathematical deterministic function and not by a statistical probability of attack.

In other words, the problem of the double-spending of digital money has to be solved in a cryptographic way, instead of with a consensus based on “game theory.” Indeed, the consensus problem that Satoshi Nakamoto chose is a method based on the theory of the Byzantine generals problem.

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