Quantum Implementation of the SAND Algorithm and Its Quantum Resource Estimation for Brute-Force Attack

The SAND algorithm is a family of lightweight AND-RX block ciphers released by DCC in 2022. Our research focuses on assessing the security of SAND with a quantum computation model. This paper presents the first quantum implementation of SAND (including two versions of SAND, SAND-64 and SAND-128). Co...

Full description

Saved in:
Bibliographic Details
Published in:Entropy (Basel, Switzerland) Switzerland), 2024-02, Vol.26 (3), p.216
Main Authors: Wu, Hongyu, Feng, Xiaoning, Zhang, Jiale
Format: Article
Language:English
Subjects:
Algorithms
Analysis
brute-force attack
Circuits
Consumption
Consumption (Economics)
Cost estimates
Cryptography
Cybersecurity
Encryption
grover algorithm
Integrated circuits
Internet of Things
Investment analysis
Lightweight
lightweight block cipher
Quantum computing
SAND algorithm
Semiconductor chips
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The SAND algorithm is a family of lightweight AND-RX block ciphers released by DCC in 2022. Our research focuses on assessing the security of SAND with a quantum computation model. This paper presents the first quantum implementation of SAND (including two versions of SAND, SAND-64 and SAND-128). Considering the depth-times-width metric, the quantum circuit implementation of the SAND algorithm demonstrates a relatively lower consumption of quantum resources than that of the quantum implementations of existing lightweight algorithms. A generalized Grover-based brute-force attack framework was implemented and employed to perform attacks on two versions of the SAND algorithm. This framework utilized the g-database algorithm, which considered different plaintext-ciphertext pairs in a unified manner, reducing quantum resource consumption. Our findings indicate that the SAND-128 algorithm achieved the NIST security level I, while the SAND-64 algorithm fell short of meeting the requirements of security level I.
ISSN:1099-4300
1099-4300
DOI:10.3390/e26030216