Skip to main content

2024 | Buch

Implementation and Analysis of Ciphers in Quantum Computing

insite
SUCHEN

Über dieses Buch

This book deals with the upcoming threat that may be posed by quantum computers on modern-day security standards, particularly those involving symmetric key ciphers. Considering the progress in the field of quantum computing over the past few years, there is an ever-growing need to analyze the ciphers that are being employed in ensuring security. The symmetric key ciphers are generally considered safe against quantum computers, though one must consider the possible impact due to Grover's search algorithm (that reduces the security claim to the square root bound of what is expected against a classical computer). This book consolidates all the major research works in one place and presents it with adequate clarity, making the subject matter easy to understand for seasoned researchers and students alike. It covers the prerequisite information, new research works (including some of the state of the art), thought-provoking problems for further research, and all the relevant source codes. This book is interesting to engineers, researchers, and students who work/study in the field of cryptography.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction: Emergence of Quantum Computing
Abstract
This chapter presents the role of cryptography in securing our electronic communications. Thereafter, the emerging threat of quantum computers are discussed. This is followed by a summary of the contents of the rest of the chapters.
Anubhab Baksi, Kyungbae Jang
Chapter 2. Quantum Computing Fundamental and Cryptographic Perspective
Abstract
The role of this chapter is to introduce the core concepts of quantum computing (namely, gates, superposition and entanglement). The Grover’s search algorithm is discussed thereafter. Lastly, this chapter comments on the metrics of quantum search complexity.
Anubhab Baksi, Kyungbae Jang
Chapter 3. Reversible S-box Implementation with LIGHTER-R
Abstract
This chapter presents the tool, LIGHTER-R. The objective of our tool is to implement a given 4-bit S-box in reversible logic (which is compatible with quantum implementation). This is highly useful as the 4-bit S-boxes are commonly used in recent lightweight cipher construction.
Anubhab Baksi, Kyungbae Jang
Chapter 4. Quantum Implementation and Resource Estimate for RECTANGLE and KNOT
Abstract
In this chapter, we target the lightweight block cipher RECTANGLE and the Authenticated Encryption with Associated Data (AEAD) KNOT which is based on RECTANGLE. Our implementations for those ciphers are done with ProjectQ (an open-source quantum compatible library designed by researchers from ETH Zurich). We also comment on the quantum security estimates for the ciphers.
Anubhab Baksi, Kyungbae Jang
Chapter 5. Quantum Implementation and Analysis of DEFAULT
Abstract
In this chapter, we present the quantum implementation and analysis of the recently proposed block cipher, DEFAULT. This cipher consists of two components, namely DEFAULT-LAYER and DEFAULT-CORE. Two instances of DEFAULT-LAYER are used before and after DEFAULT-CORE (in the so-called ‘sandwich construction’).
Anubhab Baksi, Kyungbae Jang
Chapter 6. Quantum Analysis of AES
Abstract
Quantum computing is considered among the next big leaps in computer science. While a fully functional quantum computer is still in the future, there is an ever-growing need to evaluate the security of the symmetric key ciphers against a potent quantum adversary. Keeping this in mind, our work explores the key recovery attack using the Grover’s search on the three variants of AES (–128, –192, –256). In total, we develop a pool of 20 implementations per AES variant, by taking the state-of-the-art advancements in the relevant fields into account. In a nutshell, we present the least Toffoli depth and full depth implementations of AES, thereby improving from Zou et al.’s Asiacrypt’20 paper by more than 98 percent for all variants of AES. We show that the qubit count–Toffoli depth product is reduced from theirs by more than 75 percent. Furthermore, we analyze the Jaques et al.’s Eurocrypt’20 implementations in details, fix the bugs (arising from some problem of the quantum computing tool used and not related to their coding) and report corrected benchmarks. To the best of our finding, our work improves from all the previous works (including the Asiacrypt’22 paper by Huang and Sun) in terms of various quantum circuit complexity metrics (such as, Toffoli depth, full depth, Toffoli depth–qubit count product, and so on).
Anubhab Baksi, Kyungbae Jang
Chapter 7. Improved Quantum Analysis of SPECK and LOWMC
Abstract
As the prevalence of quantum computing is growing in leaps and bounds over the past few years, there is an ever-growing need to analyze the symmetric key ciphers against the upcoming threat. Indeed, we have seen a number of research works dedicated to this. Our work delves into this aspect of block ciphers, with respect to the SPECK family and LOWMC family. The SPECK family received two quantum analysis till date (Jang et al., Applied Sciences, 2020; Anand et al., Indocrypt, 2020). We revisit these two works, and present improved benchmarks SPECK (all 10 variants). Our implementations incur lower full depth compared to the previous works. On the other hand, the quantum circuit of LOWMC was explored earlier in Jaques et al.’s Eurocrypt 2020 paper. However, there is an already known bug in their paper, which we patch. On top of that, we present two versions of LOWMC (on L1, L3 and L5 variants) in quantum, both of which incur significantly less full depth than the bug-fixed implementation.
Anubhab Baksi, Kyungbae Jang
Chapter 8. Optimized Quantum Implementation and Analysis of CHAM
Abstract
By employing the Grover’s search algorithm (which reduces the complexity of an otherwise secure cipher by the square root boundary), a quantum computer has the potential to undermine the security of symmetric key cryptography. Recently, studies have proposed analyzing potential attacks using the Grover’s search algorithm in conjunction with quantum circuit implementations for symmetric key cryptography. Analyzing quantum attacks on a cipher (i.e., quantum cryptanalysis) and estimating the necessary quantum resources is related to evaluating post-quantum security for the cipher. In this chapter, we revisit quantum implementations of CHAM, a lightweight cipher family, with a focus on optimizing the linear operations in its key schedule. We represent the linear equations of CHAM as matrices and apply optimization techniques. Using the improved CHAM quantum circuits, we estimate the cost of the Grover’s key search and evaluate its post-quantum security strength.
Anubhab Baksi, Kyungbae Jang
Chapter 9. Concise Cipher Description
Abstract
This chapter consists of the algorithmic description of the target ciphers which are implemented/analyzed in this book.
Anubhab Baksi, Kyungbae Jang
Chapter 10. Conclusion and Outlook
Abstract
This chapter concludes the book. At the end, we comment on problems which could be interesting for the forthcoming researchers.
Anubhab Baksi, Kyungbae Jang
Backmatter
Metadaten
Titel
Implementation and Analysis of Ciphers in Quantum Computing
verfasst von
Anubhab Baksi
Kyungbae Jang
Copyright-Jahr
2024
Verlag
Springer Nature Singapore
Electronic ISBN
978-981-9700-25-7
Print ISBN
978-981-9700-24-0
DOI
https://doi.org/10.1007/978-981-97-0025-7

Neuer Inhalt