An exploratory study involving cryptography and notions of quantum computing

Claude Crépeau

This paper summarizes the current knowledge in the field of two-party cryptographic protocols devised from quantum systems. We introduce the reader to the notion of cryptographic protocols and describe a number of simple building blocks to achieve them. We also give pointers for the reader who is interested to the quantum implementation of these building blocks. 1 Introduction Since the 1970's the science of secret writing, cryptography, has changed substantially due to the introduction of "public key cryptosystems" [26, 41]. The many properties of certain instances of these systems have open the door to several new applications (consult [42, 25, 29, 44, 34, 28, 7, 30, 36, 32, 11, 19, 33] for instance, to mention just a few). The initial goal of cryptography, to provide secure communications, has evolved into a variety of tasks involving secret data. The scenario in which such tasks take place involves two participants (say Alice and Bob) who wish to perform some computation involving ...

Ahmed Farouk, Omar Husain Tarawneh, Mohamed Elhoseny +4 more

Maciej Kuna

In a recent paper Sanpera et al. have shown [1], that for the simplest binary composite systems any density matrix can be described in terms of only product vectors. The purpose of this note is to show that posibillity of decomposing any state as pseudomixtures does not depend on dimension of the subsystems. In a composite quantum system one can find states that involve different degrees of correlation between subsystems. From the physical point of view the most important characterization of such states is related to the nature of these correlations. Separable states involve correlations which can be explained by classical models [2]. The notion of inseparability or entanglement is related to specific relations existing only in pure quantum systems. Recently a general characterization of separable states was given in the language of vectors from natural cone of the Tomita-Takesaki theory, and quantum origin of this notion was explained [3]. Quantum character of entaglement plays a crucial role in quantum communication [4], cryptography [5], and quantum computation [6]. A state of a composite quantum system is inseparable if it cannot by represented as a convex mixture of tensor products

Manuel Calixto

Fei Gao, S Lin

Anshika Vaishnavi, Samaya Pillai

Abstract Information security in communication networks is a persistent problem and essentially requires the usage of encryption methods. Quantum computing was first used to break encryption codes in the latter half of the 20 th century with the introduction of the SHOR algorithm. Though the recent developments in QC capabilities have increased confidentiality, integrity, and availability of networks by protecting them against passive attacks like eavesdropping yet the transformation of classical to quantum computation can bear catastrophic implications as it has the potential to put the currently secure methods of transactions in jeopardy. This paper aims at the evaluation and comparison of traditional cryptographic techniques by the application of a SWOT framework. It takes up an exploratory study of the advanced quantum computing capabilities that can pose a massive risk to network security. The various security enhancements that can be adopted in data transmission to curtail these risks post-quantum are also discussed.