Related papers: Quantum hashing based on symmetric groups
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
Since the introduction of quantum computation by Richard Feynman in 1982, Quantum computation has shown exemplary results in various applications of computer science including unstructured database search, factorization, molecular…
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…
Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes…
In this paper, we continue the line of work initiated by Boneh and Zhandry at CRYPTO 2013 and EUROCRYPT 2013 in which they formally define the notion of unforgeability against quantum adversaries specifically, for classical message…
As quantum computers become real, it is high time we come up with effective techniques that help programmers write correct quantum programs. Inspired by Hoare Type Theory in classical computing, we propose Quantum Hoare Type Theory (QHTT),…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in math.RT/0104151; their study continued in math.RA/0208229, math.RT/0305434. This is a family of commutative rings designed to serve as an algebraic framework for the theory…
In this paper we show how to generalize the quantum approximate counting technique developed by Brassard, H{\o}yer and Tapp [ICALP 1998] to a more general setting: estimating the number of marked states of a Markov chain (a Markov chain can…
In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum…
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the…
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that persist even if the polynomial hierarchy collapses. We…
Quantum digital signatures (QDS), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee non-repudiation, authenticity, and integrity of messages. Recently, one-time universal hashing…
Quantum computing has the power to break current cryptographic systems, disrupting online banking, shopping, data storage and communications. Quantum computing also has the power to support stronger more resistant technologies. In this…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.
Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability…
Through introducing controlled alternative quantum walks, we present controlled alternate quantum walks (CAQW) based quantum hash function. CAQW based quantum hash function have excellent security, outstanding statistical performance and…
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for…
A new quantum cryptography protocol, based on all unselected states of a qubit as a sort of alphabet with continuous set of letters, is proposed. Its effectiveness is calculated and shown to be essentially higher than those of the other…