Efficient Implementation of PRESENT and GIFT on Quantum Computers

Jang, Kyungbae; Song, Gyeongju; Kim, Hyun-Jun; Kwon, Hyeokdong; Kim, Hyunji; Seo, Hwajeong

doi:10.3390/app11114776

Cited by 41 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The quantum circuit given by LIGHTER-R requires the optimal number of qubits. Recently, the tool has been widely applied in the quantum circuit implementation of other cryptography, such as Present and Gift [39], RECTANGLE and KNOT [40], DEFAULT [41] and so on.…”

Section: A Decomposition Of S-boxmentioning

confidence: 99%

New record in the number of qubits for a quantum implementation of AES

Gao

Qin

et al. 2023

Front. Phys.

View full text Add to dashboard Cite

Optimizing the quantum circuit for implementing Advanced Encryption Standard (AES) is crucial for estimating the necessary resources in attacking AES by the Grover algorithm. Previous studies have reduced the number of qubits required for the quantum circuits of AES-128/-192/-256 from 984/1112/1336 to 270/334/398, which is close to the optimal value of 256/320/384. It becomes a challenging task to further optimize them. AimTaking aim at this task, we find a method for how the quantum circuit of AES S-box can be designed with the help of the automation tool LIGHTER-R. Particularly, the multiplicative inversion in F28, which is the main part of the S-box, is converted into the multiplicative inversion (and multiplication) in F24, then the latter can be implemented by LIGHTER-R because its search space is small enough. By this method, we construct the quantum circuits of S-box for mapping |a⟩|0⟩ to |a⟩|S(a)⟩ and |a⟩|b⟩ to |a⟩|b ⊕ S(a)⟩ with 20 qubits instead of 22 in the previous studies. In addition, we introduce new techniques to reduce the number of qubits required by the S-box circuit for mapping |a⟩ to |S(a)⟩ from 22 in the previous studies to 16. Accordingly, we synthesize the quantum circuits of AES-128/-192/-256 with 264/328/392 qubits, which implies a new record.

show abstract

Section: A Decomposition Of S-boxmentioning

confidence: 99%

New record in the number of qubits for a quantum implementation of AES

Gao

Qin

et al. 2023

Front. Phys.

View full text Add to dashboard Cite

show abstract

“…Employing other multiplication methods (e.g., quantum Karatsuba such as [14,30] or Toom Cook multiplication such as [31,32]) can be done accordingly by simply changing the underlying blocks since it is supported by Qiskit. Following previous works on quantum cryptanalysis [13,14,28], swap operations can be considered as free since it can be done via qubit relabeling [33,34].…”

Section: B Experiments Setup For Evaluationmentioning

confidence: 99%

Reducing the Depth of Quantum FLT-Based Inversion Circuit

Larasati¹,

Putranto²,

Wardhani³

et al. 2022

Preprint

View full text Add to dashboard Cite

Works on quantum computing and cryptanalysis has increased significantly in the past few years. Various constructions of quantum arithmetic circuits, as one of the essential components in the field, has also been proposed. However, there has only been a few studies on finite field inversion despite its essential use in realizing quantum algorithms, such as in Shor's algorithm for Elliptic Curve Discrete Logarith Problem (ECDLP). In this study, we propose to reduce the depth of the existing quantum Fermat's Little Theorem (FLT)-based inversion circuit for binary finite field. In particular, we propose follow a complete waterfall approach to translate the Itoh-Tsujii's variant of FLT to the corresponding quantum circuit and remove the inverse squaring operations employed in the previous work by Banegas et al., lowering the number of CNOT gates (CNOT count), which contributes to reduced overall depth and gate count. Furthermore, compare the cost by firstly constructing our method and previous work's in Qiskit quantum computer simulator and perform the resource analysis. Our approach can serve as an alternative for a time-efficient implementation.

show abstract

“…Fortunately, there are implementations of both of them in the quantum world, that is, there are reversible implementations using quantum gates. The work in [24] provides a deeper analysis of the quantum circuit. Table 2 show the number of gates for PRESENT and GIFT.…”

Section: Algorithm 8 High Level Description Of Aesmentioning

confidence: 99%

“…Table 2 show the number of gates for PRESENT and GIFT. The authors in [24] give the estimation using CNOT and Toffoli gates, in order to use in our work we use the same decomposition as [17] and decompose 1 Toffoli gate as 7 T gates + 8 Clifford gates. We remark that this gives an upper bound on the number of T gates as we use the generic decomposition; the circuits above could be built using T-gates directly and possibly use fewer T gates [2].…”

Section: Algorithm 8 High Level Description Of Aesmentioning

confidence: 99%

On recovering block cipher secret keys in the cold boot attack setting

Banegas¹,

Villanueva-Polanco²

2022

Preprint

View full text Add to dashboard Cite

This paper presents a general strategy to recover a block cipher secret key in the cold boot attack setting. More precisely, we propose a keyrecovery method that combines key enumeration algorithms and Grover's quantum algorithm to recover a block cipher secret key after an attacker has procured a noisy version of it via a cold boot attack. We also show how to implement the quantum component of our algorithm for several block ciphers such as AES, PRESENT and GIFT, and LowMC. Additionally, since evaluating the third-round post-quantum candidates of the National Institute of Standards and Technology (NIST) post-quantum standardization process against different attack vectors is of great importance for their overall assessment, we show the feasibility of performing our hybrid attack on Picnic, a post-quantum signature algorithm being an alternate candidate in the NIST post-quantum standardization competition. According to our results, our method may recover the Picnic private key for all Picnic parameter sets, tolerating up to 40% of noise for some of the parameter sets. Furthermore, we provide a detailed analysis of our method by giving the cost of its resources, its running time, and its success rate for various enumerations.

show abstract

Efficient Implementation of PRESENT and GIFT on Quantum Computers

Cited by 41 publications

References 15 publications

New record in the number of qubits for a quantum implementation of AES

New record in the number of qubits for a quantum implementation of AES

Reducing the Depth of Quantum FLT-Based Inversion Circuit

On recovering block cipher secret keys in the cold boot attack setting

Contact Info

Product

Resources

About