1 October 2023 in New Journal of Physics
Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states. However, various applications, such as integer factorization, optimization, and financial risk analysis, commonly require one of the inputs to be classical. It requires many ancillary qubits, especially when subsequent computations are involved. In this paper, we propose a quantum–classical comparator based on the quantum Fourier transform. Then we extend it to compare two quantum integers and modular arithmetic. Proposed operators only require up to one ancilla qubit, which is optimal for qubit resources. We analyze limitations in the current modular addition circuit and develop it to process arbitrary quantum states in the entire n-qubit space. The proposed algorithms reduce computing resources and make them valuable for noisy intermediate-scale quantum computers.
4 June 2025 in IEEE Transactions on Computers
The growing threat of quantum computing to traditional cryptographic systems has necessitated the development of robust post-quantum algorithms. Crystal-Dilithium, recently standardized by NIST after a three-round competition, is a leading lattice-based digital signature algorithm designed to meet this need. However, conventional hardware implementations of Dilithium often suffer from inefficiencies and performance bottlenecks. To address these weaknesses, this work presents an optimized hardware design for Dilithium across all security levels. The proposed design features a parallel modular multiplication unit, and an enhanced scaling method to reduce bit width and minimize calibration. Additionally, an improved radix-2 Multipath Delay Commutator Number Theoretic Transform (MDC-NTT) and pipelined parallelization using FIFO and BRAM-based buffers are integrated to maximize operating frequency. Evaluated on the Xilinx Artix-7 platform, our implementation achieves a peak frequency of 191 MHz, delivering speedups of 26.3%, 32.5% and 29.6% for key generation, signature generation and signature verification respectively, compared with state-of-the-art works at the highest security level, along with superior hardware efficiency.
10 March 2026 in IEEE Transactions on Computers
Modular multiplication is a vital operation in the Number Theoretic Transform (NTT), significantly enhancing polynomial multiplication in Post-Quantum Cryptography (PQC). The design efficiency of modular multiplication directly influences the computational performance of polynomial computation units. This work marks the first hardware-oriented improvement of the Plantard algorithm, optimizing the NTT architecture. We modify the Plantard algorithm and propose three innovative enhanced versions tailored for lattice-based cryptography (LBC). By employing pre-processed twiddle factors for result correction and eliminating an additional constant multiplication, we greatly simplify the computation steps. Based on these improvements, we further design a lightweight BRAM-free iterative NTT and a high-speed Multi-path Delay Commutator (MDC) pipelined NTT, both targeting the ML-KEM and ML-DSA parameter sets. Implementation results on the Xilinx Artix-7 platform demonstrate that our Plantard_pre$\omega$ design reduces slice usage by 22% to 53% and delay by 41.1% to 44.3% compared to existing algorithms like Barrett and K${}^{2}$RED. Furthermore, our iterative NTT design achieves the minimal area-time product (ATP) among state-of-the-art implementations, with reductions of 61.3% and 40.8% in ENS, and frequency increases of 72.7% and 145.4% for ML-KEM and ML-DSA, respectively. The pipelined NTT design also reduces delay by 23.7% and ATP by 4.9%, showcasing the compactness and superior performance of our approach.
20 July 2026 in ACM Transactions on Reconfigurable Technology and Systems
SPHINCS+ is the only hash-based post-quantum digital signature scheme standardized by NIST. However, its complex multi-level structure and hash-intensive computations pose significant challenges for high-performance and efficient hardware implementations. This paper presents a high-throughput and efficient hardware architecture for SPHINCS+, supporting three security levels. Exploiting the computational characteristics of SPHINCS+ hash functions, a pipelined hash engine and an iterative hash engine are co-designed to efficiently serve different hashing workloads. The architecture further incorporates bubble-free scheduling and parallel Winternitz One-Time Signature Plus (WOTS+) node computation, thereby maximizing the utilization of the pipelined hash engine and improving resource efficiency. In addition, a merged-computation scheme for Forest of Random Subsets (FORS) trees is proposed to reduce the hardware overhead of supporting multiple security levels. Compared with the state-of-the-art design on UltraScale+, the proposed architecture improves area-time product (ATP) by \(1.6\times/1.8\times\) for key generation and signing, and achieves \(3.8\times/4.2\times/1.9\times\) faster key generation, signing, and verification. Compared with the fastest existing implementation on Artix-7, it delivers \(1.2\times\) faster signing and verification, together with \(1.4\times\) better ATP.