Optimized Implementation and Analysis of CHAM in Quantum Computing
A quantum computer capable of running the Grover search algorithm, which reduces the complexity of brute-force attacks by a square root, has the potential to undermine the security strength of symmetric-key cryptography and hash functions. Recently, studies on quantum approaches have proposed analyz...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-04-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/13/8/5156 |
| _version_ | 1797606473495216128 |
|---|---|
| author | Yujin Yang Kyungbae Jang Anubhab Baksi Hwajeong Seo |
| author_facet | Yujin Yang Kyungbae Jang Anubhab Baksi Hwajeong Seo |
| author_sort | Yujin Yang |
| collection | DOAJ |
| description | A quantum computer capable of running the Grover search algorithm, which reduces the complexity of brute-force attacks by a square root, has the potential to undermine the security strength of symmetric-key cryptography and hash functions. Recently, studies on quantum approaches have proposed analyzing potential quantum attacks using the Grover search algorithm in conjunction with optimized quantum circuit implementations for symmetric-key cryptography and hash functions. Analyzing quantum attacks on a cipher (i.e., quantum cryptanalysis) and estimating the necessary quantum resources are related to evaluating post-quantum security for the target cryptography algorithms. In this paper, we revisit quantum implementations of CHAM block cipher, an ultra lightweight cipher, with a focus on optimizing the linear operations in its key schedule. We optimized the linear equations of CHAM as matrices by applying novel optimized decomposition techniques. Using the improved CHAM quantum circuits, we estimate the cost of Grover’s key search and evaluate the post-quantum security strength with further reduced costs. |
| first_indexed | 2024-03-11T05:15:41Z |
| format | Article |
| id | doaj.art-23f09a1fdfb84dc9ad9d0f529dc35669 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-11T05:15:41Z |
| publishDate | 2023-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-23f09a1fdfb84dc9ad9d0f529dc356692023-11-17T18:14:25ZengMDPI AGApplied Sciences2076-34172023-04-01138515610.3390/app13085156Optimized Implementation and Analysis of CHAM in Quantum ComputingYujin Yang0Kyungbae Jang1Anubhab Baksi2Hwajeong Seo3Division of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of KoreaDivision of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of KoreaSchool of Computer Science and Engineering, Nanyang Technological University, Singapore 639798, SingaporeDivision of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of KoreaA quantum computer capable of running the Grover search algorithm, which reduces the complexity of brute-force attacks by a square root, has the potential to undermine the security strength of symmetric-key cryptography and hash functions. Recently, studies on quantum approaches have proposed analyzing potential quantum attacks using the Grover search algorithm in conjunction with optimized quantum circuit implementations for symmetric-key cryptography and hash functions. Analyzing quantum attacks on a cipher (i.e., quantum cryptanalysis) and estimating the necessary quantum resources are related to evaluating post-quantum security for the target cryptography algorithms. In this paper, we revisit quantum implementations of CHAM block cipher, an ultra lightweight cipher, with a focus on optimizing the linear operations in its key schedule. We optimized the linear equations of CHAM as matrices by applying novel optimized decomposition techniques. Using the improved CHAM quantum circuits, we estimate the cost of Grover’s key search and evaluate the post-quantum security strength with further reduced costs.https://www.mdpi.com/2076-3417/13/8/5156quantum computerGrover’s algorithmlightweight block cipherCHAMlinear layer optimization |
| spellingShingle | Yujin Yang Kyungbae Jang Anubhab Baksi Hwajeong Seo Optimized Implementation and Analysis of CHAM in Quantum Computing Applied Sciences quantum computer Grover’s algorithm lightweight block cipher CHAM linear layer optimization |
| title | Optimized Implementation and Analysis of CHAM in Quantum Computing |
| title_full | Optimized Implementation and Analysis of CHAM in Quantum Computing |
| title_fullStr | Optimized Implementation and Analysis of CHAM in Quantum Computing |
| title_full_unstemmed | Optimized Implementation and Analysis of CHAM in Quantum Computing |
| title_short | Optimized Implementation and Analysis of CHAM in Quantum Computing |
| title_sort | optimized implementation and analysis of cham in quantum computing |
| topic | quantum computer Grover’s algorithm lightweight block cipher CHAM linear layer optimization |
| url | https://www.mdpi.com/2076-3417/13/8/5156 |
| work_keys_str_mv | AT yujinyang optimizedimplementationandanalysisofchaminquantumcomputing AT kyungbaejang optimizedimplementationandanalysisofchaminquantumcomputing AT anubhabbaksi optimizedimplementationandanalysisofchaminquantumcomputing AT hwajeongseo optimizedimplementationandanalysisofchaminquantumcomputing |