Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo p and Order q

Abstract: The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has provided its polynomial-time algorithm on quantum computers. Nevertheless, there are only few examples simulating quantum circuits that operate on general pairs of modulo p and order q. In this article, […]

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art […]

Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate

Abstract: In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum secret sharing schemes with the highest coding rate. This article […]

Private Product Computation Using Quantum Entanglement

In this article, we show that a pair of entangled qubits can be used to compute a product privately. More precisely, two participants with a private input from a finite field can perform local operations on a shared, Bell-like quantum state, and when these qubits are later sent to a third participant, the third participant […]

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

In this article, we first define a primitive problem of secure multiparty computations, i.e., secure multiparty disjunction (SMD), and present a novel quantum protocol for SMD that can ensure information-theoretical security, i.e., unconditional security. Furthermore, based on the quantum SMD protocol, we design a quantum sealed-bid auction (QSA) scheme without an auctioneer. In the proposed […]

Grover on KATAN: Quantum Resource Estimation

This article presents the cost analysis of mounting Grover’s key search attack on the family of KATAN block cipher. Several designs of the reversible quantum circuit of KATAN are proposed. Owing to the National Insitute of Standards and Technology’s (NIST) proposal for postquantum cryptography standardization, the circuits are designed focusing on minimizing the overall depth. […]

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]

Long-Term Secure Distributed Storage Using Quantum Key Distribution Network With Third-Party Verification

The quantum key distribution (QKD) network with Vernam’s one-time pad encryption and secret sharing are powerful security tools to realize an information theoretically secure (ITS) distributed storage system. In the work of Fujiwara et al., a single-password-authenticated secret sharing (SPSS) scheme based on the QKD network and Shamirs secret sharing was experimentally demonstrated; it confirmed ITS […]

Decentralization Using Quantum Blockchain: A Theoretical Analysis

Blockchain technology has been prominent recently due to its applications in cryptocurrency. Numerous decentralized blockchain applications have been possible due to blockchains’ nature of distributed, secured, and peer-to-peer storage. One of its technical pillars is using public-key cryptography and hash functions, which promise a secure, pseudoanonymous, and distributed storage with nonrepudiation. This security is believed […]

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]