Quantum Circuit Realization and Grover Cryptanalysis of the Hybrid ARX-SPN Cipher GFSPX

• URL: http://arxiv.org/abs/2605.27443v1
• Date: Sat, 23 May 2026 12:38:46 GMT
• Title: Quantum Circuit Realization and Grover Cryptanalysis of the Hybrid ARX-SPN Cipher GFSPX
• Abstract summary: This paper presents a quantum circuit realization and Grover cryptanalysis of GFSPX.<n>GFSPX is a lightweight block cipher featuring a 64-bit data block and a 128-bit secret key.<n>Our analysis reveals that the total quantum cost of a key-recovery attack on GFSPX is $1.12 times 2159$ quantum gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The security of classical symmetric-key primitives is fundamentally challenged by the emergence of quantum computing, necessitating a rigorous evaluation of their post-quantum resilience. This paper presents a comprehensive quantum circuit realization and Grover cryptanalysis of GFSPX, a lightweight block cipher featuring a 64-bit data block and a 128-bit secret key. GFSPX utilizes a unique hybrid architecture that integrates a 4-branch generalized Feistel structure with both Addition-Rotation-XOR (ARX) and Substitution-Permutation Network (SPN) components. Our quantum implementation optimizes resource distribution by exploiting the inherent reversibility of the Feistel network and employing a compact ripple-carry adder for the ARX layers. The proposed architecture achieves a qubit-optimized footprint of 209 qubits with a baseline quantum cost of 32,498 and a circuit depth of 7,617. To evaluate the cipher's resistance against quantum adversaries, we construct a parallelized Grover oracle using three plaintext-ciphertext pairs to eliminate spurious matches. Our analysis reveals that the total quantum cost of a key-recovery attack on GFSPX is $1.12 \times 2^{159}$ quantum gates. Although this cost falls below the NIST Level 1 security threshold of $2^{170}$, the hybrid ARX-SPN design demonstrates a higher quantum attack resistance among other lightweight designs. These findings provide critical insights into the balance between classical efficiency and quantum resilience in next-generation cryptographic designs for resource-constrained environments.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Quantum Cryptanalysis on IBM Quantum Hardware: Extending Even--Mansour Period Recovery from $N=4$ to $N=10$ [2.0723828938300684]
  We report genuine-un-compiled, textbook-faithful-quantum cryptanalysis of symmetric-cipher structures executed on real IBM quantum hardware.<n>Using Simon's algorithm we recover the hidden period of the Even-Mansour cipher up to security parameter N = 10 on real hardware.<n>A 21-qubit block-10 instance is verified in simulation and submitted to hardware.
  arXiv  Detail & Related papers  (2026-07-20T04:29:44Z)
• Tight Quantum-Security Bounds and Parameter Optimization for SPHINCS+ and NTRU [0.0]
  The imminent threat of quantum computing necessitates quantum-resistant cryptosystems.<n>This paper establishes tight security bounds for two finalists for a quantum-resistant cryptosystems.
  arXiv  Detail & Related papers  (2025-08-06T00:15:21Z)
• A Hybrid Chaos-Based Cryptographic Framework for Post-Quantum Secure Communications [2.474908349649168]
  We present CryptoChaos, a novel hybrid cryptographic framework that synergizes deterministic chaos theory with cutting-edge cryptographic primitives to achieve robust, post-quantum resilient encryption.<n> CryptoChaos harnesses the intrinsic unpredictability of four discrete chaotic maps to generate a high-entropy, multidimensional key from a unified entropy pool.
  arXiv  Detail & Related papers  (2025-04-11T15:24:21Z)
• Quantum circuit for implementing AES S-box with low costs [2.2002244657481826]
  This work reduces the quantum resource overhead required for implementing the S-box by decreasing the number of $CNOT$ gates in the matrix multiplication.<n>With a linear key schedule, the resulting AES-128 quantum circuit reduce the product of the circuit width and $T$ depth to 102800.
  arXiv  Detail & Related papers  (2025-03-08T06:58:44Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• FIPS Compliant Quantum Secure Communication using Quantum Permutation Pad [0.602276990341246]
  This paper proposes to take a nested mode to enable TLS 1.3 protocol with quantum-safe data, which can be made available today and is compliant. We discussed the performance impacts of the handshaking phase of the nested TLS 1.3 with PQC and the symmetric encryption phase.
  arXiv  Detail & Related papers  (2022-12-30T21:56:35Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Key Recovery Attack on SIMON Block Cipher [11.112331561801605]
  We study quantum key recovery attack on SIMON block cipher using Quantum Amplitude Amplification algorithm in Q1 model. We take the quantum attack on 19-round SIMON32/64 for an example and design the quantum circuit of the key recovery process.
  arXiv  Detail & Related papers  (2020-12-12T02:15:47Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.