Tight Quantum-Security Bounds and Parameter Optimization for SPHINCS+ and NTRU

• URL: http://arxiv.org/abs/2508.19250v1
• Date: Wed, 06 Aug 2025 00:15:21 GMT
• Title: Tight Quantum-Security Bounds and Parameter Optimization for SPHINCS+ and NTRU
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The imminent threat of quantum computing necessitates quantum-resistant cryptosystems. This paper establishes tight security bounds for two NIST PQC finalists: SPHINCS+ (hash-based) and NTRU (lattice-based). Our key contributions include: (1) A quantum attack model incorporating decoherence effects ($\tau_d$) and parallelization limits; (2) Improved entropy concentration inequalities reducing SPHINCS+ parameters by 15-20\%; (3) Optimized NTRU lattice parameters via quantum lattice entropy $H_Q(\Lambda)$; (4) Tightened NTRU-to-LWE reduction with polynomial-factor improvement. Theoretical results demonstrate significant security enhancement over existing constructions, providing implementable parameters for standardization.

Related papers

• Quantum Circuit Realization and Grover Cryptanalysis of the Hybrid ARX-SPN Cipher GFSPX [0.0]
  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.
  arXiv  Detail & Related papers  (2026-05-23T12:38:46Z)
• Quantum-Enhanced Neural Contextual Bandit Algorithms [50.880384999888044]
  This paper introduces the Quantum Neural Tangent Kernel-Upper Confidence Bound (QNTK-UCB) algorithm.<n>QNTK-UCB is a novel algorithm that leverages the Quantum Neural Tangent Kernel (QNTK) to address these limitations.
  arXiv  Detail & Related papers  (2026-01-06T09:58:14Z)
• TensoMeta-VQC: A Tensor-Train-Guided Meta-Learning Framework for Robust and Scalable Variational Quantum Computing [60.996803677584424]
  TensoMeta-VQC is a novel tensor-train (TT)-guided meta-learning framework designed to improve the robustness and scalability of VQC significantly.<n>Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• Quantum State Preparation via Large-Language-Model-Driven Evolution [9.94808160501406]
  We propose an automated framework for quantum circuit design to overcome the rigidity, scalability limitations, and expert dependence of traditional ones in variational quantum algorithms.<n>Our approach autonomously discovers hardware-efficient ans"atze with new features of scalability and system-size-independent number of variational parameters entirely from scratch.
  arXiv  Detail & Related papers  (2025-05-09T18:00:02Z)
• Quantum Rewinding for IOP-Based Succinct Arguments [45.5096562396529]
  We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing. As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best complexity known.
  arXiv  Detail & Related papers  (2024-11-08T06:33:08Z)
• A Quantum Circuit-Based Compression Perspective for Parameter-Efficient Learning [19.178352290785153]
  We introduce Quantum s Adaptation (QPA) in the framework of quantum parameter generation.<n>QPA integrates QNNs with a classical multi-layer perceptron mapping model to generate parameters for fine-tuning methods.<n>Using Gemma-2 and GPT-2 as case studies, QPA demonstrates significant parameter reduction for parameter-efficient fine-tuning methods.
  arXiv  Detail & Related papers  (2024-10-13T14:09:29Z)
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy [6.81054341190257]
  We develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach. We evaluate our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.
  arXiv  Detail & Related papers  (2024-02-21T17:45:03Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Restricting to the chip architecture maintains the quantum neural network accuracy [0.0]
  variational quantum algorithms (VQAs) are a prominent strategy for constructing quantum machine learning models. This article aims to address several critical questions, such as determining the optimal gate sequence, efficient parameter optimization strategies, and understanding the influence of quantum chip architectures on the final results.
  arXiv  Detail & Related papers  (2022-12-29T18:57:05Z)
• Quantum Federated Learning with Entanglement Controlled Circuits and Superposition Coding [44.89303833148191]
  We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs) We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs. In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
  arXiv  Detail & Related papers  (2022-12-04T03:18:03Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Variational Quantum Reinforcement Learning via Evolutionary Optimization [0.0]
  We present two frameworks of deep quantum RL tasks using a gradient-free evolution optimization. We propose a hybrid framework where the quantum RL agents are equipped with hybrid tensor network-variational quantum circuit (TN-VQC) architecture. This allows us to perform quantum RL on the MiniGrid environment with 147-dimensional inputs.
  arXiv  Detail & Related papers  (2021-09-01T16:36:04Z)
• 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)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)

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.