1 option
Quantum Algorithms for Cryptographically Significant Boolean Functions : An IBMQ Experience / by Tharrmashastha SAPV, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra.
Springer Nature - Springer Mathematics and Statistics eBooks 2021 English International Available online
View online- Format:
- Book
- Author/Creator:
- SAPV, Tharrmashastha, author.
- Series:
- SpringerBriefs in Computer Science, 2191-5776
- Language:
- English
- Subjects (All):
- Cryptography.
- Data encryption (Computer science).
- Computer networks--Security measures.
- Computer networks.
- Data protection.
- Data protection--Law and legislation.
- Computer crimes.
- Cryptology.
- Mobile and Network Security.
- Data and Information Security.
- Privacy.
- Computer Crime.
- Local Subjects:
- Cryptology.
- Mobile and Network Security.
- Data and Information Security.
- Privacy.
- Computer Crime.
- Physical Description:
- 1 online resource (128 pages)
- Edition:
- 1st ed. 2021.
- Place of Publication:
- Singapore : Springer Nature Singapore : Imprint: Springer, 2021.
- Summary:
- This book is a timely report of the state-of-the-art analytical techniques in the domain of quantum algorithms related to Boolean functions. It bridges the gap between recent developments in the area and the hands-on analysis of the spectral properties of Boolean functions from a cryptologic viewpoint. Topics covered in the book include Qubit, Deutsch–Jozsa and Walsh spectrum, Grover’s algorithm, Simon’s algorithm and autocorrelation spectrum. The book aims at encouraging readers to design and implement practical algorithms related to Boolean functions. Apart from combinatorial techniques, this book considers implementing related programs in a quantum computer. Researchers, practitioners and educators will find this book valuable. .
- Contents:
- 1. Introduction
- 2. Deutsch-Jozsa and Walsh Spectrum
- 3. Grover’s Algorithm and Walsh Spectrum
- 4. Simon’s Algorithm and Autocorrelation Spectrum
- 5. Conclusion & Research Direction.
- ISBN:
- 981-16-3061-5
- OCLC:
- 1261049766
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.