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 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

Quantum Fourier Transform

Let's discover a little bit more about the Fourier Transform (FT) and QFT.

FT is a mathematical function. It can be intuitively thought of like a musical chord in terms of volume and frequency. The FT can transform an original function into another function, representing the amount of frequency present in the original function. The FT depends on the spatial or temporal frequency and is referred to as a time domain. It is represented by a graphic that shows the frequency that was detected, as shown in the following diagram:

Figure 8.14 – Fourier Transform

Figure 8.14 – Fourier Transform

To understand how this works, let's look at an example of FT taking an arithmetic succession of numbers, like so:

1, 3, 7, 2, 1, 3, 7, 2

As you can see, we have the first four numbers – 1, 3, 7, 2 – which get repeated two times. In other words, we can break the succession into two parts:

1,3,7,2 | 1,3,7,2

Note

The | symbol represents...

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