Practical position-based quantum cryptography
NASA Astrophysics Data System (ADS)
Chakraborty, Kaushik; Leverrier, Anthony
2015-11-01
We study a general family of quantum protocols for position verification and present a class of attacks based on the Clifford hierarchy. These attacks outperform current strategies based on port-based teleportation for a large class of practical protocols. We then introduce the interleaved product protocol, a scheme for position verification involving only the preparation and measurement of single qubit states for which the best available attacks have a complexity exponential in the number of classical bits transmitted.
Loss-tolerant position-based quantum cryptography
NASA Astrophysics Data System (ADS)
Qi, Bing; Siopsis, George
2015-04-01
Position-based quantum cryptography (PBQC) allows a party to use its geographical location as its only credential to implement various cryptographic protocols. Such a protocol may lead to important applications in practice. Although it has been shown that any PBQC protocol is breakable if the adversaries pre-share an arbitrarily large entangled state, the security of PBQC in the bounded-quantum-storage model is still an open question. In this paper, we study the performance of various PBQC protocols over a lossy channel under the assumption that no entanglement is pre-shared between adversaries. By introducing the decoy state idea, we show that an extended Bennett-Brassard-1984-type PBQC protocol implemented with a weak coherent source and realistic single-photon detectors can tolerate an overall loss (including both the channel loss and the detection efficiency) of 13 dB if the intrinsic quantum bit error rate is 1%. We also study a few continuous variable PBQC protocols and show that they suffer from a 3-dB loss limitation.
Unconditionally secure commitment in position-based quantum cryptography.
Nadeem, Muhammad
2014-01-01
A new commitment scheme based on position-verification and non-local quantum correlations is presented here for the first time in literature. The only credential for unconditional security is the position of committer and non-local correlations generated; neither receiver has any pre-shared data with the committer nor does receiver require trusted and authenticated quantum/classical channels between him and the committer. In the proposed scheme, receiver trusts the commitment only if the scheme itself verifies position of the committer and validates her commitment through non-local quantum correlations in a single round. The position-based commitment scheme bounds committer to reveal valid commitment within allocated time and guarantees that the receiver will not be able to get information about commitment unless committer reveals. The scheme works for the commitment of both bits and qubits and is equally secure against committer/receiver as well as against any third party who may have interests in destroying the commitment. Our proposed scheme is unconditionally secure in general and evades Mayers and Lo-Chau attacks in particular. PMID:25346509
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-01
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-15
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
NASA Astrophysics Data System (ADS)
Bruß, D.; Meyer, T.
The Greek words "kryptos" ≡ "hidden" and "logos" ≡ "word" are the etymological sources for "cryptology," the science of secure communication. Within cryptology, one distinguishes cryptography (or "code-making") and cryptanalysis (or "code-breaking"). The aim of cryptography is to ensure secret or "secure" communication between a sender, traditionally called Alice, and a receiver, called Bob. The encryption and decryption of a so-called plain text into a cipher text and back is achieved using a certain key (not necessarily the same for Alice and Bob), as illustrated in Fig. 1. Here, "secure" means that an eavesdropper, called Eve, has no information on the message. In this chapter we will show that in classical cryptography (using classical signals), security relies on the assumed difficulty to solve certain mathematical tasks, whereas in quantum cryptography (using quantum signals), security arises from the laws of quantum physics.
Threshold quantum cryptography
Tokunaga, Yuuki; Okamoto, Tatsuaki; Imoto, Nobuyuki
2005-01-01
We present the concept of threshold collaborative unitary transformation or threshold quantum cryptography, which is a kind of quantum version of threshold cryptography. Threshold quantum cryptography states that classical shared secrets are distributed to several parties and a subset of them, whose number is greater than a threshold, collaborates to compute a quantum cryptographic function, while keeping each share secretly inside each party. The shared secrets are reusable if no cheating is detected. As a concrete example of this concept, we show a distributed protocol (with threshold) of conjugate coding.
Quantum Cryptography Without Quantum Uncertainties
NASA Astrophysics Data System (ADS)
Durt, Thomas
2002-06-01
Quantum cryptography aims at transmitting a random key in such a way that the presence of a spy eavesdropping the communication would be revealed by disturbances in the transmission of the message. In standard quantum cryptography, this unavoidable disturbance is a consequence of the uncertainty principle of Heisenberg. We propose in this paper to replace quantum uncertainties by generalised, technological uncertainties, and discuss the realisability of such an idea. The proposed protocol can be considered as a simplification, but also as a generalisation of the standard quantum cryptographic protocols.
Relativistic quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.; Nazin, S. S.
2003-07-01
The problem of unconditional security of quantum cryptography (i.e. the security which is guaranteed by the fundamental laws of nature rather than by technical limitations) is one of the central points in quantum information theory. We propose a relativistic quantum cryptosystem and prove its unconditional security against any eavesdropping attempts. Relativistitic causality arguments allow to demonstrate the security of the system in a simple way. Since the proposed protocol does not empoly collective measurements and quantum codes, the cryptosystem can be experimentally realized with the present state-of-art in fiber optics technologies. The proposed cryptosystem employs only the individual measurements and classical codes and, in addition, the key distribution problem allows to postpone the choice of the state encoding scheme until after the states are already received instead of choosing it before sending the states into the communication channel (i.e. to employ a sort of "antedate" coding).
Relativistic quantum cryptography
Molotkov, S. N.
2011-03-15
A new protocol of quantum key distribution is proposed to transmit keys through free space. Along with quantum-mechanical restrictions on the discernibility of nonorthogonal quantum states, the protocol uses additional restrictions imposed by special relativity theory. Unlike all existing quantum key distribution protocols, this protocol ensures key secrecy for a not strictly one-photon source of quantum states and an arbitrary length of a quantum communication channel.
NASA Astrophysics Data System (ADS)
Salih, Hatim
2016-05-01
The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose a protocol for quantum key distribution (QKD) based on quantum erasure, promising inherent security against detector attacks. We particularly demonstrate its security against a powerful detector-blinding attack.
Secure communications using quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.
1997-08-01
The secure distribution of the secret random bit sequences known as {open_quotes}key{close_quotes} material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal single-photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. In our optical fiber experiment we have performed quantum key distribution over 24-km of underground optical fiber using single-photon interference states, demonstrating that secure, real-time key generation over {open_quotes}open{close_quotes} multi-km node-to-node optical fiber communications links is possible. We have also constructed a quantum key distribution system for free-space, line-of-sight transmission using single-photon polarization states, which is currently undergoing laboratory testing. 7 figs.
Secure communications using quantum cryptography
NASA Astrophysics Data System (ADS)
Hughes, Richard J.; Buttler, William T.; Kwiat, Paul G.; Luther, Gabriel G.; Morgan, George L.; Nordholt, Jane E.; Peterson, C. Glen; Simmons, Charles M.
1997-07-01
The secure distribution of the secret random bit sequences known as `key' material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions: Heisenburg's uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal single-photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single- photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. In our optical fiber experiment we have performed quantum key distribution over 24-km of underground optical fiber using single-photon interference states, demonstrating that secure, real-time key generation over `open' multi-km node-to-node optical fiber communications links is possible.
Cryptography, quantum computation and trapped ions
Hughes, Richard J.
1998-03-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Quantum cryptography over underground optical fibers
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Peterson, C.G.; Simmons, C.
1996-05-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generated shared, secret cryptographic key material using the transmission of quantum states of light whose security is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the key transmissions, nor evade detection, owing to Heisenberg`s uncertainty principle. In this paper the authors describe the theory of quantum cryptography, and the most recent results from their experimental system with which they are generating key material over 14-km of underground optical fiber. These results show that optical-fiber based quantum cryptography could allow secure, real-time key generation over ``open`` multi-km node-to-node optical fiber communications links between secure ``islands.``
The organization and traffic engineering of a quantum cryptography network
NASA Astrophysics Data System (ADS)
Zhao, YuKang; Zhao, MeiSheng; Zhao, Yong; Chen, ZengBing
2012-09-01
How many users can a quantum cryptography network support when certain services are demanded? The answer to this question depends on three factors: the speed of quantum key distribution, the organization and traffic engineering of the quantum cryptography network, and the engineering of services. In this article we focus on the second factor which is lacked in the literature to our knowledge but in urgent need for constructing an optimized large-scale quantum cryptography network. In order to provide an overall understanding about a quantum cryptography network, we also briefly introduce the characteristics of quantum cryptography and service engineering.
Quantum cryptography on optical fiber networks
NASA Astrophysics Data System (ADS)
Townsend, Paul D.
1998-07-01
Quantum cryptography exploits the fact that an unknown quantum state cannot be accurately copied or measured without disturbance. By using such elementary quantum states to represent binary information it is possible, therefore, to construct communication systems with verifiable levels of security that are 'guaranteed' by fundamental quantum mechanical laws. This paper describes recent progress at BT Laboratories in the development of practical optical fiber- based quantum cryptography system. These developments include interferometric systems operating in the 1.3 micrometers - wavelength fiber transparency window over point-to-point links up to approximately 50km in length and on multi-user passive optical networks. We describe how this technology performs on fiber links installed in BT's public network and discuss issues such as cross-talk with conventional data channels propagating at different wavelengths in the same fiber.
Quantum three-pass cryptography protocol
NASA Astrophysics Data System (ADS)
Yang, Li; Wu, Ling-An; Liu, Songhao
2002-09-01
We present a new kind of quantum cryptography protocol based on Shamir's three-pass protocol of classical cryptography, which allows the transmission of qubits directly and secretly via the aid of an unjammable classical channel. In this protocol we implement the encryption and decryption transformations via rotations on the Poincare sphere of the photons polarization parameters. The key technique is that Bob's encryption rotation must be commutative with Alice s decryption rotation; this means that the axes of these two rotations must be parallel. We also present a security analysis of the protocol under a man-in-the-middle attack.
Conditional efficient multiuser quantum cryptography network
NASA Astrophysics Data System (ADS)
Xue, Peng; Li, Chuan-Feng; Guo, Guang-Can
2002-02-01
We propose a conditional quantum key distribution scheme with three nonorthogonal states. Combined with the idea presented by Lo et al. (H.-K. Lo, H. F. Chau, and M. Ardehali, e-print arXiv: quant-ph/0011056), the efficiency of this scheme is increased to tend to 100%. Also, such a refined data analysis guarantees the security of our scheme against the most general eavesdropping strategy. Then, based on the scheme, we present a quantum cryptography network with the addition of a device called ``space optical switch.'' Moreover, we give out a realization of a quantum random number generator. Thus, a feasible experimental scheme of this efficient quantum cryptography network is completely given.
Quantum cryptography on multiuser optical fibre networks
NASA Astrophysics Data System (ADS)
Townsend, Paul D.
1997-01-01
To establish a secure communication channel, it is necessary to distribute between two users a key which allows safe encryption and decryption of messages. But because decryption is a simple task for any key holder, it is crucial that the key remains secret during distribution. Secrecy cannot be guaranteed if distribution occurs on the basis of classical physical mechanisms, as it is impossible to know whether the key has been intercepted during transmission. Quantum cryptography1-3 provides a fundamental solution to this problem. When quantum-mechanical processes are used to establish the key, any eavesdropping during transmission leads to an unavoidable and detectable disturbance in the received key information. Quantum cryptography has been demonstrated using standard telecommunication fibres linking single pairs of users4-8, but practical implementations will require communication networks with many users9. Here I introduce a practical scheme for multi-user quantum cryptography, and demonstrate its operation on an optical fibre network. The scheme enables a single controller on the network to establish, and regularly update, a distinct secret key with each network user. These keys can then be used to securely encrypt conventional data transmissions that are broadcast on the network.
Quantum discord as a resource for quantum cryptography.
Pirandola, Stefano
2014-01-01
Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper. PMID:25378231
FREE-SPACE QUANTUM CRYPTOGRAPHY IN DAYLIGHT
Hughes, R.J.; Buttler, W.T.
2000-01-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
Entanglement-Based Quantum Cryptography and Quantum Communication
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
2007-03-01
Quantum entanglement, to Erwin Schroedinger the essential feature of quantum mechanics, has become a central resource in various quantum communication protocols including quantum cryptography and quantum teleportation. From a fundamental point of view what is exploited in these experiments is the very fact which led Schroedinger to his statement namely that in entangled states joint properties of the entangled systems may be well defined while the individual subsystems may carry no information at all. In entanglement-based quantum cryptography it leads to the most elegant possible solution of the classic key distribution problem. It implies that the key comes into existence at spatially distant location at the same time and does not need to be transported. A number recent developments include for example highly efficient, robust and stable sources of entangled photons with a broad bandwidth of desired features. Also, entanglement-based quantum cryptography is successfully joining other methods in the work towards demonstrating quantum key distribution networks. Along that line recently decoy-state quantum cryptography over a distance of 144 km between two Canary Islands was demonstrated successfully. Such experiments also open up the possibility of quantum communication on a really large scale using LEO satellites. Another important possible future branch of quantum communication involves quantum repeaters in order to cover larger distances with entangled states. Recently the connection of two fully independent lasers in an entanglement swapping experiment did demonstrate that the timing control of such systems on a femtosecond time scale is possible. A related development includes recent demonstrations of all-optical one-way quantum computation schemes with the extremely short cycle time of only 100 nanoseconds.
Security of counterfactual quantum cryptography
Yin Zhenqiang; Li Hongwei; Chen Wei; Han Zhengfu; Guo Guangcan
2010-10-15
Recently, a 'counterfactual' quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett. 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bit error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.
Free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1998-12-31
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approximately}1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined. Possible applications include the rekeying of satellites in low earth orbit.
Twenty Seven Years of Quantum Cryptography!
NASA Astrophysics Data System (ADS)
Hughes, Richard
2011-03-01
One of the fundamental goals of cryptographic research is to minimize the assumptions underlying the protocols that enable secure communications between pairs or groups of users. In 1984, building on earlier research by Stephen Wiesner, Charles Bennett and Gilles Brassard showed how quantum physics could be harnessed to provide information-theoretic security for protocols such as the distribution of cryptographic keys, which enables two parties to secure their conventional communications. Bennett and Brassard and colleagues performed a proof-of-principle quantum key distribution (QKD) experiment with single-photon quantum state transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, bit rate and security. These advances have been enabled by improvements in sources and single-photon detectors. Also in 1991 Artur Ekert showed how the security of QKD could be related to quantum entanglement. This insight led to a deeper understanding and proof of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented over ranges much greater than 100km in both fiber and free-space, multi-node network testbeds have been demonstrated, and satellite-based QKD is under study in several countries. ``Quantum hacking'' researchers have shown the importance of extending security considerations to the classical devices that produce and detect the photon quantum states. New quantum cryptographic protocols such as secure identification have been proposed, and others such as quantum secret splitting have been demonstrated. It is now possible to envision quantum cryptography providing a more secure alternative to present-day cryptographic methods for many secure communications functions. My talk will survey these remarkable developments.
PREFACE: Quantum Information, Communication, Computation and Cryptography
NASA Astrophysics Data System (ADS)
Benatti, F.; Fannes, M.; Floreanini, R.; Petritis, D.
2007-07-01
The application of quantum mechanics to information related fields such as communication, computation and cryptography is a fast growing line of research that has been witnessing an outburst of theoretical and experimental results, with possible practical applications. On the one hand, quantum cryptography with its impact on secrecy of transmission is having its first important actual implementations; on the other hand, the recent advances in quantum optics, ion trapping, BEC manipulation, spin and quantum dot technologies allow us to put to direct test a great deal of theoretical ideas and results. These achievements have stimulated a reborn interest in various aspects of quantum mechanics, creating a unique interplay between physics, both theoretical and experimental, mathematics, information theory and computer science. In view of all these developments, it appeared timely to organize a meeting where graduate students and young researchers could be exposed to the fundamentals of the theory, while senior experts could exchange their latest results. The activity was structured as a school followed by a workshop, and took place at The Abdus Salam International Center for Theoretical Physics (ICTP) and The International School for Advanced Studies (SISSA) in Trieste, Italy, from 12-23 June 2006. The meeting was part of the activity of the Joint European Master Curriculum Development Programme in Quantum Information, Communication, Cryptography and Computation, involving the Universities of Cergy-Pontoise (France), Chania (Greece), Leuven (Belgium), Rennes1 (France) and Trieste (Italy). This special issue of Journal of Physics A: Mathematical and Theoretical collects 22 contributions from well known experts who took part in the workshop. They summarize the present day status of the research in the manifold aspects of quantum information. The issue is opened by two review articles, the first by G Adesso and F Illuminati discussing entanglement in continuous variable
Strong connections between quantum encodings, nonlocality, and quantum cryptography
NASA Astrophysics Data System (ADS)
Sikora, Jamie; Chailloux, André; Kerenidis, Iordanis
2014-02-01
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an in-depth analysis of a simple question: What happens when we perform two measurements sequentially on the same quantum system? This question touches upon some fundamental properties of quantum mechanics, namely the uncertainty principle and the complementarity of quantum measurements. Our results have interesting consequences, for example, they can provide a simple proof of the optimal quantum strategy in the famous Clauser-Horne-Shimony-Holt game. Moreover, we show that the way information is encoded in quantum systems can provide a different perspective in understanding other fundamental aspects of quantum information, like nonlocality and quantum cryptography. We prove some strong equivalences between these notions and provide a number of applications in all areas.
On the complexity of search for keys in quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2016-03-01
The trace distance is used as a security criterion in proofs of security of keys in quantum cryptography. Some authors doubted that this criterion can be reduced to criteria used in classical cryptography. The following question has been answered in this work. Let a quantum cryptography system provide an ɛ-secure key such that ½‖ρ XE - ρ U ⊗ ρ E ‖1 < ɛ, which will be repeatedly used in classical encryption algorithms. To what extent does the ɛ-secure key reduce the number of search steps (guesswork) as compared to the use of ideal keys? A direct relation has been demonstrated between the complexity of the complete consideration of keys, which is one of the main security criteria in classical systems, and the trace distance used in quantum cryptography. Bounds for the minimum and maximum numbers of search steps for the determination of the actual key have been presented.
Proposal for founding mistrustful quantum cryptography on coin tossing
Kent, Adrian
2003-07-01
A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process, or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded on a single protocol, oblivious transfer, from which general secure multiparty computations can be built. The scope of mistrustful quantum cryptography is limited by no-go theorems, which rule out, inter alia, unconditionally secure quantum protocols for oblivious transfer or general secure two-party computations. These theorems apply even to protocols which take relativistic signaling constraints into account. The best that can be hoped for, in general, are quantum protocols which are computationally secure against quantum attack. Here a method is described for building a classically certified bit commitment, and hence every other mistrustful cryptographic task, from a secure coin-tossing protocol. No security proof is attempted, but reasons are sketched why these protocols might resist quantum computational attack.
Analysis of limiting information characteristics of quantum-cryptography protocols
Sych, D V; Grishanin, Boris A; Zadkov, Viktor N
2005-01-31
The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate. (quantum optics and quantum computation)
Quantum cryptography and applications in the optical fiber network
NASA Astrophysics Data System (ADS)
Luo, Yuhui
2005-09-01
Quantum cryptography, as part of quantum information and communications, can provide absolute security for information transmission because it is established on the fundamental laws of quantum theory, such as the principle of uncertainty, No-cloning theorem and quantum entanglement. In this thesis research, a novel scheme to implement quantum key distribution based on multiphoton entanglement with a new protocol is proposed. Its advantages are: a larger information capacity can be obtained with a longer transmission distance and the detection of multiple photons is easier than that of a single photon. The security and attacks pertaining to such a system are also studied. Next, a quantum key distribution over wavelength division multiplexed (WDM) optical fiber networks is realized. Quantum key distribution in networks is a long-standing problem for practical applications. Here we combine quantum cryptography and WDM to solve this problem because WDM technology is universally deployed in the current and next generation fiber networks. The ultimate target is to deploy quantum key distribution over commercial networks. The problems arising from the networks are also studied in this part. Then quantum key distribution in multi-access networks using wavelength routing technology is investigated in this research. For the first time, quantum cryptography for multiple individually targeted users has been successfully implemented in sharp contrast to that using the indiscriminating broadcasting structure. It overcomes the shortcoming that every user in the network can acquire the quantum key signals intended to be exchanged between only two users. Furthermore, a more efficient scheme of quantum key distribution is adopted, hence resulting in a higher key rate. Lastly, a quantum random number generator based on quantum optics has been experimentally demonstrated. This device is a key component for quantum key distribution as it can create truly random numbers, which is an
Quantum cryptography on multi-user network architectures
NASA Astrophysics Data System (ADS)
Kumavor, Patrick D.; Beal, Alan C.; Yelin, Susanne; Donkor, Eric; Wang, Bing C.
2006-05-01
Quantum cryptography applies the uncertainty principle and the no-cloning theorem to allow to parties to share a secret key over an ultra-secure link. Present quantum cryptography technologies provide encryption key distribution only between two users. However, practical implementations of encryption key distribution schemes require establishing secure quantum communications amongst multiple users. This paper looks at some of the advantages and drawbacks of some common network topologies that could be used in sending cryptographic keys across a network consisting of multiple users. These topologies are the star, ring, and bus networks. Their performances are compared and analyzed using quantum bit error rate analysis. The paper also presents an experimental demonstration of a six-user quantum key distribution network implemented on a bus topology.
NASA Astrophysics Data System (ADS)
Lütkenhaus, N.; Shields, A. J.
2009-04-01
Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the
Quantum Cryptography Over 24 km of Underground Optical Fibers
NASA Astrophysics Data System (ADS)
Hughes, Richard; Luther, Gabriel; Morgan, George; Peterson, Charles; Simmons, Charles
1997-04-01
The secure distribution of the secret random bit sequences known as ''key'' material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions: Heisenberg's uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We are performing quantum cryptography over 24-km of underground optical fiber using non-orthogonal single-photon interference states. Key material is built up by transmitting a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. Our experiment demonstrates that secure, real-time key generation over "open" multi-km node-to-node optical fiber communications links is feasible.
Coherent eavesdropping strategies for the four state quantum cryptography protocol
NASA Astrophysics Data System (ADS)
Cirac, J. I.; Gisin, N.
1997-02-01
An elementary derivation of best eavesdropping strategies for the four state BB84 quantum cryptography protocol is presented, for both incoherent and two-qubit coherent attacks. While coherent attacks do not help Eve to obtain more information, they are more powerful to reveal the whole message sent by Alice. Our results are based on symmetric eavesdropping strategies, which we show to be sufficient to analyze these kind of problems.
Practical Quantum Cryptography for Secure Free-Space Communications
Buttler, W.T.; Hughes, R.J.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-02-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
Quantum Overloading Cryptography Using Single-Photon Nonlocality
NASA Astrophysics Data System (ADS)
Tan, Yong-Gang; Cai, Qing-Yu; Shi, Ting-Yun
2007-08-01
Using the single-photon nonlocality, we propose a quantum novel overloading cryptography scheme, in which a single photon carries two bits information in one-way quantum channel. Two commutative modes of the single photon, the polarization mode and the spatial mode, are used to encode secret information. Strict time windows are set to detect the impersonation attack. The spatial mode which denotes the existence of photons is noncommutative with the phase of the photon, so that our scheme is secure against photon-number-splitting attack. Our protocol may be secure against individual attack.
An Online Banking System Based on Quantum Cryptography Communication
NASA Astrophysics Data System (ADS)
Zhou, Ri-gui; Li, Wei; Huan, Tian-tian; Shen, Chen-yi; Li, Hai-sheng
2014-07-01
In this paper, an online banking system has been built. Based on quantum cryptography communication, this system is proved unconditional secure. Two sets of GHZ states are applied, which can ensure the safety of purchase and payment, respectively. In another word, three trading participants in each triplet state group form an interdependent and interactive relationship. In the meantime, trading authorization and blind signature is introduced by means of controllable quantum teleportation. Thus, an effective monitor is practiced on the premise that the privacy of trading partners is guaranteed. If there is a dispute or deceptive behavior, the system will find out the deceiver immediately according to the relationship mentioned above.
NASA Astrophysics Data System (ADS)
Sych, D. V.; Grishanin, Boris A.; Zadkov, Viktor N.
2005-01-01
The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate.
Infeasibility of Quantum Cryptography Without Eavesdropping Check
NASA Astrophysics Data System (ADS)
Yang, Wei; Huang, Liusheng; Song, Fang; Wang, Qiyan
Secure key distribution is impossible in pure classical environment. Unconditional secure key distribution is available when quantum means are introduced, assisted by a classical communication channel. What is possible when a quantum key distribution scheme is without classical communication? We present a general model with this constraint and show that quantum key distribution without classical eavesdropping check is in principle impossible. For an adversary can always succeed in obtaining the secret key via a special case of man-in-the-middle attack, namely intercept-and-forward attack without any risk of being captured.
Some conservative estimates in quantum cryptography
Molotkov, S. N.
2006-08-15
Relationship is established between the security of the BB84 quantum key distribution protocol and the forward and converse coding theorems for quantum communication channels. The upper bound Q{sub c} {approx} 11% on the bit error rate compatible with secure key distribution is determined by solving the transcendental equation H(Q{sub c})=C-bar({rho})/2, where {rho} is the density matrix of the input ensemble, C-bar({rho}) is the classical capacity of a noiseless quantum channel, and H(Q) is the capacity of a classical binary symmetric channel with error rate Q.
Quantum random number generators and their applications in cryptography
NASA Astrophysics Data System (ADS)
Stipcevic, Mario
2012-06-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
High-rate measurement-device-independent quantum cryptography
NASA Astrophysics Data System (ADS)
Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana; Weedbrook, Christian; Braunstein, Samuel L.; Lloyd, Seth; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.
2015-06-01
Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers.
Quantum cryptography for secure free-space communications
NASA Astrophysics Data System (ADS)
Hughes, Richard J.; Buttler, William T.; Kwiat, Paul G.; Lamoreaux, Steve K.; Luther, Gabriel G.; Morgan, George L.; Nordholt, Jane E.; Peterson, C. Glen
1999-04-01
The secure distribution of the secret random bit sequences known as 'key' material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg's uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non- orthogonal photon polarization states to generate shared key material over line-of-sight optical links. Key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. We have developed and tested a free-space quantum key distribution (QKD) system over an outdoor optical path of approximately 1 km at Los Alamos National Laboratory under nighttime conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, we examine the feasibility of surface to satellite QKD.
Quantum cryptography for secure free-space communications
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-03-01
The secure distribution of the secret random bit sequences known as key material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg`s uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). The authors have developed experimental quantum cryptography systems based on the transmission of non-orthogonal photon polarization states to generate shared key material over line-of-sight optical links. Key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. The authors have developed and tested a free-space quantum key distribution (QKD) system over an outdoor optical path of {approximately}1 km at Los Alamos National Laboratory under nighttime conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, they examine the feasibility of surface to satellite QKD.
Quantum cryptography: Round-robin with photons
NASA Astrophysics Data System (ADS)
Fröhlich, Bernd; Yuan, Zhiliang
2015-12-01
Last year the common notion that signal disturbance has to be monitored in a quantum cryptographic link to guarantee secrecy was challenged by a new protocol. The formidable task of demonstrating it experimentally has now been achieved.
Practical implementation of multilevel quantum cryptography
Kulik, S. P. Maslennikov, G. A.; Moreva, E. V.
2006-05-15
The physical principles of a quantum key distribution protocol using four-level optical systems are discussed. Quantum information is encoded into polarization states created by frequency-nondegenerate spontaneous parametric down-conversion in collinear geometry. In the scheme under analysis, the required nonorthogonal states are generated in a single nonlinear crystal. All states in the selected basis are measured deterministically. The results of initial experiments on transformation of the basis polarization states of a four-level optical system are discussed.
Deterministic and efficient quantum cryptography based on Bell's theorem
Chen Zengbing; Pan Jianwei; Zhang Qiang; Bao Xiaohui; Schmiedmayer, Joerg
2006-05-15
We propose a double-entanglement-based quantum cryptography protocol that is both efficient and deterministic. The proposal uses photon pairs with entanglement both in polarization and in time degrees of freedom; each measurement in which both of the two communicating parties register a photon can establish one and only one perfect correlation, and thus deterministically create a key bit. Eavesdropping can be detected by violation of local realism. A variation of the protocol shows a higher security, similar to the six-state protocol, under individual attacks. Our scheme allows a robust implementation under the current technology.
Device-independent quantum cryptography for continuous variables
NASA Astrophysics Data System (ADS)
Marshall, Kevin; Weedbrook, Christian
2014-10-01
We present a device-independent quantum cryptography protocol for continuous variables. Our scheme is based on the Gottesman-Kitaev-Preskill encoding scheme whereby a qubit is embedded in the infinite-dimensional space of a quantum harmonic oscillator. The application of discrete-variable device-independent quantum key distribution to this encoding enables a continuous-variable analog. Since the security of this protocol is based on discrete variables we inherit by default security against collective attacks and, under certain memoryless assumptions, coherent attacks. We find that our protocol is valid over the same distances as its discrete-variable counterpart, except that we are able to take advantage of high efficiency commercially available detectors where, for the most part, only homodyne detection is required. This offers the prospect of closing the loopholes associated with Bell inequalities.
NASA Astrophysics Data System (ADS)
Lütkenhaus, N.; Shields, A. J.
2009-04-01
Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Lo, Hoi-Kwong
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD,more » together with its assumptions, strengths, and weaknesses.« less
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Lo, Hoi-Kwong
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD, together with its assumptions, strengths, and weaknesses.
Superlinear threshold detectors in quantum cryptography
Lydersen, Lars; Maroey, Oystein; Skaar, Johannes; Makarov, Vadim; Jain, Nitin; Wittmann, Christoffer; Marquardt, Christoph; Leuchs, Gerd
2011-09-15
We introduce the concept of a superlinear threshold detector, a detector that has a higher probability to detect multiple photons if it receives them simultaneously rather than at separate times. Highly superlinear threshold detectors in quantum key distribution systems allow eavesdropping the full secret key without being revealed. Here, we generalize the detector control attack, and analyze how it performs against quantum key distribution systems with moderately superlinear detectors. We quantify the superlinearity in superconducting single-photon detectors based on earlier published data, and gated avalanche photodiode detectors based on our own measurements. The analysis shows that quantum key distribution systems using detector(s) of either type can be vulnerable to eavesdropping. The avalanche photodiode detector becomes superlinear toward the end of the gate. For systems expecting substantial loss, or for systems not monitoring loss, this would allow eavesdropping using trigger pulses containing less than 120 photons per pulse. Such an attack would be virtually impossible to catch with an optical power meter at the receiver entrance.
Free-space quantum cryptography with quantum and telecom communication channels
NASA Astrophysics Data System (ADS)
Toyoshima, Morio; Takayama, Yoshihisa; Klaus, Werner; Kunimori, Hiroo; Fujiwara, Mikio; Sasaki, Masahide
2008-07-01
Quantum cryptography is a new technique that uses the laws of physics to transmit information securely. In such systems, the vehicle to transfer quantum information is a single photon. However, the transmission distance is limited by the absorption of photons in an optical fiber in which the maximum demonstrated range is about 100 km. Free-space quantum cryptography between a ground station and a satellite is a way of sending the quantum information further distances than that with optical fibers since there is no birefringence effect in the atmosphere. At the National Institute of Information and Communications Technology (NICT), the laser communication demonstration between the NICT optical ground station and a low earth orbit satellite was successfully conducted in 2006. For such space communication links, free-space quantum cryptography is considered to be an important application in the future. We have developed a prototype system for free-space quantum cryptography using a weak coherent light and a telecom communication channel. The preliminary results are presented.
Practical free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.; Simmons, C.M.
1998-12-01
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approx} 1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined, and the effectiveness of privacy amplification procedures is discussed. The conclusions are that free-space QKD is both effective and secure; possible applications include the rekeying of satellites in low earth orbit.
Tight finite-key analysis for quantum cryptography
NASA Astrophysics Data System (ADS)
Tomamichel, Marco; Lim, Charles Ci Wen; Gisin, Nicolas; Renner, Renato
2012-01-01
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies.
Tight finite-key analysis for quantum cryptography.
Tomamichel, Marco; Lim, Charles Ci Wen; Gisin, Nicolas; Renner, Renato
2012-01-01
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies. PMID:22252558
Experimental quantum cryptography scheme based on orthogonal states: preliminary results
NASA Astrophysics Data System (ADS)
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo P.; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-04-01
Since, in general, non-orthogonal states cannot be cloned, any eavesdropping attempt in a Quantum Communication scheme using non-orthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in Quantum Cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75 (7), pp. 12391243, 1995] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets which travel along separate channels, i.e. two different paths inside a balanced Mach-Zehnder interferometer. Here we present an experiment realizing this scheme.
Experimental quantum-cryptography scheme based on orthogonal states
NASA Astrophysics Data System (ADS)
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-12-01
Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.75.1239 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.
Experimental quantum-cryptography scheme based on orthogonal states
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-12-15
Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.
Quantum cryptography in real-life applications: Assumptions and security
NASA Astrophysics Data System (ADS)
Zhao, Yi
Quantum cryptography, or quantum key distribution (QKD), provides a means of unconditionally secure communication. The security is in principle based on the fundamental laws of physics. Security proofs show that if quantum cryptography is appropriately implemented, even the most powerful eavesdropper cannot decrypt the message from a cipher. The implementations of quantum crypto-systems in real life may not fully comply with the assumptions made in the security proofs. Such discrepancy between the experiment and the theory can be fatal to the security of a QKD system. In this thesis we address a number of these discrepancies. A perfect single-photon source is often assumed in many security proofs. However, a weak coherent source is widely used in a real-life QKD implementation. Decoy state protocols have been proposed as a novel approach to dramatically improve the performance of a weak coherent source based QKD implementation without jeopardizing its security. Here, we present the first experimental demonstrations of decoy state protocols. Our experimental scheme was later adopted by most decoy state QKD implementations. In the security proof of decoy state protocols as well as many other QKD protocols, it is widely assumed that a sender generates a phase-randomized coherent state. This assumption has been enforced in few implementations. We close this gap in two steps: First, we implement and verify the phase randomization experimentally; second, we prove the security of a QKD implementation without the coherent state assumption. In many security proofs of QKD, it is assumed that all the detectors on the receiver's side have identical detection efficiencies. We show experimentally that this assumption may be violated in a commercial QKD implementation due to an eavesdropper's malicious manipulation. Moreover, we show that the eavesdropper can learn part of the final key shared by the legitimate users as a consequence of this violation of the assumptions.
Effect of source tampering in the security of quantum cryptography
NASA Astrophysics Data System (ADS)
Sun, Shi-Hai; Xu, Feihu; Jiang, Mu-Sheng; Ma, Xiang-Chun; Lo, Hoi-Kwong; Liang, Lin-Mei
2015-08-01
The security of source has become an increasingly important issue in quantum cryptography. Based on the framework of measurement-device-independent quantum key distribution (MDI-QKD), the source becomes the only region exploitable by a potential eavesdropper (Eve). Phase randomization is a cornerstone assumption in most discrete-variable (DV) quantum communication protocols (e.g., QKD, quantum coin tossing, weak-coherent-state blind quantum computing, and so on), and the violation of such an assumption is thus fatal to the security of those protocols. In this paper, we show a simple quantum hacking strategy, with commercial and homemade pulsed lasers, by Eve that allows her to actively tamper with the source and violate such an assumption, without leaving a trace afterwards. Furthermore, our attack may also be valid for continuous-variable (CV) QKD, which is another main class of QKD protocol, since, excepting the phase random assumption, other parameters (e.g., intensity) could also be changed, which directly determine the security of CV-QKD.
Quantum cryptography and authentication with low key-consumption
NASA Astrophysics Data System (ADS)
Abidin, A.; Pacher, C.; Lorünser, T.; Larsson, J.-Å.; Peev, M.
2011-11-01
Quantum Key Distribution (QKD - also referred to as Quantum Cryptography) is a technique for secret key agreement. It has been shown that QKD rigged with Information-Theoretic Secure (ITS) authentication (using secret key) of the classical messages transmitted during the key distribution protocol is also ITS. Note, QKD without any authentication can trivially be broken by man-in-the-middle attacks. Here, we study an authentication method that was originally proposed because of its low key consumption; a two-step authentication that uses a publicly known hash function, followed by a secret strongly universal2 hash function, which is exchanged each round. This two-step authentication is not information-theoretically secure but it was argued that nevertheless it does not compromise the security of QKD. In the current contribution we study intrinsic weaknesses of this approach under the common assumption that the QKD adversary has access to unlimited resources including quantum memories. We consider one implementation of Quantum Cryptographic protocols that use such authentication and demonstrate an attack that fully extract the secret key. Even including the final key from the protocol in the authentication does not rule out the possibility of these attacks. To rectify the situation, we propose a countermeasure that, while not information-theoretically secure, restores the need for very large computing power for the attack to work. Finally, we specify conditions that must be satisfied by the two-step authentication in order to restore information-theoretic security.
The (in)adequacy of applicative use of quantum cryptography in wireless sensor networks
NASA Astrophysics Data System (ADS)
Turkanović, Muhamed; Hölbl, Marko
2014-10-01
Recently quantum computation and cryptography principles are exploited in the design of security systems for wireless sensor networks (WSNs), which are consequently named as quantum WSN. Quantum cryptography is presumably secure against any eavesdropper and thus labeled as providing unconditional security. This paper tries to analyze the aspect of the applicative use of quantum principles in WSN. The outcome of the analysis elaborates a summary about the inadequacy of applicative use of quantum cryptography in WSN and presents an overview of all possible applicative challenges and problems while designing quantum-based security systems for WSN. Since WSNs are highly complex frameworks, with many restrictions and constraints, every security system has to be fully compatible and worthwhile. The aim of the paper was to contribute a verdict about this topic, backed up by equitable facts.
Free-Space Quantum Cryptography in a Hydrogen Fraunhofer Window
NASA Astrophysics Data System (ADS)
Rogers, Daniel; Bienfang, Joshua; Mink, Alan; Hershman, Barry; Nakassis, Anastase; Tang, Xiao; Ma, Lijun; Su, David; Williams, Carl; Clark, Charles
2006-05-01
Quantum key distribution (QKD) has shown the potential for the production of cryptographic key for ultra-secure communications. The performance of any QKD system is ultimately limited by the signal to noise ratio on the single-photon channel, and over most useful communications links the resulting in key rates are impractical for performing continuous one-time-pad encryption of today's broadband communications. We have adapted clock and data recovery techniques from modern telecommunications practice to increase the repetition rate of a free-space QKD system by roughly 2 orders of magnitude over previous demonstrations. We have also designed the system to operate in the H-α Fraunhofer window at 656.28 nm, where the solar background is reduced by roughly 7 dB. To achieve high repetition rates this system takes advantage of silicon single-photon avalanche photodiodes with < 50 ps timing resolution and high detection efficiency in the visible region. This free-space QKD system is designed to operate at a repetition rate of 2.5 GHz. We have identified scalable solutions for delivering sustained one-time-pad encryption at 10 Mbps, thus making it possible to integrate quantum cryptography with first-generation Ethernet protocols.
Quantum cryptography using coherent states: Randomized encryption and key generation
NASA Astrophysics Data System (ADS)
Corndorf, Eric
With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic
Topics in quantum cryptography, quantum error correction, and channel simulation
NASA Astrophysics Data System (ADS)
Luo, Zhicheng
In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel
NASA Astrophysics Data System (ADS)
Zhang, Sheng; Wang, Jian; Tang, Chao-Jing
2012-06-01
Counterfactual quantum cryptography, recently proposed by Noh, is featured with no transmission of signal particles. This exhibits evident security advantages, such as its immunity to the well-known photon-number-splitting attack. In this paper, the theoretical security of counterfactual quantum cryptography protocol against the general intercept-resend attacks is proved by bounding the information of an eavesdropper Eve more tightly than in Yin's proposal [Phys. Rev. A 82 042335 (2010)]. It is also shown that practical counterfactual quantum cryptography implementations may be vulnerable when equipped with imperfect apparatuses, by proving that a negative key rate can be achieved when Eve launches a time-shift attack based on imperfect detector efficiency.
A Secure Key Distribution System of Quantum Cryptography Based on the Coherent State
NASA Technical Reports Server (NTRS)
Guo, Guang-Can; Zhang, Xiao-Yu
1996-01-01
The cryptographic communication has a lot of important applications, particularly in the magnificent prospects of private communication. As one knows, the security of cryptographic channel depends crucially on the secrecy of the key. The Vernam cipher is the only cipher system which has guaranteed security. In that system the key must be as long as the message and most be used only once. Quantum cryptography is a method whereby key secrecy can be guaranteed by a physical law. So it is impossible, even in principle, to eavesdrop on such channels. Quantum cryptography has been developed in recent years. Up to now, many schemes of quantum cryptography have been proposed. Now one of the main problems in this field is how to increase transmission distance. In order to use quantum nature of light, up to now proposed schemes all use very dim light pulses. The average photon number is about 0.1. Because of the loss of the optical fiber, it is difficult for the quantum cryptography based on one photon level or on dim light to realize quantum key-distribution over long distance. A quantum key distribution based on coherent state is introduced in this paper. Here we discuss the feasibility and security of this scheme.
Security improvement by using a modified coherent state for quantum cryptography
Lu, Y.J.; Zhu, Luobei; Ou, Z.Y.
2005-03-01
Weak coherent states as a photon source for quantum cryptography have a limit in secure data rate and transmission distance because of the presence of multiphoton events and loss in transmission line. Two-photon events in a coherent state can be taken out by a two-photon interference scheme. We investigate the security issue of utilizing this modified coherent state in quantum cryptography. A 4-dB improvement in the secure data rate or a nearly twofold increase in transmission distance over the coherent state are found. With a recently proposed and improved encoding strategy, further improvement is possible.
Quantum Cryptography for Secure Communications to Low-Earth Orbit Satellites
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Peterson, C.G.; Twyeffort, E.; Simmons, C.M.; Nordholt, J.E.
1999-06-03
This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the quantum transmissions, nor evade detection. Key material is built up using the transmission of a single-photon per bit. We have developed an experimental quantum cryptography system based on the transmission of non-orthogonal single-photon polarization states to generate shared key material over line-of-sight optical links. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on in orbit.
Quantum-tomographic cryptography with a semiconductor single-photon source
Kaszlikowski, D.; Yang, L.J.; Yong, L.S.; Willeboordse, F.H.; Kwek, L.C.
2005-09-15
We analyze the security of so-called quantum-tomographic cryptography with the source producing entangled photons via an experimental scheme proposed by Fattal et al. [Phys. Rev. Lett. 92, 37903 (2004)]. We determine the range of the experimental parameters for which the protocol is secure against the most general incoherent attacks.
On a two-pass scheme without a faraday mirror for free-space relativistic quantum cryptography
Kravtsov, K. S.; Radchenko, I. V.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.
2013-05-15
The stability of destructive interference independent of the input polarization and the state of a quantum communication channel in fiber optic systems used in quantum cryptography plays a principal role in providing the security of communicated keys. A novel optical scheme is proposed that can be used both in relativistic quantum cryptography for communicating keys in open space and for communicating them over fiber optic lines. The scheme ensures stability of destructive interference and admits simple automatic balancing of a fiber interferometer.
Conceptual designs of onboard transceivers for ground-to-satellite quantum cryptography
NASA Astrophysics Data System (ADS)
Toyoshima, Morio; Shoji, Yozo; Takayama, Yoshihisa; Kunimori, Hiroo; Takeoka, Masahiro; Fujiwara, Mikio; Sasaki, Masahide
2009-05-01
A free-space quantum key distribution system is being developed by the National Institute of Information and Communications Technology (NICT) in Koganei, Japan. Quantum cryptography is a new technique for transmitting information where the security is guaranteed by the laws of physics. In such systems, a single photon is used for the quantum information. However, since the transmission distance in optical fibers is limited by the absorption of photons by the fiber, the maximum demonstrated range has been limited to about 100 km. Free-space quantum cryptography between an optical ground station and a satellite is a possible solution to extend the distance for a quantum network beyond the limits of optical fibers. At NICT, a laser communication demonstration between the NICT optical ground station and a low earth orbit satellite was successfully conducted in 2006. The use of free-space quantum key distribution for such space communication links is considered an important future application. This paper presents conceptual designs for the onboard transceivers for satellite quantum cryptography
Comment on 'Two-way protocols for quantum cryptography with a nonmaximally entangled qubit pair'
Qin Sujuan; Gao Fei; Wen Qiaoyan; Guo Fenzhuo
2010-09-15
Three protocols of quantum cryptography with a nonmaximally entangled qubit pair [Phys. Rev. A 80, 022323 (2009)] were recently proposed by Shimizu, Tamaki, and Fukasaka. The security of these protocols is based on the quantum-mechanical constraint for a state transformation between nonmaximally entangled states. However, we find that the second protocol is vulnerable under the correlation-elicitation attack. An eavesdropper can obtain the encoded bit M although she has no knowledge about the random bit R.
The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
NASA Astrophysics Data System (ADS)
Christandl, Matthias
2006-04-01
This thesis presents a study of the structure of bipartite quantum states. In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. In particular, it is shown how to derive a one-to-one relation between the spectra of a bipartite quantum state and its reduced states, and the Kronecker coefficients of the symmetric group. In the second part, the focus lies on the entanglement of bipartite quantum states. Drawing on an analogy between entanglement distillation and secret-key agreement in classical cryptography, a new entanglement measure, `squashed entanglement', is introduced.
The Modeling Library of Eavesdropping Methods in Quantum Cryptography Protocols by Model Checking
NASA Astrophysics Data System (ADS)
Yang, Fan; Yang, Guowu; Hao, Yujie
2016-07-01
The most crucial issue of quantum cryptography protocols is its security. There exists many ways to attack the quantum communication process. In this paper, we present a model checking method for modeling the eavesdropping in quantum information protocols. So when the security properties of a certain protocol are needed to be verified, we can directly use the models which are already built. Here we adopt the probabilistic model checking tool—PRISM to model these attack methods. The verification results show that the detection rate of eavesdropping is approximately close to 1 when enough photons are transmitted.
The Modeling Library of Eavesdropping Methods in Quantum Cryptography Protocols by Model Checking
NASA Astrophysics Data System (ADS)
Yang, Fan; Yang, Guowu; Hao, Yujie
2016-03-01
The most crucial issue of quantum cryptography protocols is its security. There exists many ways to attack the quantum communication process. In this paper, we present a model checking method for modeling the eavesdropping in quantum information protocols. So when the security properties of a certain protocol are needed to be verified, we can directly use the models which are already built. Here we adopt the probabilistic model checking tool—PRISM to model these attack methods. The verification results show that the detection rate of eavesdropping is approximately close to 1 when enough photons are transmitted.
Timofeev, A. V.; Pomozov, D. I.; Makkaveev, A. P.; Molotkov, S. N.
2007-05-15
Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.
Femtosecond Laser--Pumped Source of Entangled Photons for Quantum Cryptography Applications
Pan, D.; Donaldson, W.; Sobolewski, R.
2007-07-31
We present an experimental setup for generation of entangled-photon pairs via spontaneous parametric down-conversion, based on the femtosecond-pulsed laser. Our entangled-photon source utilizes a 76-MHz-repetition-rate, 100-fs-pulse-width, mode-locked, ultrafast femtosecond laser, which can produce, on average, more photon pairs than a cw laser of an equal pump power. The resulting entangled pairs are counted by a pair of high-quantum-efficiency, single-photon, silicon avalanche photodiodes. Our apparatus is intended as an efficient source/receiver system for the quantum communications and quantum cryptography applications.
Active stabilization of the optical part in fiber optic quantum cryptography
NASA Astrophysics Data System (ADS)
Balygin, K. A.; Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.
2016-03-01
The method of active stabilization of the polarization and other parameters of the optical part of a two-pass fiber optic quantum cryptography has been proposed and implemented. The method allows the completely automated maintenance of the visibility of interference close to an ideal value ( V ≥ 0.99) and the reduction of the instrumental contribution to the error in primary keys (QBER) to 0.5%.
Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol
Molotkov, S. N.
2008-07-15
In real fiber-optic quantum cryptography systems, the avalanche photodiodes are not perfect, the source of quantum states is not a single-photon one, and the communication channel is lossy. For these reasons, key distribution is impossible under certain conditions for the system parameters. A simple analysis is performed to find relations between the parameters of real cryptography systems and the length of the quantum channel that guarantee secure quantum key distribution when the eavesdropper's capabilities are limited only by fundamental laws of quantum mechanics while the devices employed by the legitimate users are based on current technologies. Critical values are determined for the rate of secure real-time key generation that can be reached under the current technology level. Calculations show that the upper bound on channel length can be as high as 300 km for imperfect photodetectors (avalanche photodiodes) with present-day quantum efficiency ({eta} {approx} 20%) and dark count probability (p{sub dark} {approx} 10{sup -7})
Field test of a practical secure communication network with decoy-state quantum cryptography.
Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei
2009-04-13
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption. PMID:19365479
Reduced randomness in quantum cryptography with sequences of qubits encoded in the same basis
Lamoureux, L.-P.; Cerf, N. J.; Bechmann-Pasquinucci, H.; Gisin, N.; Macchiavello, C.
2006-03-15
We consider the cloning of sequences of qubits prepared in the states used in the BB84 or six-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the same basis. This result is only valid provided that the sequences are much shorter than the total key. It is of great importance for practical quantum cryptosystems because it reduces the need for high-speed random number generation without impairing on the security against finite-size cloning attacks.
Information complementarity in multipartite quantum states and security in cryptography
NASA Astrophysics Data System (ADS)
Bera, Anindita; Kumar, Asutosh; Rakshit, Debraj; Prabhu, R.; SenDe, Aditi; Sen, Ujjwal
2016-03-01
We derive complementarity relations for arbitrary quantum states of multiparty systems of any number of parties and dimensions between the purity of a part of the system and several correlation quantities, including entanglement and other quantum correlations as well as classical and total correlations, of that part with the remainder of the system. We subsequently use such a complementarity relation between purity and quantum mutual information in the tripartite scenario to provide a bound on the secret key rate for individual attacks on a quantum key distribution protocol.
Cryptography in the Bounded-Quantum-Storage Model
NASA Astrophysics Data System (ADS)
Schaffner, Christian
2007-09-01
This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.
On one asymptotic property of time-shift quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2009-12-01
One of the basic results of classical information theory is that error-free information transmission is possible even through an imperfect binary communication channel with noise up to an error of Q c = 1/2. There is a fundamental and applied question of whether quantum-mechanical constraints can ensure error-free classical-information transmission with quantum states and, moreover, guarantee the security of distributed keys up to the theoretical limit in the error Q c. It has been shown that the secure key distribution is possible up to the error Q c in the asymptotic limit of a large number of bases.
NASA Astrophysics Data System (ADS)
Jacak, Monika; Jacak, Janusz; Jóźwiak, Piotr; Jóźwiak, Ireneusz
2016-06-01
The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.
Optimal alphabets for noise-resistant quantum cryptography
NASA Astrophysics Data System (ADS)
Sych, Denis V.; Grishanin, Boris A.; Zadkov, Victor N.
2005-06-01
Possibilities of improving critical error rate of quantum key distribution (QKD) protocols for different strategies of eavesdropping are investigated. QKD-protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12 and 20 vertexes respectively) and QKD-protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vortexes are considered. Stability of such QKD-protocols to the noise in a quantum channel which is due to the Eve's interference that apply either intercept-receipt or optimal eavesdropping strategy at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after bases reconciliation the QKD-protocol with continuous alphabet surpasses all other protocols in terms of noise-resistance. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
Loss-tolerant quantum cryptography with imperfect sources
NASA Astrophysics Data System (ADS)
Tamaki, Kiyoshi; Curty, Marcos; Kato, Go; Lo, Hoi-Kwong; Azuma, Koji
2014-11-01
In principle, quantum key distribution (QKD) offers unconditional security based on the laws of physics. Unfortunately, all previous QKD experiments assume perfect state preparation in their security analysis. Therefore, the generated key is not proven to be secure in the presence of unavoidable modulation errors. The key reason that modulation errors are not considered in previous QKD experiments lies in a crucial weakness of the standard Gottesman-Lo-Lütkenhaus-Preskill (GLLP) model, namely, it is not loss tolerant and Eve may in principle enhance imperfections through losses. Here, we propose a QKD protocol that is loss tolerant to state preparation flaws. Importantly, we show conclusively that the state preparation process in QKD can be much less precise than initially thought. Our method can also be applied to other quantum cryptographic protocols.
High-Rate Strong-Signal Quantum Cryptography
NASA Technical Reports Server (NTRS)
Yuen, Horace P.
1996-01-01
Several quantum cryptosystems utilizing different kinds of nonclassical lights, which can accommodate high intensity fields and high data rate, are described. However, they are all sensitive to loss and both the high rate and the strong-signal character rapidly disappear. A squeezed light homodyne detection scheme is proposed which, with present-day technology, leads to more than two orders of magnitude data rate improvement over other current experimental systems for moderate loss.
Intermediate states in quantum cryptography and Bell inequalities
Bechmann-Pasquinucci, H.; Gisin, N.
2003-06-01
Intermediate states are known from intercept/resend eavesdropping in the Bennett-Brassard 1984 (BB84) quantum cryptographic protocol. But they also play fundamental roles in the optimal eavesdropping strategy on the BB84 protocol and in the CHSH (Clauser-Horne-Shimony-Holt) inequality. We generalize the intermediate states to an arbitrary dimension and consider intercept/resend eavesdropping, optimal eavesdropping on the generalized BB84 protocol and present a generalized Clauser-Horne-Shimony-Holt inequality for two entangled qudits based on these states.
Memory Attacks on Device-Independent Quantum Cryptography
NASA Astrophysics Data System (ADS)
Barrett, Jonathan; Colbeck, Roger; Kent, Adrian
2013-01-01
Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party).
Memory attacks on device-independent quantum cryptography.
Barrett, Jonathan; Colbeck, Roger; Kent, Adrian
2013-01-01
Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party). PMID:23383767
Bridging the gap between theory and practice in quantum cryptography
NASA Astrophysics Data System (ADS)
Curty, Marcos; Tamaki, Kiyoshi; Xu, Feihu; Mizutani, Akihiro; Lim, Charles C. W.; Qi, Bing; Lo, Hoi-Kwong
2015-10-01
Quantum key distribution (QKD) needs to close the big gap between theory and practice to be a suitable technology for achieving information-theoretic secure communications. Indeed, recent studies on side-channel attacks have exposed the vulnerabilities of QKD implementations against an eavesdropper who may try to attack both the source and the measurement device. Here, we review two potential approaches that, combined, could bring this goal closer: measurement-device-independent QKD and the loss-tolerant QKD protocol. The former removes all possible side-channels from the measurement apparatus and guarantees a high performance over long distances. The latter appears as a robust solution against typical source flaws and it offers similar key rates as those of standard QKD systems. Most importantly, the feasibility of both solutions has already been demonstrated in several lab and field-test experiments.
NASA Astrophysics Data System (ADS)
Zhang, Yichen; Yu, Song; Guo, Hong
2015-11-01
We propose a modified no-switching continuous-variable quantum key distribution protocol by employing a practical noiseless linear amplifier at the receiver to increase the maximal transmission distance and tolerable excess noise. A security analysis is presented to derive the secure bound of the protocol in presence of a Gaussian noisy lossy channel. Simulation results show that the modified protocol can not only transmit longer distance and tolerate more channel excess noise than the original protocol, but also distribute more secure keys in the enhanced region where we define a critical point to separate the enhanced and degenerative region. This critical point presents the condition of using a practical noiseless linear amplifier in the no-switching continuous-variable quantum cryptography, which is meaningful and instructive to implement a practical experiment.
Acin, Antonio; Gisin, Nicolas; Scarani, Valerio
2004-01-01
We propose a class of quantum cryptography protocols that are robust against photon-number-splitting attacks (PNS) in a weak coherent-pulse implementation. We give a quite exhaustive analysis of several eavesdropping attacks on these schemes. The honest parties (Alice and Bob) use present-day technology, in particular an attenuated laser as an approximation of a single-photon source. The idea of the protocols is to exploit the nonorthogonality of quantum states to decrease the information accessible to Eve due to the multiphoton pulses produced by the imperfect source. The distance at which the key distribution becomes insecure due to the PNS attack is significantly increased compared to the existing schemes. We also show that strong-pulse implementations, where a strong pulse is included as a reference, allow for key distribution robust against photon-number-splitting attacks.
NASA Astrophysics Data System (ADS)
Wang, Wei-Long; Gao, Ming; Ma, Zhi
2013-11-01
The one-way Faraday-Michelson system is a very useful practical quantum cryptography system where Faraday mirrors (FMs) play an important role. In this paper we analyze the security of this system against imperfect FMs. We consider the security loophole caused by imperfect FMs in Alice’s and Bob’s security zones. Then we implement a passive FM attack in this system. By changing the values of the imperfection parameters of Alice’s FMs, we calculate the quantum bit error rate between Alice and Bob induced by Eve and the probability that Eve obtains outcomes successfully. It is shown that the imperfection of one of Alice’s two FMs makes the system sensitive to an attack. Finally we give a modified key rate as a function of the FM imperfections. The security analysis indicates that both Alice’s and Bob’s imperfect FMs can compromise the secure key.
Incoherent and coherent eavesdropping in the six-state protocol of quantum cryptography
NASA Astrophysics Data System (ADS)
Bechmann-Pasquinucci, H.; Gisin, N.
1999-06-01
All incoherent as well as 2- and 3-qubit coherent eavesdropping strategies on the six-state protocol of quantum cryptography are classified. For a disturbance of 1/6, the optimal incoherent eavesdropping strategy reduces to the universal quantum cloning machine. Coherent eavesdropping cannot increase Eve's Shannon information, neither on the entire string of bits, nor on the set of bits received undisturbed by Bob. However, coherent eavesdropping can increase as well Eve's Renyi information as her probability of guessing correctly all bits. The case that Eve delays the measurement of her probe until after the public discussion on error correction and privacy amplification is also considered. It is argued that by doing so, Eve gains only negligibly small additional information.
High-dimensional quantum cryptography with twisted light
NASA Astrophysics Data System (ADS)
Mirhosseini, Mohammad; Magaña-Loaiza, Omar S.; O'Sullivan, Malcolm N.; Rodenburg, Brandon; Malik, Mehul; Lavery, Martin P. J.; Padgett, Miles J.; Gauthier, Daniel J.; Boyd, Robert W.
2015-03-01
Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information that can be sent per photon and placing tight bounds on the error rates that such a system can tolerate. Here we describe a proof-of-principle experiment that indicates the feasibility of high-dimensional QKD based on the transverse structure of the light field allowing for the transfer of more than 1 bit per photon. Our implementation uses the orbital angular momentum (OAM) of photons and the corresponding mutually unbiased basis of angular position (ANG). Our experiment uses a digital micro-mirror device for the rapid generation of OAM and ANG modes at 4 kHz, and a mode sorter capable of sorting single photons based on their OAM and ANG content with a separation efficiency of 93%. Through the use of a seven-dimensional alphabet encoded in the OAM and ANG bases, we achieve a channel capacity of 2.05 bits per sifted photon. Our experiment demonstrates that, in addition to having an increased information capacity, multilevel QKD systems based on spatial-mode encoding can be more resilient against intercept-resend eavesdropping attacks.
Free-space quantum cryptography in the H-alpha Fraunhofer window
NASA Astrophysics Data System (ADS)
Rogers, D. J.; Bienfang, J. C.; Mink, A.; Hershman, B. J.; Nakassis, A.; Tang, X.; Ma, L.; Su, D. H.; Williams, Carl J.; Clark, Charles W.
2006-08-01
Free-space Quantum key distribution (QKD) has shown the potential for the practical production of cryptographic key for ultra-secure communications. The performance of any QKD system is ultimately limited by the signal to noise ratio on the single-photon channel, and over most useful communications links the resulting key rates are impractical for performing continuous one-time-pad encryption of today's broadband communications. We have adapted clock and data recovery techniques from modern telecommunications practice, combined with a synchronous classical free-space optical communications link operating in parallel, to increase the repetition rate of a free-space QKD system by roughly 2 orders of magnitude over previous demonstrations. We have also designed the system to operate in the H-alpha Fraunhofer window at 656.28 nm, where the solar background is reduced by roughly 7 dB. This system takes advantage of high efficiency silicon single-photon avalanche photodiodes with <50ps timing resolution that are expected to enable operation at a repetition rate of 2.5 GHz. We have identified scalable solutions for delivering sustained one-time-pad encryption at 10 Mbps, thus making it possible to integrate quantum cryptography into first-generation Ethernet protocols.
NASA Astrophysics Data System (ADS)
Jeong, Youn-Chang; Kim, Yong-Su; Kim, Yoon-Ho
2016-01-01
The decoy-state method allows the use of weak coherent pulses in quantum cryptography, and to date, various strategies for the decoy state have been proposed. Here, we experimentally compare the secret key generation rates between the one-decoy and two-decoy implementations of the Bennett-Brassard 1984 (BB84) quantum key distribution protocol through a 3.1-km optical fiber at 780 nm. Once the parameters of the experimental setup are optimized for the maximal secret key generation rate for each implementation, it is found that the two-decoy implementation outperforms the one-decoy implementation.
Security of two quantum cryptography protocols using the same four qubit states
Branciard, Cyril; Gisin, Nicolas; Kraus, Barbara; Scarani, Valerio
2005-09-15
The first quantum cryptography protocol, proposed by Bennett and Brassard in 1984 (BB84), has been widely studied in recent years. This protocol uses four states (more precisely, two complementary bases) for the encoding of the classical bit. Recently, it has been noticed that by using the same four states, but a different encoding of information, one can define a protocol which is more robust in practical implementations, specifically when attenuated laser pulses are used instead of single-photon sources [V. Scarani et al., Phys. Rev. Lett. 92, 057901 (2004), referred to as the SARG04 protocol]. We present a detailed study of SARG04 in two different regimes. In the first part, we consider an implementation with a single-photon source: we derive bounds on the error rate Q for security against all possible attacks by the eavesdropper. The lower and the upper bound obtained for SARG04 (Q < or approx. 10.95% and Q > or approx. 14.9%, respectively) are close to those obtained for BB84 (Q < or approx. 12.4% and Q > or approx. 14.6%, respectively). In the second part, we consider a realistic source consisting of an attenuated laser and improve on previous analysis by allowing Alice to optimize the mean number of photons as a function of the distance. The SARG04 protocol is found to perform better than BB84, both in secret-key rate and in maximal achievable distance, for a wide class of Eve's attacks.
NASA Astrophysics Data System (ADS)
Liang, Chuang
New telecommunication techniques utilizing distinctive quantum properties, e.g., measurement uncertainties and entanglement, extend the capabilities of existing systems. Quantum cryptography, as an example, provides physical layer security enforced by fundamental physical laws, while modern cryptographic techniques rely on assumptions of intractability of certain mathematical problems with limited computational power. Rapid growth of the Internet leading to global telecommunications puts heavy demands on information security. A novel keyed direct data encryption technique based on the fundamental and irreducible quantum noise of laser light is shown to be compatible with the existing high-speed optical communications infrastructure. With this technique, line encryption for OC-12 (622 Mbps) SONET data over 250 km in a wavelength-division-multiplexing network is demonstrated with fully streaming data. Nonlocal correlation is employed in applications including cryptographic key generation whose practical realizations require telecom-band photon counting and entangled photon-pair generation. Existing telecom-band avalanche-photodiode based photon-counting techniques suffer from large detection noise at high operation rates. New techniques such as ultrashort gating and synchronous sampling at the onset of avalanches are introduced for suppressing the detection noise at high operation speeds. Photon counting at record speeds (25 MHz) that employing an avalanche photodiode is developed, demonstrated and deployed in the experimental studies. Telecom-band correlated photons can be directly created inside optical fibers through its chi(3) nonlinearity. This technique brings practical advantages such as the easy compatibility with fiber-optic systems, excellent spatial modal purity, and potential high-speed operation. As a practical development of this technique, a novel Faraday-mirror based ultra-stable scheme for generating polarization entangled photon-pairs is proposed
Kaszlikowski, Dagomir; Lim, J.Y.; Englert, Berthold-Georg; Kwek, L.C.
2005-10-15
The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. We show that - for protocols that use quantum channels of any dimension and completely characterize them by state tomography - the noise threshold for classical advantage distillation of a specific kind is substantially lower than the threshold for quantum entanglement distillation if the eavesdropper can perform powerful coherent attacks. In marked contrast, earlier investigations had shown that the thresholds are identical for incoherent attacks on the same classical distillation scheme. It remains an open question whether other schemes for classical advantage distillation have higher thresholds for coherent eavesdropping attacks.
NASA Astrophysics Data System (ADS)
Kronberg, D. A.; Molotkov, S. N.
2009-10-01
A new family of two-parameter quantum key distribution protocols is discussed where eavesdropping is detected by using two parameters: bit error rate Q and photon count rate q in control time slots. When a single-photon source is used and mutually orthogonal states are prepared in each basis, the protocol’s maximum tolerable error rate for secure key distribution is the highest, reaching a theoretical upper limit of 50%. When the signal states emitted by the source of attenuated laser light include multiphoton coherent states, the protocol also guarantees secure key distribution over the longest distance as compared to other quantum cryptography systems, up to the channel length for which the channel losses are sufficiently high that all five-photon pulses can be blocked by an eavesdropper.
Orthogonal-state-based cryptography in quantum mechanics and local post-quantum theories
NASA Astrophysics Data System (ADS)
Aravinda, S.; Banerjee, Anindita; Pathak, Anirban; Srikanth, R.
2014-02-01
We introduce the concept of cryptographic reduction, in analogy with a similar concept in computational complexity theory. In this framework, class A of crypto-protocols reduces to protocol class B in a scenario X, if for every instance a of A, there is an instance b of B and a secure transformation X that reproduces a given b, such that the security of b guarantees the security of a. Here we employ this reductive framework to study the relationship between security in quantum key distribution (QKD) and quantum secure direct communication (QSDC). We show that replacing the streaming of independent qubits in a QKD scheme by block encoding and transmission (permuting the order of particles block by block) of qubits, we can construct a QSDC scheme. This forms the basis for the block reduction from a QSDC class of protocols to a QKD class of protocols, whereby if the latter is secure, then so is the former. Conversely, given a secure QSDC protocol, we can of course construct a secure QKD scheme by transmitting a random key as the direct message. Then the QKD class of protocols is secure, assuming the security of the QSDC class which it is built from. We refer to this method of deduction of security for this class of QKD protocols, as key reduction. Finally, we propose an orthogonal-state-based deterministic key distribution (KD) protocol which is secure in some local post-quantum theories. Its security arises neither from geographic splitting of a code state nor from Heisenberg uncertainty, but from post-measurement disturbance.
ERIC Educational Resources Information Center
Hall, Matthew
2003-01-01
Uses cryptography to demonstrate the importance of algebra and the use of technology as an effective real application of mathematics. Explains simple encoding and decoding of messages for student learning of modular arithmetic. This elementary encounter with cryptography along with its historical and modern background serves to motivate student…
ERIC Educational Resources Information Center
Wright, Marie A.
1993-01-01
Cryptography is the science that renders data unintelligible to prevent its unauthorized disclosure or modification. Presents an application of matrices used in linear transformations to illustrate a cryptographic system. An example is provided. (17 references) (MDH)
Niederberger, Armand; Scarani, Valerio; Gisin, Nicolas
2005-04-01
In practical quantum cryptography, the source sometimes produces multiphoton pulses, thus enabling the eavesdropper Eve to perform the powerful photon-number-splitting (PNS) attack. Recently, it was shown by Curty and Luetkenhaus [Phys. Rev. A 69, 042321 (2004)] that the PNS attack is not always the optimal attack when two photons are present: if errors are present in the correlations Alice-Bob and if Eve cannot modify Bob's detection efficiency, Eve gains a larger amount of information using another attack based on a 2{yields}3 cloning machine. In this work, we extend this analysis to all distances Alice-Bob. We identify a new incoherent 2{yields}3 cloning attack which performs better than those described before. Using it, we confirm that, in the presence of errors, Eve's better strategy uses 2{yields}3 cloning attacks instead of the PNS. However, this improvement is very small for the implementations of the Bennett-Brassard 1984 (BB84) protocol. Thus, the existence of these new attacks is conceptually interesting but basically does not change the value of the security parameters of BB84. The main results are valid both for Poissonian and sub-Poissonian sources.
NASA Astrophysics Data System (ADS)
Niederberger, Armand; Scarani, Valerio; Gisin, Nicolas
2005-04-01
In practical quantum cryptography, the source sometimes produces multiphoton pulses, thus enabling the eavesdropper Eve to perform the powerful photon-number-splitting (PNS) attack. Recently, it was shown by Curty and Lütkenhaus [Phys. Rev. A 69, 042321 (2004)] that the PNS attack is not always the optimal attack when two photons are present: if errors are present in the correlations Alice-Bob and if Eve cannot modify Bob’s detection efficiency, Eve gains a larger amount of information using another attack based on a 2→3 cloning machine. In this work, we extend this analysis to all distances Alice-Bob. We identify a new incoherent 2→3 cloning attack which performs better than those described before. Using it, we confirm that, in the presence of errors, Eve’s better strategy uses 2→3 cloning attacks instead of the PNS. However, this improvement is very small for the implementations of the Bennett-Brassard 1984 (BB84) protocol. Thus, the existence of these new attacks is conceptually interesting but basically does not change the value of the security parameters of BB84. The main results are valid both for Poissonian and sub-Poissonian sources.
Faint laser pulses versus a single-photon source in free space quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.; Potapova, T. A.
2016-03-01
In this letter we present estimates for the distance of secret key transmission through free space for three different protocols of quantum key distribution: for BB84 and phase time-coding protocols in the case of a strictly single-photon source, and for the relativistic quantum key distribution protocol in the case of faint laser pulses.
Applications of single-qubit rotations in quantum public-key cryptography
NASA Astrophysics Data System (ADS)
Nikolopoulos, Georgios M.
2008-03-01
We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo’s theorem.
Private classical capacity with a symmetric side channel and its application to quantum cryptography
NASA Astrophysics Data System (ADS)
Smith, Graeme
2008-08-01
We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel’s (unassisted) capacity for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities are equal for degradable channels, thus demonstrating the equivalence of privacy and quantum coherence in this context. We use these ideas to find new bounds on the key rate of quantum key distribution protocols with one-way classical post-processing. For the Bennett-Brassard 1984 protocol, our results demonstrate that collective attacks are strictly stronger than individual attacks.
Quantum cryptography: individual eavesdropping with the knowledge of the error-correcting protocol
Horoshko, D B
2007-12-31
The quantum key distribution protocol BB84 combined with the repetition protocol for error correction is analysed from the point of view of its security against individual eavesdropping relying on quantum memory. It is shown that the mere knowledge of the error-correcting protocol changes the optimal attack and provides the eavesdropper with additional information on the distributed key. (fifth seminar in memory of d.n. klyshko)
NASA Astrophysics Data System (ADS)
Jacak, Monika; Melniczuk, Damian; Jacak, Janusz; Jóźwiak, Ireneusz; Gruber, Jacek; Jóźwiak, Piotr
2015-02-01
In order to assess the susceptibility of the quantum key distribution (QKD) systems to the hacking attack including simultaneous and frequent system self-decalibrations, we analyze the stability of the QKD transmission organized in two commercially available systems. The first one employs non-entangled photons as flying qubits in the dark quantum channel for communication whereas the second one utilizes the entangled photon pairs to secretly share the cryptographic key. Applying standard methods of the statistical data analysis to the characteristic indicators of the quality of the QKD communication (the raw key exchange rate [RKER] and the quantum bit error rate [QBER]), we have estimated the pace of the self-decalibration of both systems and the repeatability rate in the case of controlled worsening of the dark channel quality.
NASA Astrophysics Data System (ADS)
Gerjuoy, Edward
2005-06-01
The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor's algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.
Two-way Gaussian quantum cryptography against coherent attacks in direct reconciliation
NASA Astrophysics Data System (ADS)
Ottaviani, Carlo; Mancini, Stefano; Pirandola, Stefano
2015-12-01
We consider a two-way quantum cryptographic protocol with coherent states assuming direct reconciliation. A detailed security analysis is performed considering a two-mode coherent attack, which represents the residual eavesdropping once the parties have reduced the general attack by applying symmetric random permutations. In this context we provide a general analytical expression for the key rate, discussing the impact of the residual two-mode correlations on the security of the scheme. In particular, we identify the optimal eavesdropping against two-way quantum communication, which is given by a two-mode coherent attack with symmetric and separable correlations.
Continuous-variable quantum cryptography is secure against non-Gaussian attacks.
Grosshans, Frédéric; Cerf, Nicolas J
2004-01-30
A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual Gaussian attack. Consequently, non-Gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems. PMID:14995411
Trojan-horse attacks threaten the security of practical quantum cryptography
NASA Astrophysics Data System (ADS)
Jain, Nitin; Anisimova, Elena; Khan, Imran; Makarov, Vadim; Marquardt, Christoph; Leuchs, Gerd
2014-12-01
A quantum key distribution (QKD) system may be probed by an eavesdropper Eve by sending in bright light from the quantum channel and analyzing the back-reflections. We propose and experimentally demonstrate a setup for mounting such a Trojan-horse attack. We show it in operation against the quantum cryptosystem Clavis2 from ID Quantique, as a proof-of-principle. With just a few back-reflected photons, Eve discerns Bob's (secret) basis choice, and thus the raw key bit in the Scarani-Acín-Ribordy-Gisin 2004 protocol, with higher than 90% probability. This would clearly breach the security of the cryptosystem. Unfortunately, Eve's bright pulses have a side effect of causing a high level of afterpulsing in Bob's single-photon detectors, resulting in a large quantum bit error rate that effectively protects this system from our attack. However, in a Clavis2-like system equipped with detectors with less-noisy but realistic characteristics, an attack strategy with positive leakage of the key would exist. We confirm this by a numerical simulation. Both the eavesdropping setup and strategy can be generalized to attack most of the current QKD systems, especially if they lack proper safeguards. We also propose countermeasures to prevent such attacks.
Decoy-state protocol for quantum cryptography with four different intensities of coherent light
Wang Xiangbin
2005-07-15
We propose an efficient decoy-state protocol for practical quantum key distribution using coherent states. The protocol uses four intensities of different coherent light. A good final key rate is achieved by our protocol with typical parameters of existing practical setups, even with a very low channel transmittance.
NASA Astrophysics Data System (ADS)
Zhou, Ming; Chang, Shoude; Grover, Chander P.
2004-06-01
Further to the optical coding based on fluorescent semiconductor quantum dots (QDs), a concept of using mixtures of multiple single-color QDs for creating highly secret cryptograms based on their absorption/emission properties was demonstrated. The key to readout of the optical codes is a group of excitation lights with the predetermined wavelengths programmed in a secret manner. The cryptograms can be printed on the surfaces of different objects such as valuable documents for security purposes.
Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality
Cabello, Adan; D'Ambrosio, Vincenzo; Nagali, Eleonora; Sciarrino, Fabio
2011-09-15
Quantum cryptographic protocols based on complementarity are not secure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entanglement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.
Advanced techniques for free-space optical quantum cryptography over water
NASA Astrophysics Data System (ADS)
Hill, Alexander D.; Christensen, Bradley; Kwiat, Paul G.
2016-03-01
Free-space quantum key distribution (QKD) over water (e.g., ship to ship) may be limited by ship motion and atmospheric effects, such as mode distortion and beam wander due to turbulence. We report on a technique which reduces noise by excluding spatial modes which are less likely to contain QKD signal photons and experimentally demonstrate an improvement in QKD key generation rates in various noise and turbulence regimes.
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2015-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2014-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
General immunity and superadditivity of two-way Gaussian quantum cryptography
Ottaviani, Carlo; Pirandola, Stefano
2016-01-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks. PMID:26928053
General immunity and superadditivity of two-way Gaussian quantum cryptography
NASA Astrophysics Data System (ADS)
Ottaviani, Carlo; Pirandola, Stefano
2016-03-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.
General immunity and superadditivity of two-way Gaussian quantum cryptography.
Ottaviani, Carlo; Pirandola, Stefano
2016-01-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks. PMID:26928053
A monogamy-of-entanglement game with applications to device-independent quantum cryptography
NASA Astrophysics Data System (ADS)
Tomamichel, Marco; Fehr, Serge; Kaniewski, Jędrzej; Wehner, Stephanie
2013-10-01
We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. Firstly, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices, i.e. we show that BB84 is one-sided device independent. Secondly, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information.
NASA Astrophysics Data System (ADS)
Kwon, Osung; Lee, Min-Soo; Woo, Min Ki; Park, Byung Kwon; Kim, Il Young; Kim, Yong-Su; Han, Sang-Wook; Moon, Sung
2015-12-01
We characterized a polarization-independent phase modulation method, called double phase modulation, for a practical plug and play quantum key distribution (QKD) system. Following investigation of theoretical backgrounds, we applied the method to the practical QKD system and characterized the performance through comparing single phase modulation (SPM) and double phase modulation. Consequently, we obtained repeatable and accurate phase modulation confirmed by high visibility single photon interference even for input signals with arbitrary polarization. Further, the results show that only 80% of the bias voltage required in the case of single phase modulation is needed to obtain the target amount of phase modulation.
NASA Astrophysics Data System (ADS)
Ray, Megan R.; van Enk, S. J.
2013-10-01
In continuous-variable quantum information processing, detectors are necessarily coarse grained and of finite range. We discuss how, especially, the latter feature is a bug and may easily lead to overoptimistic estimates of entanglement and of security when missed data outside the detector range are ignored. We demonstrate that a straightforward worst-case analysis is sufficient to avoid false positive statements about entanglement. We show that, for our worst-case analysis, entropic separability or security criteria are much superior to variance-based criteria.
Cryptographic robustness of a quantum cryptography system using phase-time coding
Molotkov, S. N.
2008-01-15
A cryptographic analysis is presented of a new quantum key distribution protocol using phase-time coding. An upper bound is obtained for the error rate that guarantees secure key distribution. It is shown that the maximum tolerable error rate for this protocol depends on the counting rate in the control time slot. When no counts are detected in the control time slot, the protocol guarantees secure key distribution if the bit error rate in the sifted key does not exceed 50%. This protocol partially discriminates between errors due to system defects (e.g., imbalance of a fiber-optic interferometer) and eavesdropping. In the absence of eavesdropping, the counts detected in the control time slot are not caused by interferometer imbalance, which reduces the requirements for interferometer stability.
Tripartite counterfactual quantum cryptography
NASA Astrophysics Data System (ADS)
Salih, Hatim
2014-07-01
We show how two distrustful parties, "Bob" and "Charlie," can share a secret key with the help of a mutually trusted "Alice" counterfactually; that is, with no information-carrying particles traveling between any of the three.
ERIC Educational Resources Information Center
Bachman, Dale J.; Brown, Ezra A.; Norton, Anderson H.
2010-01-01
Cryptography is the science of hidden or secret writing. More generally, cryptography refers to the science of safeguarding information. Cryptography allows people to use a public medium such as the Internet to transmit private information securely, thus enabling a whole range of conveniences, from online shopping to personally printed movie…
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
NASA Astrophysics Data System (ADS)
Broadbent, Anne
2016-08-01
In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that instantaneous nonlocal quantum computation is possible, at the cost of an exponential amount of prior shared entanglement (in the size of the input). Here, we show that a linear amount of entanglement suffices, (in the size of the computation), as long as the parties share nonlocal correlations as given by the Popescu-Rohrlich box. This means that communication is not required for efficient instantaneous nonlocal quantum computation. Exploiting the well-known relation to position-based cryptography, our result also implies the impossibility of secure position-based cryptography against adversaries with nonsignaling correlations. Furthermore, our construction establishes a quantum analog of the classical communication complexity collapse under nonsignaling correlations.
Heid, Matthias; Luetkenhaus, Norbert
2006-05-15
We investigate the performance of a continuous-variable quantum key distribution scheme in a practical setting. More specifically, we take a nonideal error reconciliation procedure into account. The quantum channel connecting the two honest parties is assumed to be lossy but noiseless. Secret key rates are given for the case that the measurement outcomes are postselected or a reverse reconciliation scheme is applied. The reverse reconciliation scheme loses its initial advantage in the practical setting. If one combines postselection with reverse reconciliation, however, much of this advantage can be recovered.
ERIC Educational Resources Information Center
Tapson, Frank
1996-01-01
Describes public key cryptography, also known as RSA, which is a system using two keys, one used to put a message into cipher and another used to decipher the message. Presents examples using small prime numbers. (MKR)
Neural cryptography with feedback
NASA Astrophysics Data System (ADS)
Ruttor, Andreas; Kinzel, Wolfgang; Shacham, Lanir; Kanter, Ido
2004-04-01
Neural cryptography is based on a competition between attractive and repulsive stochastic forces. A feedback mechanism is added to neural cryptography which increases the repulsive forces. Using numerical simulations and an analytic approach, the probability of a successful attack is calculated for different model parameters. Scaling laws are derived which show that feedback improves the security of the system. In addition, a network with feedback generates a pseudorandom bit sequence which can be used to encrypt and decrypt a secret message.
Molotkov, S. N.
2012-12-15
Any key-generation session contains a finite number of quantum-state messages, and it is there-fore important to understand the fundamental restrictions imposed on the minimal length of a string required to obtain a secret key with a specified length. The entropy uncertainty relations for smooth min and max entropies considerably simplify and shorten the proof of security. A proof of security of quantum key distribution with phase-temporal encryption is presented. This protocol provides the maximum critical error compared to other protocols up to which secure key distribution is guaranteed. In addition, unlike other basic protocols (of the BB84 type), which are vulnerable with respect to an attack by 'blinding' of avalanche photodetectors, this protocol is stable with respect to such an attack and guarantees key security.
Chaos Cryptography with Dynamical Systems
NASA Astrophysics Data System (ADS)
Anderson, Robert; Morse, Jack; Schimmrigk, Rolf
2001-11-01
Cryptography is a subject that draws strength from an amazing variety of different mathematical fields, including such deep results as the Weil-Dwork-Deligne theorem on the zeta function. Physical theories have recently entered the subject as well, an example being the subject of quantum cryptography, motivated in part by Shor's insight into the vulnerability of prime number factorization based crypto systems. In this contribution we describe a cryptographic algorithm which is based on the dynamics of a class of physical models that exhibit chaotic behavior. More precisely, we consider dissipative systems which are described by nonlinear three-dimensional systems of differential equations with strange attractor surfaces of non-integer Lyapunov dimension. The time evolution of such systems in part of the moduli space shows unpredictable behavior, which suggests that they might be useful as pseudorandom number generators. We will show that this is indeed the case and illustrate our procedure mainly with the Lorenz attractor, though we also briefly mention the Rössler system. We use this class of nonlinear models to construct an extremely fast stream cipher with a large keyspace, which we test with Marsaglia's battery of DieHard tests.
NASA Astrophysics Data System (ADS)
Jiang, Mu-Sheng; Sun, Shi-Hai; Tang, Guang-Zhao; Ma, Xiang-Chun; Li, Chun-Yan; Liang, Lin-Mei
2013-12-01
Thanks to the high-speed self-differencing single-photon detector (SD-SPD), the secret key rate of quantum key distribution (QKD), which can, in principle, offer unconditionally secure private communications between two users (Alice and Bob), can exceed 1 Mbit/s. However, the SD-SPD may contain loopholes, which can be exploited by an eavesdropper (Eve) to hack into the unconditional security of the high-speed QKD systems. In this paper, we analyze the fact that the SD-SPD can be remotely controlled by Eve in order to spy on full information without being discovered, then proof-of-principle experiments are demonstrated. Here, we point out that this loophole is introduced directly by the operating principle of the SD-SPD, thus, it cannot be removed, except for the fact that some active countermeasures are applied by the legitimate parties.
Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP.
Bennett, Charles H; Brassard, Gilles; Breidbart, Seth
2014-01-01
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of being detected. With such a channel, a one-time pad can safely be reused many times as long as no eavesdrop is detected, and, planning ahead, part of the capacity of these uncompromised transmissions can be used to send fresh random bits with which to replace the one-time pad when an eavesdrop finally is detected. Unlike other schemes for stretching a one-time pad, this scheme does not depend on complexity-theoretic assumptions such as the difficulty of factoring. PMID:25400534
Indirect visual cryptography scheme
NASA Astrophysics Data System (ADS)
Yang, Xiubo; Li, Tuo; Shi, Yishi
2015-10-01
Visual cryptography (VC), a new cryptographic scheme for image. Here in encryption, image with message is encoded to be N sub-images and any K sub-images can decode the message in a special rules (N>=2, 2<=K<=N). Then any K of the N sub-images are printed on transparency and stacked exactly, the message of original image will be decrypted by human visual system, but any K-1 of them get no information about it. This cryptographic scheme can decode concealed images without any cryptographic computations, and it has high security. But this scheme lacks of hidden because of obvious feature of sub-images. In this paper, we introduce indirect visual cryptography scheme (IVCS), which encodes sub-images to be pure phase images without visible strength based on encoding of visual cryptography. The pure phase image is final ciphertexts. Indirect visual cryptography scheme not only inherits the merits of visual cryptography, but also raises indirection, hidden and security. Meanwhile, the accuracy alignment is not required any more, which leads to the strong anti-interference capacity and robust in this scheme. System of decryption can be integrated highly and operated conveniently, and its process of decryption is dynamic and fast, which all lead to the good potentials in practices.
NASA Astrophysics Data System (ADS)
Poon, Ting-Chung
2004-01-01
We introduce a technique called optical scanning cryptography (OSC). The technique can perform encryption on-the-fly using laser beams and can be implemented using an optical heterodyne scanning. We shall first describe the optical heterodyne scanning system and then provide some computer simulations to clarify and confirm the idea of encryption and decryption.
Dynamics of neural cryptography
Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido
2007-05-15
Synchronization of neural networks has been used for public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.
Cryptography in a communication system
NASA Astrophysics Data System (ADS)
Best, M. R.
1982-10-01
Communication system protection by cryptography is reviewed. Privacy and authentication problems are discussed. Conventional cryptographic systems as well as public key systems are complementary. Classical security methods such as signed contracts, physical locks, passwords and keys remain important.
Visual cryptography by use of polarization
NASA Astrophysics Data System (ADS)
Yamamoto, Hirotsugu; Imagawa, Takanori; Suyama, Shiro
2010-01-01
Visual cryptography is a powerful method to share secret information, such as identification numbers, between plural members. There have been many papers on visual cryptography by use of intensity modulation. Although the use of intensity modulation is suitable for printing, degradation of image quality is a problem. Another problem for conventional visual cryptography is a risk of theft of physical keys. To cope with these problems, we propose a new field of visual cryptography by use of polarization. In this study, we have implemented polarization decoding by stacking films. Use of polarization processing improves image quality of visual cryptography. The purpose of this paper is to construct visual cryptography based on polarization processing. Furthermore, we construct a new type of visual cryptography that uses stacking order as a key for decryption. The use of stacking order multiplies the complexity of encryption. Then, it is effective to prevent secret against theft because the theft cannot determine the secret only by collecting encrypted films.
Finding Cryptography in Object Code
Jason L. Wright
2008-10-01
Finding and identifying Cryptography is a growing concern in the malware analysis community. In this paper, a heuristic method for determining the likelihood that a given function contains a cryptographic algorithm is discussed and the results of applying this method in various environments is shown. The algorithm is based on frequency analysis of opcodes that make up each function within a binary.
Cryptography as a Pedagogical Tool
ERIC Educational Resources Information Center
Kaur, Manmohan
2008-01-01
In order to get undergraduates interested in mathematics, it is necessary to motivate them, give them good reasons to spend time on a subject that requires hard work, and, if possible, involve them in undergraduate research. This article discusses how cryptography can be used for all these purposes. In particular, a special topics course on…
Practicality of quantum information processing
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan
Quantum Information Processing (QIP) is expected to bring revolutionary enhancement to various technological areas. However, today's QIP applications are far from being practical. The problem involves both hardware issues, i.e., quantum devices are imperfect, and software issues, i.e., the functionality of some QIP applications is not fully understood. Aiming to improve the practicality of QIP, in my PhD research I have studied various topics in quantum cryptography and ion trap quantum computation. In quantum cryptography, I first studied the security of position-based quantum cryptography (PBQC). I discovered a wrong assumption in the previous literature that the cheaters are not allowed to share entangled resources. I proposed entanglement attacks that could cheat all known PBQC protocols. I also studied the practicality of continuous-variable (CV) quantum secret sharing (QSS). While the security of CV QSS was considered by the literature only in the limit of infinite squeezing, I found that finitely squeezed CV resources could also provide finite secret sharing rate. Our work relaxes the stringent resources requirement of implementing QSS. In ion trap quantum computation, I studied the phase error of quantum information induced by dc Stark effect during ion transportation. I found an optimized ion trajectory for which the phase error is the minimum. I also defined a threshold speed, above which ion transportation would induce significant error. In addition, I proposed a new application for ion trap systems as universal bosonic simulators (UBS). I introduced two architectures, and discussed their respective strength and weakness. I illustrated the implementations of bosonic state initialization, transformation, and measurement by applying radiation fields or by varying the trap potential. When comparing with conducting optical experiments, the ion trap UBS is advantageous in higher state initialization efficiency and higher measurement accuracy. Finally, I
Secure quantum key distribution
NASA Astrophysics Data System (ADS)
Lo, Hoi-Kwong; Curty, Marcos; Tamaki, Kiyoshi
2014-08-01
Secure communication is crucial in the Internet Age, and quantum mechanics stands poised to revolutionize cryptography as we know it today. In this Review, we introduce the motivation and the current state of the art of research in quantum cryptography. In particular, we discuss the present security model together with its assumptions, strengths and weaknesses. After briefly introducing recent experimental progress and challenges, we survey the latest developments in quantum hacking and countermeasures against it.
Cryptography and system state estimation using polarization states
NASA Astrophysics Data System (ADS)
Kak, Subhash; Verma, Pramode; MacDonald, Greg
2011-09-01
We present new results on cryptography and system state estimation using polarization states of photons. Current quantum cryptography applications are based on the BB84 protocol which is not secure against photon siphoning attacks. Recent research has established that the information that can be obtained from a pure state in repeated experiments is potentially infinite. This can be harnessed by sending a burst of photons confined to a very narrow time window, each such burst containing several bits of information. The proposed method represents a new way of transmitting secret information. While polarization shift-keying methods have been proposed earlier, our method is somewhat different in that it proposes to discover the polarization state of identical photons in a burst from a laser which codes binary information. We also present results on estimating the state of a system based on the polarization of the received photons which can have applications in intrusion detection.
Cryptography with DNA binary strands.
Leier, A; Richter, C; Banzhaf, W; Rauhe, H
2000-06-01
Biotechnological methods can be used for cryptography. Here two different cryptographic approaches based on DNA binary strands are shown. The first approach shows how DNA binary strands can be used for steganography, a technique of encryption by information hiding, to provide rapid encryption and decryption. It is shown that DNA steganography based on DNA binary strands is secure under the assumption that an interceptor has the same technological capabilities as sender and receiver of encrypted messages. The second approach shown here is based on steganography and a method of graphical subtraction of binary gel-images. It can be used to constitute a molecular checksum and can be combined with the first approach to support encryption. DNA cryptography might become of practical relevance in the context of labelling organic and inorganic materials with DNA 'barcodes'. PMID:10963862
Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
American Council on Education, Washington, DC.
Concerns of the National Security Agency (NSA) that information contained in some articles about cryptography in learned and professional journals and in monographs might be inimical to the national security are addressed. The Public Cryptography Study Group, with one dissenting opinion, recommends that a voluntary system of prior review of…
Arithmetic for Public-Key Cryptography
NASA Astrophysics Data System (ADS)
Sakiyama, Kazuo; Batina, Lejla
In this chapter, we discuss arithmetic algorithms used for implementing public-key cryptography (PKC). More precisely, we explore the various algorithms for RSA exponentiation and point/divisor multiplication for curve-based cryptography. The selection of the algorithms has a profound impact on the trade-off between cost, performance, and security. The goal of this chapter is to introduce the different recoding techniques to reduce the number of computations efficiently.
Eavesdropping without quantum memory
Bechmann-Pasquinucci, H.
2006-04-15
In quantum cryptography the optimal eavesdropping strategy requires that the eavesdropper uses ancillas and quantum memories in order to optimize her information. What happens if the eavesdropper has no quantum memory? It is shown that in this case the eavesdropper obtains a better information/disturbance trade-off by adopting the simple intercept/resend strategy.
Cryptographie quantique à variables continues
NASA Astrophysics Data System (ADS)
Bencheikh, K.; Jankovic, A.; Symul, T.; Levenson, J. A.
2002-06-01
Nous avons élaboré un protocole de cryptographie quantique qui permet de générer et de distribuer une clé secrète aléatoire. Le protocole repose sur l'utilisation de paires de champs électromagnétiques dont les quadratures présentent des corrélations quantiques de type Einstein-Podolsky-Rosen. Les fluctuations quantiques instantanése constituent les bits aléatoires de la clé secrète, et la dégradation irréversible des corrélations quantiques des quadratures causée par une tierce personne permet de la détecter et de garantir la sécurité d'échange.
Genetic attack on neural cryptography
Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido
2006-03-15
Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.
Quantum computing with trapped ions
Hughes, R.J.
1998-01-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Neural Network Approach to Locating Cryptography in Object Code
Jason L. Wright; Milos Manic
2009-09-01
Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.
Harry Potter and the Cryptography with Matrices
ERIC Educational Resources Information Center
Chua, Boon Liang
2006-01-01
This article describes Cryptography, defined as the science of encrypting and deciphering messages written in secret codes, it has played a vital role in securing information since ancient times. There are several cryptographic techniques and many make extensive use of mathematics to secure information. The author discusses an activity built…
Report on Pairing-based Cryptography
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435
Number Theory and Public-Key Cryptography.
ERIC Educational Resources Information Center
Lefton, Phyllis
1991-01-01
Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)
Report on Pairing-based Cryptography.
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST's position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435
Cryptography and the Internet: lessons and challenges
McCurley, K.S.
1996-12-31
The popularization of the Internet has brought fundamental changes to the world, because it allows a universal method of communication between computers. This carries enormous benefits with it, but also raises many security considerations. Cryptography is a fundamental technology used to provide security of computer networks, and there is currently a widespread engineering effort to incorporate cryptography into various aspects of the Internet. The system-level engineering required to provide security services for the Internet carries some important lessons for researchers whose study is focused on narrowly defined problems. It also offers challenges to the cryptographic research community by raising new questions not adequately addressed by the existing body of knowledge. This paper attempts to summarize some of these lessons and challenges for the cryptographic research community.
Asymmetric cryptography based on wavefront sensing
NASA Astrophysics Data System (ADS)
Peng, Xiang; Wei, Hengzheng; Zhang, Peng
2006-12-01
A system of asymmetric cryptography based on wavefront sensing (ACWS) is proposed for the first time to our knowledge. One of the most significant features of the asymmetric cryptography is that a trapdoor one-way function is required and constructed by analogy to wavefront sensing, in which the public key may be derived from optical parameters, such as the wavelength or the focal length, while the private key may be obtained from a kind of regular point array. The ciphertext is generated by the encoded wavefront and represented with an irregular array. In such an ACWS system, the encryption key is not identical to the decryption key, which is another important feature of an asymmetric cryptographic system. The processes of asymmetric encryption and decryption are formulized mathematically and demonstrated with a set of numerical experiments.
Asymmetric cryptography based on wavefront sensing.
Peng, Xiang; Wei, Hengzheng; Zhang, Peng
2006-12-15
A system of asymmetric cryptography based on wavefront sensing (ACWS) is proposed for the first time to our knowledge. One of the most significant features of the asymmetric cryptography is that a trapdoor one-way function is required and constructed by analogy to wavefront sensing, in which the public key may be derived from optical parameters, such as the wavelength or the focal length, while the private key may be obtained from a kind of regular point array. The ciphertext is generated by the encoded wavefront and represented with an irregular array. In such an ACWS system, the encryption key is not identical to the decryption key, which is another important feature of an asymmetric cryptographic system. The processes of asymmetric encryption and decryption are formulized mathematically and demonstrated with a set of numerical experiments. PMID:17130909
Nonequivalence of two flavors of oblivious transfer at the quantum level
He Guangping; Wang, Z. D.
2006-04-15
Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer due to the nature of quantum cryptography. Thus the securities of the two oblivious transfer protocols are not equivalent at the quantum level.
Device-independent two-party cryptography secure against sequential attacks
NASA Astrophysics Data System (ADS)
Kaniewski, Jędrzej; Wehner, Stephanie
2016-05-01
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication enables security for all of these problems in the noisy-storage model by sending more signals than the adversary can store in a certain time frame. Here, we initiate the study of device-independent (DI) protocols for two-party cryptography in the noisy-storage model. Specifically, we present a relatively easy to implement protocol for a cryptographic building block known as weak string erasure and prove its security even if the devices used in the protocol are prepared by the dishonest party. DI two-party cryptography is made challenging by the fact that Alice and Bob do not trust each other, which requires new techniques to establish security. We fully analyse the case of memoryless devices (for which sequential attacks are optimal) and the case of sequential attacks for arbitrary devices. The key ingredient of the proof, which might be of independent interest, is an explicit (and tight) relation between the violation of the Clauser–Horne–Shimony–Holt inequality observed by Alice and Bob and uncertainty generated by Alice against Bob who is forced to measure his system before finding out Alice’s setting (guessing with postmeasurement information). In particular, we show that security is possible for arbitrarily small violation.
Resource Letter QI-1: Quantum Information
NASA Astrophysics Data System (ADS)
Strauch, Frederick W.
2016-07-01
This Resource Letter surveys the history and modern developments in the field of quantum information. It is written to guide advanced undergraduates, beginning graduate students, and other new researchers to the theoretical and experimental aspects of this field. The topics covered include quantum states and processes, quantum coding and cryptography, quantum computation, the experimental implementation of quantum information processing, and the role of quantum information in the fundamental properties and foundations of physical theories.
Comparative Analysis of Cryptography Library in IoT
NASA Astrophysics Data System (ADS)
Kumar, Uday; Borgohain, Tuhin; Sanyal, Sugata
2015-05-01
The paper aims to do a survey along with a comparative analysis of the various cryptography libraries that are applicable in the field of Internet of Things (IoT). The first half of the paper briefly introduces the various cryptography libraries available in the field of cryptography along with a list of all the algorithms contained within the libraries. The second half of the paper deals with cryptography libraries specifically aimed for application in the field of Internet of Things. The various libraries and their performance analysis listed down in this paper are consolidated from various sources with the aim of providing a single comprehensive repository for reference to the various cryptography libraries and the comparative analysis of their features in IoT.
Quantum tagging for tags containing secret classical data
Kent, Adrian
2011-08-15
Various authors have considered schemes for quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is potentially unbounded. All of the schemes proposed elsewhere in the literature assume that the adversary is able to inspect the interior of the tagging device. All of these schemes have been shown to be breakable if the adversary has unbounded predistributed entanglement. We consider here the case in which the tagging device contains a finite key string shared with distant sites but kept secret from the adversary, and show this allows the location of the tagging device to be authenticated securely and indefinitely. Our protocol relies on quantum key distribution between the tagging device and at least one distant site, and demonstrates a new practical application of quantum key distribution. It also illustrates that the attainable security in position-based cryptography can depend crucially on apparently subtle details in the security scenario considered.
Comment on "Cheating prevention in visual cryptography".
Chen, Yu-Chi; Horng, Gwoboa; Tsai, Du-Shiau
2012-07-01
Visual cryptography (VC), proposed by Naor and Shamir, has numerous applications, including visual authentication and identification, steganography, and image encryption. In 2006, Horng showed that cheating is possible in VC, where some participants can deceive the remaining participants by forged transparencies. Since then, designing cheating-prevention visual secret-sharing (CPVSS) schemes has been studied by many researchers. In this paper, we cryptanalyze the Hu-Tzeng CPVSS scheme and show that it is not cheating immune. We also outline an improvement that helps to overcome the problem. PMID:22410333
Evaluation of correlation in optical encryption by using visual cryptography
NASA Astrophysics Data System (ADS)
Yi, Sang-Yi; Ryu, Chung-Sang; Ryu, Dae-Hyun; Lee, Seung-Hyun
2001-03-01
Visual cryptography made it possible to decrypt the information encrypted by thresholding scheme not with digital system but with human vision system. This method, however, has some limit in it because of the rack of resolution in both the spatial and amplitude domain. Optical visual cryptography, which used laser system instead of human eyesight, was proposed by conjunction of the optical theory with the cryptography. However, it also had some difficulties because it did not overcome the existing problem of visual cryptography completely. The problems occurred in the process of transferring data processing system from visual to optics. Therefore, it is appropriate to approach these problems in terms of optics. The results show that the optical visual cryptograph system has both the effectiveness and reliability as well as real-time implementation property.
Counterfactual attack on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Zhang, Sheng; Wnang, Jian; Tang, Chao Jing
2012-05-01
It is interesting that counterfactual quantum cryptography protocols allow two remotely separated parties to share a secret key without transmitting any signal particles. Generally, these protocols, expected to provide security advantages, base their security on a translated no-cloning theorem. Therefore, they potentially exhibit unconditional security in theory. In this letter, we propose a new Trojan horse attack, by which an eavesdropper Eve can gain full information about the key without being noticed, to real implementations of a counterfactual quantum cryptography system. Most importantly, the presented attack is available even if the system has negligible imperfections. Therefore, it shows that the present realization of counterfactual quantum key distribution is vulnerable.
Quantum walk public-key cryptographic system
NASA Astrophysics Data System (ADS)
Vlachou, C.; Rodrigues, J.; Mateus, P.; Paunković, N.; Souto, A.
2015-12-01
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 quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
Dynamic visual cryptography based on chaotic oscillations
NASA Astrophysics Data System (ADS)
Petrauskiene, Vilma; Palivonaite, Rita; Aleksa, Algiment; Ragulskis, Minvydas
2014-01-01
Dynamic visual cryptography scheme based on chaotic oscillations is proposed in this paper. Special computational algorithms are required for hiding the secret image in the cover moiré grating, but the decryption of the secret is completely visual. The secret image is leaked in the form of time-averaged geometric moiré fringes when the cover image is oscillated by a chaotic law. The relationship among the standard deviation of the stochastic time variable, the pitch of the moiré grating and the pixel size ensuring visual decryption of the secret is derived. The parameters of these chaotic oscillations must be carefully preselected before the secret image is leaked from the cover image. Several computational experiments are used to illustrate the functionality and the applicability of the proposed image hiding technique.
NASA Astrophysics Data System (ADS)
Hwang, Tzonelih; Luo, Yi-Ping; Yang, Chun-Wei; Lin, Tzu-Han
2014-04-01
This work proposes a new direction in quantum cryptography called quantum authencryption. Quantum authencryption (QA), a new term to distinguish from authenticated quantum secure direct communications, is used to describe the technique of combining quantum encryption and quantum authentication into one process for off-line communicants. QA provides a new way of quantum communications without the presence of a receiver on line, and thus makes many applications depending on secure one-way quantum communications, such as quantum E-mail systems, possible. An example protocol using single photons and one-way hash functions is presented to realize the requirements on QA.
Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach
NASA Astrophysics Data System (ADS)
Naik, R. Lalu; Reddy, P. Chenna
2015-12-01
The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.
Quantum Image Encryption and Decryption Algorithms Based on Quantum Image Geometric Transformations
NASA Astrophysics Data System (ADS)
Zhou, Ri-Gui; Wu, Qian; Zhang, Man-Qun; Shen, Chen-Yi
2013-06-01
Cryptography is the essential subject for network information security to protect important data. Although following the symmetric cryptosystem for which the participations in the communication keep exactly the same keys, the special for the encryption and decryption algorithms proposed in this paper lays in the operational objectives, the quantum image. Firstly, extracts the properties of gray-scale and position from the quantum gray-scale image which the storage expression of image in quantum states is achieved. Along with the geometric transformations in classical images, this article realizes the quantum image geometric transforms by means of designing quantum circuits. Eventually, through a combination of the proposals in previous, the encryption and decryption algorithms on quantum gray-scale images is finally accomplished, which could ensure the confidentiality and security of the information in delivery. The algorithms belong to the application of quantum image geometric transformations, for further, the new explorations for quantum image cryptography researches.
Efficient Quantum Pseudorandomness
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-04-01
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Efficient Quantum Pseudorandomness.
Brandão, Fernando G S L; Harrow, Aram W; Horodecki, Michał
2016-04-29
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics. PMID:27176509
Multilayer multicast key management with threshold cryptography
NASA Astrophysics Data System (ADS)
Dexter, Scott D.; Belostotskiy, Roman; Eskicioglu, Ahmet M.
2004-06-01
The problem of distributing multimedia securely over the Internet is often viewed as an instance of secure multicast communication, in which multicast messages are protected by a group key shared among the group of clients. One important class of key management schemes makes use of a hierarchical key distribution tree. Constructing a hierarchical tree based on secret shares rather than keys yields a scheme that is both more flexible and provably secure. Both the key-based and share-based hierarchical key distribution tree techniques are designed for managing keys for a single data stream. Recent work shows how redundancies that arise when this scheme is extended to multi-stream (e.g. scalable video) applications may be exploited in the key-based system by viewing the set of clients as a "multi-group". In this paper, we present results from an adaptation of a multi-group key management scheme using threshold cryptography. We describe how the multi-group scheme is adapted to work with secret shares, and compare this scheme with a naíve multi-stream key-management solution by measuring performance across several critical parameters, including tree degree, multi-group size, and number of shares stored at each node.
Optical scanning cryptography for secure wireless transmission
NASA Astrophysics Data System (ADS)
Poon, Ting-Chung; Kim, Taegeun; Doh, Kyu
2003-11-01
We propose a method for secure wireless transmission of encrypted information. By use of an encryption key, an image or document is optically encrypted by optical heterodyne scanning and hence encryption is performed on the fly. We call this technique optical scanning cryptography. The output of the heterodyne encrypted signal is at radio frequency and can be directly sent through an antenna to a secure site for digital storage to be prepared for decryption. In the secure site, an identical optical scanning system to that used for encryption is used, together with a decryption key, to generate an electrical signal. The electrical signal is then processed and sent to a computer to be used for decryption. Utilizing the stored information received from the encryption stage and the electrical information from the secure site, a digital decryption unit performs a decryption algorithm. If the encryption key and the decryption key are matched, the decryption unit will decrypt the image or document faithfully. The overall cryptosystem can perform the incoherent optical processing counterpart of the well-known coherent double-random phase-encoding technique. We present computer simulations of the idea.
Registration-tolerant extended visual cryptography
NASA Astrophysics Data System (ADS)
Nakajima, Mizuho; Yamaguchi, Yasushi
2003-06-01
Extended Visual Cryptography is a method which encodes a number of images so that when the images are superimposed, the hidden image appears without a trace of original images. The decryption is done directly by human eyes without cryptographic calculations. The proposing system takes three pictures as input and generates two images which correspond to two of the input pictures. The third picture is perceived by superimposing the two output images. Previous methods are based on halftoning and Boolean operations. Transparency values must be quantized before encryption, and a pixel is halftoned by a fixed numbers of completely transparent and opaque subpixels. Then a transparency of the superimposed pixel is controlled by changing the subpixel arrangements of the two output pixels. Since the subpixel arrangement is basically random, a tradeoff exists that to express the more graylevels, each subpixel must become the smaller, making it the more difficult to superimpose by hand. Our new approach tolerates registration error for the third image and eases the difficulty, by adopting concentric-circular subpixel arrangement and continuous grayscale subpixel values. The system becomes considerably robust to the registration error. Also, it achieves quality improvement for all three images, by explicitly dealing with continuous graylevels.
Optical scanning cryptography for secure wireless transmission.
Poon, Ting-Chung; Kim, Taegeun; Doh, Kyu
2003-11-10
We propose a method for secure wireless transmission of encrypted information. By use of an encryption key, an image or document is optically encrypted by optical heterodyne scanning and hence encryption is performed on the fly. We call this technique optical scanning cryptography. The output of the heterodyne encrypted signal is at radio frequency and can be directly sent through an antenna to a secure site for digital storage to be prepared for decryption. In the secure site, an identical optical scanning system to that used for encryption is used, together with a decryption key, to generate an electrical signal. The electrical signal is then processed and sent to a computer to be used for decryption. Utilizing the stored information received from the encryption stage and the electrical information from the secure site, a digital decryption unit performs a decryption algorithm. If the encryption key and the decryption key are matched, the decryption unit will decrypt the image or document faithfully. The overall cryptosystem can perform the incoherent optical processing counterpart of the well-known coherent double-random phase-encoding technique. We present computer simulations of the idea. PMID:14650492
Secure communications with low-orbit spacecraft using quantum cryptography
Hughes, Richard J.; Buttler, William T.; Kwiat, Paul G.; Luther, Gabriel G.; Morgan, George L; Nordholt, Jane E.; Peterson, Charles G.; Simmons, Charles M.
1999-01-01
Apparatus and method for secure communication between an earth station and spacecraft. A laser outputs single pulses that are split into preceding bright pulses and delayed attenuated pulses, and polarized. A Pockels cell changes the polarization of the polarized delayed attenuated pulses according to a string of random numbers, a first polarization representing a "1," and a second polarization representing a "0." At the receiving station, a beamsplitter randomly directs the preceding bright pulses and the polarized delayed attenuated pulses onto longer and shorter paths, both terminating in a beamsplitter which directs the preceding bright pulses and a first portion of the polarized delayed attenuated pulses to a first detector, and a second portion of the polarized delayed attenuated pulses to a second detector to generate a key for secure communication between the earth station and the spacecraft.
Optical visual cryptography based on the phase characteristics of spatial light modulator
NASA Astrophysics Data System (ADS)
Yi, Sang-Yi; Ryu, Chung-Sang; Lee, Seung-Hyun
2006-09-01
Optical visual cryptography based on binary computer generated hologram (BCGH) was proposed which used optics instead of human eyesight for decryption. As a result, it was possible to adapt cryptography to optical system. However, it also had some difficulties because it did not overcome the existing problem of visual cryptography completely. This paper suggested the method of optical cryptography implementation based on the phase modulation characteristics of liquid crystal display (LCD). The problems and appropriations are evaluated with some simulation. This system showed that the noise was reduced and resolution was improved compare with the conventional optical visual cryptography.
Implementation of Elliptic Curve Cryptography in Binary Field
NASA Astrophysics Data System (ADS)
Susantio, D. R.; Muchtadi-Alamsyah, I.
2016-04-01
Currently, there is a steadily increasing demand of information security, caused by a surge in information flow. There are many ways to create a secure information channel, one of which is to use cryptography. In this paper, we discuss the implementation of elliptic curves over the binary field for cryptography. We use the simplified version of the ECIES (Elliptic Curve Integrated Encryption Scheme). The ECIES encrypts a plaintext by masking the original message using specified points on the curve. The encryption process is done by separating the plaintext into blocks. Each block is then separately encrypted using the encryption scheme.
A halftone visual cryptography schema using ordered dither
NASA Astrophysics Data System (ADS)
Feng, Liu-Ping; Cong, Dong-Sheng; Liu, Hua-Qun; Wang, Meng-Min
2014-04-01
Visual cryptography is a cryptographic technique which allows visual information to be encrypted in such a way that the decryption can be performed by the human visual system, without the aid of computers. This paper proposes a schema of information hiding within the method of visual cryptography. The gray image is changed into two halftone images via the different dither matrixes respectively, and the secret binary pixels are encoded into shares. The secret information can be restored by stacking the different shared halftone images together. Simulation results show that the secret binary image can be decoded efficiently.
Visual cryptography based on optical interference encryption technique
NASA Astrophysics Data System (ADS)
Seo, Dong-Hoan; Kim, Jong-Yun; Lee, Sang-Su; Park, Se-Joon; Cho, Woong H.; Kim, Soo-Joong
2001-07-01
In this paper, we proposed a new visual cryptography scheme based on optical interference that can improve the contrast and signal to noise ratio of reconstructed images when compared to conventional visual cryptography methods. The binary image being encrypted is divided into any number of n slides. For encryption, randomly independent keys are generated along with another random key based on a XOR process of random keys. The XOR process between each divided image and each random key produces the encryption of n encrypted images. These encrypted images are then used to make encrypted binary phase masks. For decryption, the phase masks are placed on the paths of a Mach-Zehnder interferometer.
Securing resource constraints embedded devices using elliptic curve cryptography
NASA Astrophysics Data System (ADS)
Tam, Tony; Alfasi, Mohamed; Mozumdar, Mohammad
2014-06-01
The use of smart embedded device has been growing rapidly in recent time because of miniaturization of sensors and platforms. Securing data from these embedded devices is now become one of the core challenges both in industry and research community. Being embedded, these devices have tight constraints on resources such as power, computation, memory, etc. Hence it is very difficult to implement traditional Public Key Cryptography (PKC) into these resource constrained embedded devices. Moreover, most of the public key security protocols requires both public and private key to be generated together. In contrast with this, Identity Based Encryption (IBE), a public key cryptography protocol, allows a public key to be generated from an arbitrary string and the corresponding private key to be generated later on demand. While IBE has been actively studied and widely applied in cryptography research, conventional IBE primitives are also computationally demanding and cannot be efficiently implemented on embedded system. Simplified version of the identity based encryption has proven its competence in being robust and also satisfies tight budget of the embedded platform. In this paper, we describe the choice of several parameters for implementing lightweight IBE in resource constrained embedded sensor nodes. Our implementation of IBE is built using elliptic curve cryptography (ECC).
Enhancing Undergraduate Mathematics Curriculum via Coding Theory and Cryptography
ERIC Educational Resources Information Center
Aydin, Nuh
2009-01-01
The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the…
Information Divergence and Distance Measures for Quantum States
NASA Astrophysics Data System (ADS)
Jiang, Nan; Zhang, Zhaozhi
2015-02-01
Both information divergence and distance are measures of closeness of two quantum states which are widely used in the theory of information processing and quantum cryptography. For example, the quantum relative entropy and trace distance are well known. Here we introduce a number of new quantum information divergence and distance measures into the literature and discuss their relations and properties. We also propose a method to analyze the properties and relations of various distance and pseudo-distance measures.
Trojan horse attacks on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Du, Yungang; Wu, Lingan
2016-04-01
There has been much interest in "counterfactual quantum cryptography" (T.-G. Noh, 2009 [10]). It seems that the counterfactual quantum key distribution protocol without any photon carrier through the quantum channel provides practical security advantages. However, we show that it is easy to break counterfactual quantum key distribution systems in practical situations. We introduce the two types of Trojan horse attacks that are available for the two-way protocol and become possible for practical counterfactual systems with our eavesdropping schemes.
NASA Astrophysics Data System (ADS)
Le Gouët, Jean-Louis; Moiseev, Sergey
2012-06-01
quest for higher efficiency, better fidelity, broader bandwidth, multimode capacity and longer storage lifetime is pursued in all those approaches, as shown in this special issue. The improvement of quantum memory operation specifically requires in-depth study and control of numerous physical processes leading to atomic decoherence. The present issue reflects the development of rare earth ion doped matrices offering long lifetime superposition states, either as bulk crystals or as optical waveguides. The need for quantum sources and high efficiency detectors at the single photon level is also illustrated. Several papers address the networking of quantum memories either in long-haul cryptography or in the prospect of quantum processing. In this context, much attention has been paid recently to interfacing quantum light with superconducting qubits and with nitrogen-vacancy centers in diamond. Finally, the quantum interfacing of light with matter raises questions on entanglement. The last two papers are devoted to the generation of entanglement by dissipative processes. It is shown that long lifetime entanglement may be built in this way. We hope this special issue will help readers to become familiar with the exciting field of ensemble-based quantum memories and will stimulate them to bring deeper insights and new ideas to this area.
Counterfactual quantum certificate authorization
NASA Astrophysics Data System (ADS)
Shenoy H., Akshata; Srikanth, R.; Srinivas, T.
2014-05-01
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.
Two New Chaotic Cryptographies Based on Different Attractor-Partition Algorithms
NASA Astrophysics Data System (ADS)
Wang, Xingyuan; Liu, Ming; Gu, Nini
The paper analyses the limitation of Baptista cryptography in partitioning an attractor, and proposes two new attractor-partition methods: uniform-partition algorithm and dynamic-partition algorithm. They are different from the equal-interval-partition algorithm in Baptista cryptography, but dividing the attractor according to the attractor's natural invariant density and plaintext density, respectively. The comparative experiment indicates: the two new methods improve the unbalanced cryptograph distribution and cryptograph length in Baptista cryptography, they are also able to reduce the iteration time in chaotic systems effectively, which has improved decryption time and cryptographies' security.
Electronic Voting Protocol Using Identity-Based Cryptography.
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. PMID:26090515
Electronic Voting Protocol Using Identity-Based Cryptography
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. PMID:26090515
Digital Cryptography and Feedback Synchronization of Chaotic Systems
NASA Astrophysics Data System (ADS)
Mitra, Mala; Banerjee, Santo
Secure communications via chaotic synchronization is demonstrated in this literature. At first we have designed a feedback controller for chaotic synchronization utilizing the Lyapunov stability theory for cascade-connected systems.The method has been applied successfully to make two identical systems globally asymptotically synchronized. The result of numerical simulations are given to validate the effectiveness of this method. Then we have discussed a new method of cryptography for this coupled system which is very simple to implement and effective.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-01-01
Here, quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness — coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.
Practical quantum retrieval games
NASA Astrophysics Data System (ADS)
Arrazola, Juan Miguel; Karasamanis, Markos; Lütkenhaus, Norbert
2016-06-01
Complex cryptographic protocols are often constructed from simpler building blocks. In order to advance quantum cryptography, it is important to study practical building blocks that can be used to develop new protocols. An example is quantum retrieval games (QRGs), which have broad applicability and have already been used to construct quantum money schemes. In this work, we introduce a general construction of quantum retrieval games based on the hidden matching problem and show how they can be implemented in practice using available technology. More precisely, we provide a general method to construct (1-out-of-k ) QRGs, proving that their cheating probabilities decrease exponentially in k . In particular, we define QRGs based on coherent states of light, which can be implemented even in the presence of experimental imperfections. Our results constitute a tool in the arsenal of the practical quantum cryptographer.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-06-28
Here, quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness -- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at amore » high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.« less
Fast, Parallel and Secure Cryptography Algorithm Using Lorenz's Attractor
NASA Astrophysics Data System (ADS)
Marco, Anderson Gonçalves; Martinez, Alexandre Souto; Bruno, Odemir Martinez
A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.
Measurement-device-independent quantum key distribution.
Lo, Hoi-Kwong; Curty, Marcos; Qi, Bing
2012-03-30
How to remove detector side channel attacks has been a notoriously hard problem in quantum cryptography. Here, we propose a simple solution to this problem--measurement-device-independent quantum key distribution (QKD). It not only removes all detector side channels, but also doubles the secure distance with conventional lasers. Our proposal can be implemented with standard optical components with low detection efficiency and highly lossy channels. In contrast to the previous solution of full device independent QKD, the realization of our idea does not require detectors of near unity detection efficiency in combination with a qubit amplifier (based on teleportation) or a quantum nondemolition measurement of the number of photons in a pulse. Furthermore, its key generation rate is many orders of magnitude higher than that based on full device independent QKD. The results show that long-distance quantum cryptography over say 200 km will remain secure even with seriously flawed detectors. PMID:22540686
A library for prototyping the computer arithmetic level in elliptic curve cryptography
NASA Astrophysics Data System (ADS)
Imbert, Laurent; Peirera, Agostinho; Tisserand, Arnaud
2007-09-01
This paper presents the first version of a software library called PACE ("Prototyping Arithmetic in Cryptography Easily"). This is a C++ library under LGPL license. It provides number systems and algorithms for prototyping the arithmetic layer in cryptographic applications. The first version of PACE includes basic support of prime finite fields and ECC (Elliptic Curve Cryptography) basic algorithms for software implementations.
Fully Distrustful Quantum Bit Commitment and Coin Flipping
NASA Astrophysics Data System (ADS)
Silman, J.; Chailloux, A.; Aharon, N.; Kerenidis, I.; Pironio, S.; Massar, S.
2011-06-01
In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them “fully” distrustful. In this Letter, we show that for bit commitment—one of the most basic primitives within the model—the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice’s and Bob’s cheating probabilities are ≃0.854 and (3)/(4), which we then use to construct a device-independent coin flipping protocol with bias ≲0.336.
Remapping the quantum frontier
NASA Astrophysics Data System (ADS)
Monroe, Christopher; Lukin, Mikhail
2008-08-01
In 1994 the mathematician Peter Shor, then working at AT&T Bell Laboratories in the US, applied quantum mechanics to an age-old problem in number theory and made a remarkable discovery. He showed that a computer that operates on and processes quantum systems could factor large integers exponentially faster than a conventional computer. This result attracted a lot of attention because the difficulty of factoring large numbers is what ensures the security of modern cryptography schemes - even the best conventional computer would take several thousand years to factor a number with more than about 150 digits. Shor's quantum factoring algorithm could, in principle, break such encryption standards - a possibility that led to an explosion of interest in quantum information science. Until then it was a field that had largely been a mere curiosity, despite notable contributions from the likes of Richard Feynman and David Deutsch.
An application of different dioids in public key cryptography
Durcheva, Mariana I.
2014-11-18
Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.
Novel optical scanning cryptography using Fresnel telescope imaging.
Yan, Aimin; Sun, Jianfeng; Hu, Zhijuan; Zhang, Jingtao; Liu, Liren
2015-07-13
We propose a new method called modified optical scanning cryptography using Fresnel telescope imaging technique for encryption and decryption of remote objects. An image or object can be optically encrypted on the fly by Fresnel telescope scanning system together with an encryption key. For image decryption, the encrypted signals are received and processed with an optical coherent heterodyne detection system. The proposed method has strong performance through use of secure Fresnel telescope scanning with orthogonal polarized beams and efficient all-optical information processing. The validity of the proposed method is demonstrated by numerical simulations and experimental results. PMID:26191901
Fourier-based automatic alignment for improved Visual Cryptography schemes.
Machizaud, Jacques; Chavel, Pierre; Fournel, Thierry
2011-11-01
In Visual Cryptography, several images, called "shadow images", that separately contain no information, are overlapped to reveal a shared secret message. We develop a method to digitally register one printed shadow image acquired by a camera with a purely digital shadow image, stored in memory. Using Fourier techniques derived from Fourier Optics concepts, the idea is to enhance and exploit the quasi periodicity of the shadow images, composed by a random distribution of black and white patterns on a periodic sampling grid. The advantage is to speed up the security control or the access time to the message, in particular in the cases of a small pixel size or of large numbers of pixels. Furthermore, the interest of visual cryptography can be increased by embedding the initial message in two shadow images that do not have identical mathematical supports, making manual registration impractical. Experimental results demonstrate the successful operation of the method, including the possibility to directly project the result onto the printed shadow image. PMID:22109152
Secure satellite communication using multi-photon tolerant quantum communication protocol
NASA Astrophysics Data System (ADS)
Darunkar, Bhagyashri; Punekar, Nikhil; Verma, Pramode K.
2015-09-01
This paper proposes and analyzes the potential of a multi-photon tolerant quantum communication protocol to secure satellite communication. For securing satellite communication, quantum cryptography is the only known unconditionally secure method. A number of recent experiments have shown feasibility of satellite-aided global quantum key distribution (QKD) using different methods such as: Use of entangled photon pairs, decoy state methods, and entanglement swapping. The use of single photon in these methods restricts the distance and speed over which quantum cryptography can be applied. Contemporary quantum cryptography protocols like the BB84 and its variants suffer from the limitation of reaching the distances of only Low Earth Orbit (LEO) at the data rates of few kilobits per second. This makes it impossible to develop a general satellite-based secure global communication network using the existing protocols. The method proposed in this paper allows secure communication at the heights of the Medium Earth Orbit (MEO) and Geosynchronous Earth Orbit (GEO) satellites. The benefits of the proposed method are two-fold: First it enables the realization of a secure global communication network based on satellites and second it provides unconditional security for satellite networks at GEO heights. The multi-photon approach discussed in this paper ameliorates the distance and speed issues associated with quantum cryptography through the use of contemporary laser communication (lasercom) devices. This approach can be seen as a step ahead towards global quantum communication.
Quantum Oblivious Transfer Based on a Quantum Symmetrically Private Information Retrieval Protocol
NASA Astrophysics Data System (ADS)
Yang, Yu-Guang; Sun, Si-Jia; Wang, Yan
2015-03-01
Private information retrieval implies oblivious transfer in classical cryptography. Following this clue, we present a novel quantum one-out-of-two OT protocol based on a practical quantum symmetrically private information retrieval protocol Jakobi et al. (Phys. Rev. A 83, 022301 2011), with changes only in the classical postprocessing of the key. While unconditionally secure oblivious transfer is known to be impossible, we argue that an interesting degree of security can be achieved by means of quantum physical principles instead of unproven security assumptions in order to protect both the sender and the receiver. The proposed OT protocol is loss tolerant, practical and robust against quantum memory attack.
Quantum proxy signature scheme with public verifiability
NASA Astrophysics Data System (ADS)
Zhou, Jingxian; Zhou, Yajian; Niu, Xinxin; Yang, Yixian
2011-10-01
In recent years, with the development of quantum cryptography, quantum signature has also made great achievement. However, the effectiveness of all the quantum signature schemes reported in the literature can only be verified by a designated person. Therefore, its wide applications are limited. For solving this problem, a new quantum proxy signature scheme using EPR quantum entanglement state and unitary transformation to generate proxy signature is presented. Proxy signer announces his public key when he generates the final signature. According to the property of unitary transformation and quantum one-way function, everyone can verify whether the signature is effective or not by the public key. So the quantum proxy signature scheme in our paper can be public verified. The quantum key distribution and one-time pad encryption algorithm guarantee the unconditional security of this scheme. Analysis results show that this new scheme satisfies strong non-counterfeit and strong non-disavowal.
Reliable Freestanding Position-Based Routing in Highway Scenarios
Galaviz-Mosqueda, Gabriel A.; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur
2012-01-01
Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159
Reliable freestanding position-based routing in highway scenarios.
Galaviz-Mosqueda, Gabriel A; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur
2012-01-01
Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159
Implementing Diffie-Hellman key exchange using quantum EPR pairs
NASA Astrophysics Data System (ADS)
Mandal, Sayonnha; Parakh, Abhishek
2015-05-01
This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.
Image communication scheme based on dynamic visual cryptography and computer generated holography
NASA Astrophysics Data System (ADS)
Palevicius, Paulius; Ragulskis, Minvydas
2015-01-01
Computer generated holograms are often exploited to implement optical encryption schemes. This paper proposes the integration of dynamic visual cryptography (an optical technique based on the interplay of visual cryptography and time-averaging geometric moiré) with Gerchberg-Saxton algorithm. A stochastic moiré grating is used to embed the secret into a single cover image. The secret can be visually decoded by a naked eye if only the amplitude of harmonic oscillations corresponds to an accurately preselected value. The proposed visual image encryption scheme is based on computer generated holography, optical time-averaging moiré and principles of dynamic visual cryptography. Dynamic visual cryptography is used both for the initial encryption of the secret image and for the final decryption. Phase data of the encrypted image are computed by using Gerchberg-Saxton algorithm. The optical image is decrypted using the computationally reconstructed field of amplitudes.
Cryptanalysis and security enhancement of optical cryptography based on computational ghost imaging
NASA Astrophysics Data System (ADS)
Yuan, Sheng; Yao, Jianbin; Liu, Xuemei; Zhou, Xin; Li, Zhongyang
2016-04-01
Optical cryptography based on computational ghost imaging (CGI) has attracted much attention of researchers because it encrypts plaintext into a random intensity vector rather than complexed-valued function. This promising feature of the CGI-based cryptography reduces the amount of data to be transmitted and stored and therefore brings convenience in practice. However, we find that this cryptography is vulnerable to chosen-plaintext attack because of the linear relationship between the input and output of the encryption system, and three feasible strategies are proposed to break it in this paper. Even though a large number of plaintexts need to be chosen in these attack methods, it means that this cryptography still exists security risks. To avoid these attacks, a security enhancement method utilizing an invertible matrix modulation is further discussed and the feasibility is verified by numerical simulations.
Novel Quantum Proxy Signature without Entanglement
NASA Astrophysics Data System (ADS)
Xu, Guang-bao
2015-08-01
Proxy signature is an important research topic in classic cryptography since it has many application occasions in our real life. But only a few quantum proxy signature schemes have been proposed up to now. In this paper, we propose a quantum proxy signature scheme, which is designed based on quantum one-time pad. Our scheme can be realized easily since it only uses single-particle states. Security analysis shows that it is secure and meets all the properties of a proxy signature, such as verifiability, distinguishability, unforgeability and undeniability.
Quantum Information with Structured Light
NASA Astrophysics Data System (ADS)
Mirhosseini, Mohammad
Quantum information science promises dramatic progress in a variety of fields such as cryptography, computation, and metrology. Although the proof-of-principle attempts for implementing quantum protocols have often relied on only a few qubits, the utilization of more sophisticated quantum systems is required for practical applications. In this thesis, we investigate the emerging role of high-dimensional optical states as a resource for encoding quantum information. We begin the first chapter with a review of orbital angular momentum (OAM) as a prime candidate for realizing multilevel quantum states and follow with a brief introduction to the quantum measurement theory. The second and the third chapters are dedicated to the application of OAM modes in quantum cryptography. In the second chapter, we discuss the challenges of projective measurement of OAM at the single-photon level, a crucial task required for quantum information processing. We then present our development of an efficient and accurate mode-sorting device that is capable of projectively measuring the orbital angular momentum of single photons. In the third chapter, we discuss the role of OAM modes in increasing the information capacity of quantum cryptography. We start this chapter by establishing the merits of encoding information on the quantum index of OAM modes in a free-space link. We then generalizing the BB-84 QKD protocol to the Hilbert space spanned by a finite number of OAM modes and outline our experimental realization. The last two chapters are dedicated to the tomography of structured light fields. We start the fourth chapter by applying the recently found method of direct measurement to the characterization of OAM superpositions. We find the quantum state in the Hilbert space spanned by 27 OAM modes by performing a weak measurement of orbital angular momentum (OAM) followed by a strong measurement of azimuthal angle. We then introduce the concept of compressive direct measurement (CDM
Optimal architectures for long distance quantum communication
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D.; Jiang, Liang
2016-01-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances. PMID:26876670
Prospects for quantum computation with trapped ions
Hughes, R.J.; James, D.F.V.
1997-12-31
Over the past decade information theory has been generalized to allow binary data to be represented by two-state quantum mechanical systems. (A single two-level system has come to be known as a qubit in this context.) The additional freedom introduced into information physics with quantum systems has opened up a variety of capabilities that go well beyond those of conventional information. For example, quantum cryptography allows two parties to generate a secret key even in the presence of eavesdropping. But perhaps the most remarkable capabilities have been predicted in the field of quantum computation. Here, a brief survey of the requirements for quantum computational hardware, and an overview of the in trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.
Optimal architectures for long distance quantum communication.
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D; Jiang, Liang
2016-01-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥ 1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances. PMID:26876670
Authentication Protocol using Quantum Superposition States
Kanamori, Yoshito; Yoo, Seong-Moo; Gregory, Don A.; Sheldon, Frederick T
2009-01-01
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.
Optimal architectures for long distance quantum communication
NASA Astrophysics Data System (ADS)
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D.; Jiang, Liang
2016-02-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.
Security of quantum key distribution with entangled qutrits
Durt, Thomas; Cerf, Nicolas J.; Gisin, Nicolas; Zukowski, Marek
2003-01-01
The study of quantum cryptography and quantum entanglement have traditionally been based on two-level quantum systems (qubits). In this paper, we consider a generalization of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by three-level systems (qutrits). In order to investigate the security against the optimal individual attack, we derive the information gained by a potential eavesdropper applying a cloning-based attack. We exhibit the explicit form of this cloner, which is distinct from the previously known cloners, and conclude that the protocol is more robust than those based on entangled qubits as well as unentangled qutrits.
A public-key cryptosystem for quantum message transmission
NASA Astrophysics Data System (ADS)
Yang, Li
2005-01-01
We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.
Secure self-calibrating quantum random-bit generator
Fiorentino, M.; Santori, C.; Spillane, S. M.; Beausoleil, R. G.; Munro, W. J.
2007-03-15
Random-bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require 'strong' RBGs that produce high-entropy bit sequences, but traditional software pseudo-RBGs have very low entropy content and therefore are relatively weak for cryptography. Hardware RBGs yield entropy from chaotic or quantum physical systems and therefore are expected to exhibit high entropy, but in current implementations their exact entropy content is unknown. Here we report a quantum random-bit generator (QRBG) that harvests entropy by measuring single-photon and entangled two-photon polarization states. We introduce and implement a quantum tomographic method to measure a lower bound on the 'min-entropy' of the system, and we employ this value to distill a truly random-bit sequence. This approach is secure: even if an attacker takes control of the source of optical states, a secure random sequence can be distilled.
Observable measure of quantum coherence in finite dimensional systems.
Girolami, Davide
2014-10-24
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology, and cryptography. Yet, there is no universally efficient method for quantifying coherence either in theoretical or in experimental practice. I introduce a framework for measuring quantum coherence in finite dimensional systems. I define a theoretical measure which satisfies the reliability criteria established in the context of quantum resource theories. Then, I present an experimental scheme implementable with current technology which evaluates the quantum coherence of an unknown state of a d-dimensional system by performing two programmable measurements on an ancillary qubit, in place of the O(d2) direct measurements required by full state reconstruction. The result yields a benchmark for monitoring quantum effects in complex systems, e.g., certifying nonclassicality in quantum protocols and probing the quantum behavior of biological complexes. PMID:25379903
Approach to design neural cryptography: A generalized architecture and a heuristic rule
NASA Astrophysics Data System (ADS)
Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen
2013-06-01
Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.
Adaptive and distributed cryptography for signature biometrics protection
NASA Astrophysics Data System (ADS)
Campisi, Patrizio; Maiorana, Emanuele; Gonzalez Prats, Miguel; Neri, Alessandro
2007-02-01
The most emerging technology for people identification and authentication is biometrics. In contrast with traditional recognition approaches, biometric authentication relies on who a person is or what a person does, being based on strictly personal traits, much more difficult to be forgotten, lost, stolen, copied or forged than traditional data. In this paper, we focus on two vulnerable points of biometric systems: the database where the templates are stored and the communication channel between the stored templates and the matcher. Specifically, we propose a method, based on user adaptive error correction codes, to achieve securitization and cancelability of the stored templates applied to dynamic signature features. More in detail, the employed error correction code is tailored to the intra-class variability of each user's signature features. This leads to an enhancement of the system performance expressed in terms of false acceptance rate. Moreover, in order to avoid corruption or interception of the stored templates in the transmission channels, we propose a scheme based on threshold cryptography: the distribution of the certificate authority functionality among a number of nodes provides distributed, fault-tolerant, and hierarchical key management services. Experimental results show the effectiveness of our approach, when compared to traditional non-secure correlation-based classifiers.
Signed Decomposition Method for Scalar Multiplication in Elliptic Curve Cryptography
NASA Astrophysics Data System (ADS)
Said, M. R. M.; Mohamed, M. A.; Atan, K. A. Mohd; Zulkarnain, Z. Ahmad
2010-11-01
Addition chain is the solution to computability constraint of the problematic large number arithmetic. In elliptic curve cryptography, a point arithmetic on elliptic curve can be reduced to repetitive addition and doubling operations. Based on this idea, various methods were proposed, lately a decomposition method based on prime decomposition was put forward. This method uses a pre-generated set of rules to calculate an addition chain for n. Though the method shows it own advantage over others in some cases, but some improvements is still avail. We develop an enhancement version called signed decomposition method which takes rule from decomposition method as an input. We also generalize the idea of a prime rule to an integer rule. An improvement is done to the original add rule in decomposition method by allowing subtraction operation to terms. In so doing, we optimize the original form of add rule. The result shows not only an improvement over decomposition method but also become an all time superior compare to preceeding methods. Furthermore, having secret key in a form of rule will put up extra security to the message under communication.
Virtual microscopy and public-key cryptography for Internet telepathology.
Strauss, J S; Felten, C L; Okada, D H; Marchevsky, A M
1999-01-01
The Internet is a potentially inexpensive, widely available medium for telepathology, but there are concerns about its reliability and security. Using a digital camera, 41 photomicrographs of transbronchial biopsies, at x 100 optical magnification, were captured and digitized at 2700 x 3400 pixel, 24 bit/pixel resolution. The image files were saved in JPEG format at medium compression, attached to text files with patient information, encrypted for security in the S/MIME format using a digital signature and digital envelope, and transmitted by email. Received email files were decrypted automatically and the images viewed with standard software. Telepathology diagnoses were compared with original interpretations. The images averaged 810 kByte in size. The encryption and decryption did not cause significant delays in overall transmission time and, together with transmission, did not produce noticeable image degradation. The received image files could be viewed in a manner that simulated light microscopy. There was agreement between telepathology and original diagnoses in 92% of the cases. All the discrepancies were due to inadequate area selection because the pathological features of interest were present in histological levels other than those photographed. The use of high-resolution digital photomicrography, the Internet and public-key cryptography offers an effective and relatively inexpensive method of telepathology consultation. The method is best suited for the diagnosis of small biopsy specimens that require the transmission of only a few digital images that represent the majority of the biopsy materials. PMID:10628020
Quantum technology and cryptology for information security
NASA Astrophysics Data System (ADS)
Naqvi, Syed; Riguidel, Michel
2007-04-01
Cryptology and information security are set to play a more prominent role in the near future. In this regard, quantum communication and cryptography offer new opportunities to tackle ICT security. Quantum Information Processing and Communication (QIPC) is a scientific field where new conceptual foundations and techniques are being developed. They promise to play an important role in the future of information Security. It is therefore essential to have a cross-fertilizing development between quantum technology and cryptology in order to address the security challenges of the emerging quantum era. In this article, we discuss the impact of quantum technology on the current as well as future crypto-techniques. We then analyse the assumptions on which quantum computers may operate. Then we present our vision for the distribution of security attributes using a novel form of trust based on Heisenberg's uncertainty; and, building highly secure quantum networks based on the clear transmission of single photons and/or bundles of photons able to withstand unauthorized reading as a result of secure protocols based on the observations of quantum mechanics. We argue how quantum cryptographic systems need to be developed that can take advantage of the laws of physics to provide long-term security based on solid assumptions. This requires a structured integration effort to deploy quantum technologies within the existing security infrastructure. Finally, we conclude that classical cryptographic techniques need to be redesigned and upgraded in view of the growing threat of cryptanalytic attacks posed by quantum information processing devices leading to the development of post-quantum cryptography.
Information security: from classical to quantum
NASA Astrophysics Data System (ADS)
Barnett, Stephen M.; Brougham, Thomas
2012-09-01
Quantum cryptography was designed to provide a new approach to the problem of distributing keys for private-key cryptography. The principal idea is that security can be ensured by exploiting the laws of quantum physics and, in particular, by the fact that any attempt to measure a quantum state will change it uncontrollably. This change can be detected by the legitimate users of the communication channel and so reveal to them the presence of an eavesdropper. In this paper I explain (briefly) how quantum key distribution works and some of the progress that has been made towards making this a viable technology. With the principles of quantum communication and quantum key distribution firmly established, it is perhaps time to consider how efficient it can be made. It is interesting to ask, in particular, how many bits of information might reasonably be encoded securely on each photon. The use of photons entangled in their time of arrival might make it possible to achieve data rates in excess of 10 bits per photon.
Entangled states in quantum mechanics
NASA Astrophysics Data System (ADS)
Ruža, Jānis
2010-01-01
In some circles of quantum physicists, a view is maintained that the nonseparability of quantum systems-i.e., the entanglement-is a characteristic feature of quantum mechanics. According to this view, the entanglement plays a crucial role in the solution of quantum measurement problem, the origin of the “classicality” from the quantum physics, the explanation of the EPR paradox by a nonlocal character of the quantum world. Besides, the entanglement is regarded as a cornerstone of such modern disciplines as quantum computation, quantum cryptography, quantum information, etc. At the same time, entangled states are well known and widely used in various physics areas. In particular, this notion is widely used in nuclear, atomic, molecular, solid state physics, in scattering and decay theories as well as in other disciplines, where one has to deal with many-body quantum systems. One of the methods, how to construct the basis states of a composite many-body quantum system, is the so-called genealogical decomposition method. Genealogical decomposition allows one to construct recurrently by particle number the basis states of a composite quantum system from the basis states of its forming subsystems. These coupled states have a structure typical for entangled states. If a composite system is stable, the internal structure of its forming basis states does not manifest itself in measurements. However, if a composite system is unstable and decays onto its forming subsystems, then the measurables are the quantum numbers, associated with these subsystems. In such a case, the entangled state has a dynamical origin, determined by the Hamiltonian of the corresponding decay process. Possible correlations between the quantum numbers of resulting subsystems are determined by the symmetries-conservation laws of corresponding dynamical variables, and not by the quantum entanglement feature.
Network-Centric Quantum Communications
NASA Astrophysics Data System (ADS)
Hughes, Richard
2014-03-01
Single-photon quantum communications (QC) offers ``future-proof'' cryptographic security rooted in the laws of physics. Today's quantum-secured communications cannot be compromised by unanticipated future technological advances. But to date, QC has only existed in point-to-point instantiations that have limited ability to address the cyber security challenges of our increasingly networked world. In my talk I will describe a fundamentally new paradigm of network-centric quantum communications (NQC) that leverages the network to bring scalable, QC-based security to user groups that may have no direct user-to-user QC connectivity. With QC links only between each of N users and a trusted network node, NQC brings quantum security to N2 user pairs, and to multi-user groups. I will describe a novel integrated photonics quantum smartcard (``QKarD'') and its operation in a multi-node NQC test bed. The QKarDs are used to implement the quantum cryptographic protocols of quantum identification, quantum key distribution and quantum secret splitting. I will explain how these cryptographic primitives are used to provide key management for encryption, authentication, and non-repudiation for user-to-user communications. My talk will conclude with a description of a recent demonstration that QC can meet both the security and quality-of-service (latency) requirements for electric grid control commands and data. These requirements cannot be met simultaneously with present-day cryptography.
Quantum cloning disturbed by thermal Davies environment
NASA Astrophysics Data System (ADS)
Dajka, Jerzy; Łuczka, Jerzy
2016-03-01
A network of quantum gates designed to implement universal quantum cloning machine is studied. We analyze how thermal environment coupled to auxiliary qubits, `blank paper' and `toner' required at the preparation stage of copying, modifies an output fidelity of the cloner. Thermal environment is described in terms of the Markovian Davies theory. We show that such a cloning machine is not universal any more but its output is independent of at least a part of parameters of the environment. As a case study, we consider cloning of states in a six-state cryptography's protocol. We also briefly discuss cloning of arbitrary input states.
Secret sharing based on quantum Fourier transform
NASA Astrophysics Data System (ADS)
Yang, Wei; Huang, Liusheng; Shi, Runhua; He, Libao
2013-07-01
Secret sharing plays a fundamental role in both secure multi-party computation and modern cryptography. We present a new quantum secret sharing scheme based on quantum Fourier transform. This scheme enjoys the property that each share of a secret is disguised with true randomness, rather than classical pseudorandomness. Moreover, under the only assumption that a top priority for all participants (secret sharers and recovers) is to obtain the right result, our scheme is able to achieve provable security against a computationally unbounded attacker.
Quantum cloning disturbed by thermal Davies environment
NASA Astrophysics Data System (ADS)
Dajka, Jerzy; Łuczka, Jerzy
2016-06-01
A network of quantum gates designed to implement universal quantum cloning machine is studied. We analyze how thermal environment coupled to auxiliary qubits, `blank paper' and `toner' required at the preparation stage of copying, modifies an output fidelity of the cloner. Thermal environment is described in terms of the Markovian Davies theory. We show that such a cloning machine is not universal any more but its output is independent of at least a part of parameters of the environment. As a case study, we consider cloning of states in a six-state cryptography's protocol. We also briefly discuss cloning of arbitrary input states.
NASA Astrophysics Data System (ADS)
Zhang, KeJia; Zhang, Long; Song, TingTing; Yang, YingHui
2016-06-01
In this paper, we propose certain different design ideas on a novel topic in quantum cryptography — quantum operation sharing (QOS). Following these unique ideas, three QOS schemes, the "HIEC" (The scheme whose messages are hidden in the entanglement correlation), "HIAO" (The scheme whose messages are hidden with the assistant operations) and "HIMB" (The scheme whose messages are hidden in the selected measurement basis), have been presented to share the single-qubit operations determinately on target states in a remote node. These schemes only require Bell states as quantum resources. Therefore, they can be directly applied in quantum networks, since Bell states are considered the basic quantum channels in quantum networks. Furthermore, after analyse on the security and resource consumptions, the task of QOS can be achieved securely and effectively in these schemes.
Uncertainty characteristics of generalized quantum measurements
NASA Astrophysics Data System (ADS)
Hofmann, Holger F.
2003-02-01
The effects of any quantum measurement can be described by a collection of measurement operators {Mm} acting on the quantum state of the measured system. However, the Hilbert space formalism tends to obscure the relationship between the measurement results and the physical properties of the measured system. In this paper, a characterization of measurement operators in terms of measurement resolution and disturbance is developed. It is then possible to formulate uncertainty relations for the measurement process that are valid for arbitrary input states. The motivation of these concepts is explained from a quantum communication viewpoint. It is shown that the intuitive interpretation of uncertainty as a relation between measurement resolution and disturbance provides a valid description of measurement back action. Possible applications to quantum cryptography, quantum cloning, and teleportation are discussed.
Teleporting photonic qudits using multimode quantum scissors
NASA Astrophysics Data System (ADS)
Goyal, Sandeep K.; Konrad, Thomas
2013-12-01
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a ``qudit'') by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of ``quantum scissors'' they are converted back into a qudit carried by a single photon which completes the teleportation scheme.
Teleporting photonic qudits using multimode quantum scissors.
Goyal, Sandeep K; Konrad, Thomas
2013-01-01
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a "qudit") by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of "quantum scissors" they are converted back into a qudit carried by a single photon which completes the teleportation scheme. PMID:24352610
Quantum rewinding via phase estimation
NASA Astrophysics Data System (ADS)
Tabia, Gelo Noel
2015-03-01
In cryptography, the notion of a zero-knowledge proof was introduced by Goldwasser, Micali, and Rackoff. An interactive proof system is said to be zero-knowledge if any verifier interacting with an honest prover learns nothing beyond the validity of the statement being proven. With recent advances in quantum information technologies, it has become interesting to ask if classical zero-knowledge proof systems remain secure against adversaries with quantum computers. The standard approach to show the zero-knowledge property involves constructing a simulator for a malicious verifier that can be rewinded to a previous step when the simulation fails. In the quantum setting, the simulator can be described by a quantum circuit that takes an arbitrary quantum state as auxiliary input but rewinding becomes a nontrivial issue. Watrous proposed a quantum rewinding technique in the case where the simulation's success probability is independent of the auxiliary input. Here I present a more general quantum rewinding scheme that employs the quantum phase estimation algorithm. This work was funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.
Entanglement purification for quantum communication
NASA Astrophysics Data System (ADS)
Pan, Jian-Wei; Simon, Christoph; Brukner, Časlav; Zeilinger, Anton
2001-04-01
The distribution of entangled states between distant locations will be essential for the future large-scale realization of quantum communication schemes such as quantum cryptography and quantum teleportation. Because of unavoidable noise in the quantum communication channel, the entanglement between two particles is more and more degraded the further they propagate. Entanglement purification is thus essential to distil highly entangled states from less entangled ones. Existing general purification protocols are based on the quantum controlled-NOT (CNOT) or similar quantum logic operations, which are very difficult to implement experimentally. Present realizations of CNOT gates are much too imperfect to be useful for long-distance quantum communication. Here we present a scheme for the entanglement purification of general mixed entangled states, which achieves 50 per cent of the success probability of schemes based on the CNOT operation, but requires only simple linear optical elements. Because the perfection of such elements is very high, the local operations necessary for purification can be performed with the required precision. Our procedure is within the reach of current technology, and should significantly simplify the implementation of long-distance quantum communication.
Entanglement purification for quantum communication.
Pan, J W; Simon, C; Brukner, C; Zeilinger, A
2001-04-26
The distribution of entangled states between distant locations will be essential for the future large-scale realization of quantum communication schemes such as quantum cryptography and quantum teleportation. Because of unavoidable noise in the quantum communication channel, the entanglement between two particles is more and more degraded the further they propagate. Entanglement purification is thus essential to distil highly entangled states from less entangled ones. Existing general purification protocols are based on the quantum controlled-NOT (CNOT) or similar quantum logic operations, which are very difficult to implement experimentally. Present realizations of CNOT gates are much too imperfect to be useful for long-distance quantum communication. Here we present a scheme for the entanglement purification of general mixed entangled states, which achieves 50 per cent of the success probability of schemes based on the CNOT operation, but requires only simple linear optical elements. Because the perfection of such elements is very high, the local operations necessary for purification can be performed with the required precision. Our procedure is within the reach of current technology, and should significantly simplify the implementation of long-distance quantum communication. PMID:11323664
Bank Transfer Over Quantum Channel With Digital Checks
Kanamori, Yoshito; Yoo, Seong-Moo; Sheldon, Frederick T
2006-01-01
In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distributions) as practical applications. In this paper, we propose a bank transfer (i.e., funds or Electronic Funds Transfer) system utilizing both classical and quantum cryptography to provide theoretically unbreakable security. This system can be realized using current technologies (e.g., linear polarizers and Faraday rotators) and requires no additional authentication and no key distribution scheme. However, a trusted third party must keep all member banks' private keys for encryption, authentication and also for functions to generate classical digital signatures.
On the passive probing of fiber optic quantum communication channels
Korol'kov, A. V.; Katamadze, K. G.; Kulik, S. P.; Molotkov, S. N.
2010-04-15
Avalanche photodetectors based on InGaAs:P are the most sensitive and only detectors operating in the telecommunication wavelength range 1.30-1.55 {mu}m in the fiber optic quantum cryptography systems that can operate in the single photon count mode. In contrast to the widely used silicon photodetectors for wavelengths up to 1 {mu}m operating in a waiting mode, these detectors always operate in a gated mode. The production of an electron-hole pair in the process of the absorption of a photon and the subsequent appearance of an avalanche of carriers can be accompanied by the inverse processes of the recombination and emission of photons. Such a backward emission can present a potential serious problem for the stability of fiber optic quantum cryptography systems against passive probing. The results of analyzing the detection of backscattered radiation are reported. The probability of such an emission has been estimated.
An Anti-Cheating Visual Cryptography Scheme Based on Chaotic Encryption System
NASA Astrophysics Data System (ADS)
Han, Yanyan; Xu, Zhuolin; Ge, Xiaonan; He, Wencai
By chaotic encryption system and introducing the trusted third party (TTP), in this paper, an anti-cheating visual cryptography scheme (VCS) is proposed. The scheme solved the problem of dishonest participants and improved the security of chaotic encryption system. Simulation results and analysis show that the recovery image is acceptable, the system can detect the cheating in participants effectively and with high security.
An Application-Independent Cryptography Model That Is Easy to Use for All Level Users
ERIC Educational Resources Information Center
Gabrielson, Anthony J.
2013-01-01
Cryptography libraries are inflexible and difficult for developers to integrate with their applications. These difficulties are often encountered by applications, like PGP, which are non-intuitive for end-users and are often used improperly or not at all. This thesis discusses the negative impact of the current prevailing poor usability on…
The Design and Evaluation of a Cryptography Teaching Strategy for Software Engineering Students
ERIC Educational Resources Information Center
Dowling, T.
2006-01-01
The present paper describes the design, implementation and evaluation of a cryptography module for final-year software engineering students. The emphasis is on implementation architectures and practical cryptanalysis rather than a standard mathematical approach. The competitive continuous assessment process reflects this approach and rewards…
Cryptographic Research and NSA: Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
Davida, George I.
1981-01-01
The Public Cryptography Study Group accepted the claim made by the National Security Agency that some information in some publications concerning cryptology could be inimical to national security, and is allowing the establishment of a voluntary mechanism, on an experimental basis, for NSA to review cryptology manuscripts. (MLW)
Intensity modulation and direct detection quantum key distribution based on quantum noise
NASA Astrophysics Data System (ADS)
Ikuta, Takuya; Inoue, Kyo
2016-01-01
Quantum key distribution (QKD) has been studied for achieving perfectly secure cryptography based on quantum mechanics. This paper presents a novel QKD scheme that is based on an intensity-modulation and direct-detection system. Two slightly intensity-modulated pulses are sent from a transmitter, and a receiver determines key bits from the directly detected intensity. We analyzed the system performance for two typical eavesdropping methods, a beam splitting attack and an intercept-resend attack, with an assumption that the transmitting and receiving devices are fully trusted. Our brief analysis showed that short- or middle-range QKD systems are achievable with a simple setup.
Quantum Entanglement: A Fundamental Concept Finding its Applications
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
Entanglement, according to the Austrian physicist Erwin Schrödinger the Essence of Quantum Mechanics, has been known for a long time now to be the source of a number of paradoxical and counterintuitive phenomena. Of those the most remarkable one is usually called non-locality and it is at the heart of the Einstein-Podolsky-Rosen Paradox and of the fact that Quantum Mechanics violates Bell's inequalities. Recent years saw an emergence of novel ideas in entanglement of three or more particles. Most recently it turned out that entanglement is an important concept in the development of quantum communication, quantum cryptography and quantum computation. First explicit experimental realizations with two or more photons include quantum dense coding and quantum teleportation.
No extension of quantum theory can have improved predictive power.
Colbeck, Roger; Renner, Renato
2011-01-01
According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory that removes this indeterminism, as suspected by Einstein, Podolsky and Rosen. Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography. PMID:21811240
Elliptic Curve Cryptography with Security System in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Huang, Xu; Sharma, Dharmendra
2010-10-01
The rapid progress of wireless communications and embedded micro-electro-system technologies has made wireless sensor networks (WSN) very popular and even become part of our daily life. WSNs design are generally application driven, namely a particular application's requirements will determine how the network behaves. However, the natures of WSN have attracted increasing attention in recent years due to its linear scalability, a small software footprint, low hardware implementation cost, low bandwidth requirement, and high device performance. It is noted that today's software applications are mainly characterized by their component-based structures which are usually heterogeneous and distributed, including the WSNs. But WSNs typically need to configure themselves automatically and support as hoc routing. Agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. This paper based on our previous works [1, 2], three contributions have made, namely (a) fuzzy controller for dynamic slide window size to improve the performance of running ECC (b) first presented a hidden generation point for protection from man-in-the middle attack and (c) we first investigates multi-agent applying for key exchange together. Security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the natures that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic curve cryptography (ECC) is one of high potential candidates for WSNs, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. For saving pre-computing storages recently there is a trend for the sensor networks that the sensor group leaders rather than sensors communicate to the end database, which highlighted the needs to prevent from the man
Memory-built-in quantum cloning in a hybrid solid-state spin register
Wang, W.-B.; Zu, C.; He, L.; Zhang, W.-G.; Duan, L.-M.
2015-01-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science. PMID:26178617
Memory-built-in quantum cloning in a hybrid solid-state spin register
NASA Astrophysics Data System (ADS)
Wang, W.-B.; Zu, C.; He, L.; Zhang, W.-G.; Duan, L.-M.
2015-07-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science.
Memory-built-in quantum cloning in a hybrid solid-state spin register.
Wang, W-B; Zu, C; He, L; Zhang, W-G; Duan, L-M
2015-01-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science. PMID:26178617
Practical secure quantum communications
NASA Astrophysics Data System (ADS)
Diamanti, Eleni
2015-05-01
We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.
Quantum control on entangled bipartite qubits
Delgado, Francisco
2010-04-15
Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not alter their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.
Measurement and Information Extraction in Complex Dynamics Quantum Computation
NASA Astrophysics Data System (ADS)
Casati, Giulio; Montangero, Simone
Quantum Information processing has several di.erent applications: some of them can be performed controlling only few qubits simultaneously (e.g. quantum teleportation or quantum cryptography) [1]. Usually, the transmission of large amount of information is performed repeating several times the scheme implemented for few qubits. However, to exploit the advantages of quantum computation, the simultaneous control of many qubits is unavoidable [2]. This situation increases the experimental di.culties of quantum computing: maintaining quantum coherence in a large quantum system is a di.cult task. Indeed a quantum computer is a many-body complex system and decoherence, due to the interaction with the external world, will eventually corrupt any quantum computation. Moreover, internal static imperfections can lead to quantum chaos in the quantum register thus destroying computer operability [3]. Indeed, as it has been shown in [4], a critical imperfection strength exists above which the quantum register thermalizes and quantum computation becomes impossible. We showed such e.ects on a quantum computer performing an e.cient algorithm to simulate complex quantum dynamics [5,6].
Subcarrier Wave Quantum Key Distribution in Telecommunication Network with Bitrate 800 kbit/s
NASA Astrophysics Data System (ADS)
Gleim, A. V.; Nazarov, Yu. V.; Egorov, V. I.; Smirnov, S. V.; Bannik, O. I.; Chistyakov, V. V.; Kynev, S. M.; Anisimov, A. A.; Kozlov, S. A.; Vasiliev, V. N.
2015-09-01
In the course of work on creating the first quantum communication network in Russia we demonstrated quantum key distribution in metropolitan optical network infrastructure. A single-pass subcarrier wave quantum cryptography scheme was used in the experiments. BB84 protocol with strong reference was chosen for performing key distribution. The registered sifted key rate in an optical cable with 1.5 dB loss was 800 Kbit/s. Signal visibility exceeded 98%, and quantum bit error rate value was 1%. The achieved result is a record for this type of systems.
NASA Astrophysics Data System (ADS)
Castelletto, S. A.; Scholten, R. E.
2008-03-01
Single photon counting, based on single photon sources and detectors, is a key ingredient for certain applications aiming at new quantum information technologies. Quantum cryptography, quantum radiometry, distributed quantum computing, as well as adjacent technologies such as biomedical and astronomical imaging, and low power classical communication also rely on single-photon technology. This paper reviews the present status of single photon sources and related counting measurement techniques, based on correlated (or heralded) photons in parametric down-conversion, and their possible impact on the above mentioned technologies, as well as an assessment for photon standards in the future.
Quantum key distribution with an entangled light emitting diode
Dzurnak, B.; Stevenson, R. M.; Nilsson, J.; Dynes, J. F.; Yuan, Z. L.; Skiba-Szymanska, J.; Shields, A. J.; Farrer, I.; Ritchie, D. A.
2015-12-28
Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurements also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.
Quantum key distribution with an entangled light emitting diode
NASA Astrophysics Data System (ADS)
Dzurnak, B.; Stevenson, R. M.; Nilsson, J.; Dynes, J. F.; Yuan, Z. L.; Skiba-Szymanska, J.; Farrer, I.; Ritchie, D. A.; Shields, A. J.
2015-12-01
Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurements also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.
Conditions for monogamy of quantum correlations in multipartite systems
NASA Astrophysics Data System (ADS)
Kumar, Asutosh
2016-09-01
Monogamy of quantum correlations is a vibrant area of research because of its potential applications in several areas in quantum information ranging from quantum cryptography to co-operative phenomena in many-body physics. In this paper, we investigate conditions under which monogamy is preserved for functions of quantum correlation measures. We prove that a monogamous measure remains monogamous on raising its power, and a non-monogamous measure remains non-monogamous on lowering its power. We also prove that monogamy of a convex quantum correlation measure for arbitrary multipartite pure quantum state leads to its monogamy for mixed states in the same Hilbert space. Monogamy of squared negativity for mixed states and that of entanglement of formation follow as corollaries of our results.
Abstract Algebra, Projective Geometry and Time Encoding of Quantum Information
NASA Astrophysics Data System (ADS)
Planat, Michel; Saniga, Metod
2005-10-01
Algebraic geometrical concepts are playing an increasing role in quantum applications such as coding, cryptography, tomography and computing. We point out here the prominent role played by Galois fields viewed as cyclotomic extensions of the integers modulo a prime characteristic p. They can be used to generate efficient cyclic encoding, for transmitting secrete quantum keys, for quantum state recovery and for error correction in quantum computing. Finite projective planes and their generalization are the geometric counterpart to cyclotomic concepts, their coordinatization involves Galois fields, and they have been used repetitively for enciphering and coding. Finally, the characters over Galois fields are fundamental for generating complete sets of mutually unbiased bases, a generic concept of quantum information processing and quantum entanglement. Gauss sums over Galois fields ensure minimum uncertainty under such protocols. Some Galois rings which are cyclotomic extensions of the integers modulo 4 are also becoming fashionable for their role in time encoding and mutual unbiasedness.
Authentication of quantum messages.
Barnum, Howard; Crépeau, Jean-Claude; Gottesman, D.; Smith, A.; Tapp, Alan
2001-01-01
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a private, classical random key, we provide a non-interactive scheme that both enables A to encrypt and authenticate (with unconditional security) an m qubit message by encoding it into m + s qubits, where the probability decreases exponentially in the security parameter s. The scheme requires a private key of size 2m + O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically: authentication and encryption are independent tasks, and one can authenticate a message while leaving it publicly readable. This reasoning has two important consequences: On one hand, it allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. On the other hand, we use it to show that digitally signing quantum states is impossible, even with only computational security.
Chen, Wen; Chen, Xudong
2011-05-01
In recent years, coherent diffractive imaging has been considered as a promising alternative for information retrieval instead of conventional interference methods. Coherent diffractive imaging using the X-ray light source has opened up a new research perspective for the measurement of non-crystalline and biological specimens, and can achieve unprecedentedly high resolutions. In this paper, we show how a three-dimensional (3D) particle-like distribution and coherent diffractive imaging can be applied for a study of optical cryptography. An optical multiple-random-phase-mask encoding approach is used, and the plaintext is considered as a series of particles distributed in a 3D space. A topology concept is also introduced into the proposed optical cryptosystem. During image decryption, a retrieval algorithm is developed to extract the plaintext from the ciphertexts. In addition, security and advantages of the proposed optical cryptography topology are also analyzed. PMID:21643154
Novel optical cryptography using PANDA ring resonator for highly secured communication
NASA Astrophysics Data System (ADS)
Putthacharoen, Rattipong; Juleang, Pakorn; Mitatha, Somsak; Yupapin, Preecha P.
2011-07-01
We propose a novel method of an optical cryptography using the dark-bright soliton conversion control in a modified add/drop optical filter. By using the control arrangement, the obtained outputs of the dynamic states of dark-bright soliton can be used to form the key suppression for communication security application, in which the key recovery can be obtained by controlling the add/drop filter outputs. The optical cryptography consists of an add/drop filter which is used to generate the encryption and decryption keys from the optical keys (LIP signals). A Mach-Zehnder interferometer is used for multiplexing and de-multiplexing operations. Simulation results obtained shows, that the proposed system can be used to form a high security communication system.
A Novel Basis Splitting Eavesdropping Scheme in Quantum Cryptography Based on the BB84 Protocol
NASA Astrophysics Data System (ADS)
Zhao, Nan; Zhu, Chang-Hua; Quan, Dong-Xiao
2015-08-01
Not Available Supported by the National Natural Science Foundation of China under Grant Nos 61301171 and 61372076, the Fundamental Research Funds for the Central Universities of China under Grant No K5051301018, the National 111 Project of Higher Education of China under Grant No B8038.
Analysis and Proposal of Position-Based Routing Protocols for Vehicular Ad Hoc Networks
NASA Astrophysics Data System (ADS)
Okada, Hiraku; Takano, Akira; Mase, Kenichi
One of the most promising applications of a mobile ad hoc network is a vehicular ad hoc network (VANET). Each vehicle is aware of its position information by GPS or other methods, so position-based routing is a useful approach in VANET. The position-based routing protocol can be classified roughly into a next-hop forwarding method and a directed flooding method. We evaluate performance of both methods by analytic approach and compare them in this paper. From the evaluation results, we conclude that it is effective for the position-based routing to choose either the next-hop forwarding method or the directed flooding method according to the environment. Then we propose the hybrid transmission method which can select one of them according to the environment, and clarify that the proposed method can keep the packet delivery ratio at a high level and reduce the delay time.
Quantum paradox of choice: More freedom makes summoning a quantum state harder
NASA Astrophysics Data System (ADS)
Adlam, Emily; Kent, Adrian
2016-06-01
The properties of quantum information in space-time can be investigated by studying operational tasks, such as "summoning," in which an unknown quantum state is supplied at one point and a call is made at another for it to be returned at a third. Hayden and May [arXiv:1210.0913] recently proved necessary and sufficient conditions for guaranteeing successful return of a summoned state for finite sets of call and return points when there is a guarantee of at most one summons. We prove necessary and sufficient conditions when there may be several possible summonses and complying with any one constitutes success, and we demonstrate the existence of an apparent paradox: The extra freedom makes it strictly harder to complete the summoning task. This result has practical applications for distributed quantum computing and cryptography and implications for our understanding of relativistic quantum information and its localization in space-time.
Devi, B Pushpa; Singh, Kh Manglem; Roy, Sudipta
2016-01-01
This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same size after shuffling it and then the singular value decomposition is applied to each randomly selected block. Shares are generated by comparing one of the elements in the first column of the left orthogonal matrix with its corresponding element in the right orthogonal matrix of the singular value decomposition of the block of the low frequency sub-band. The experimental results show that the proposed scheme clearly verifies the copyright of the digital images, and is robust to withstand several image processing attacks. Comparison with the other related visual cryptography-based algorithms reveals that the proposed method gives better performance. The proposed method is especially resilient against the rotation attack. PMID:27468392
Adaptive pixel-selection using chaotic map lattices for image cryptography
NASA Astrophysics Data System (ADS)
Sittigorn, Jirasak; Paithoonwattanakij, Kitti; Surawatpunya, Charray
2014-01-01
Chaotic theory has been used in cryptography application for generating a sequence of data that is close to pseudorandom number based on an adjusted initial condition and a parameter. However, data recovery becomes a crucial problem due to the precision of the parameters. This difficulty leads to limited usage of Chaotic-based cryptography especially for error sensitive applications such as voice cryptography. In order to enhance the encryption security and overcome this limitation, an Adaptive Pixel-Selection using Chaotic Map Lattices (APCML) is proposed. In APCML, the encryption sequence has been adaptively selected based on chaos generator. Moreover, the chaotic transformation and normalization boundary have been revised to alleviate the rounding error and inappropriate normalization boundary problems. In the experiments, the measurement indices of originality preservation, visual inspection, and statistical analysis are used to evaluate the performance of the proposed APCML compared to that of the original CML. Consequently, the APCML algorithm offers greater performance with full recovery of the original message.
Design of an Elliptic Curve Cryptography processor for RFID tag chips.
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-01-01
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip. PMID:25264952
Design of an Elliptic Curve Cryptography Processor for RFID Tag Chips
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-01-01
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip. PMID:25264952
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2010-01-08
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Experimental reversion of the optimal quantum cloning and flipping processes
Sciarrino, Fabio; Secondi, Veronica; De Martini, Francesco
2006-04-15
The quantum cloner machine maps an unknown arbitrary input qubit into two optimal clones and one optimal flipped qubit. By combining linear and nonlinear optical methods we experimentally implement a scheme that, after the cloning transformation, restores the original input qubit in one of the output channels, by using local measurements, classical communication, and feedforward. This nonlocal method demonstrates how the information on the input qubit can be restored after the cloning process. The realization of the reversion process is expected to find useful applications in the field of modern multipartite quantum cryptography.
Bell's Theorem, Entanglement, Quantum Teleportation, and All That
Legett, Anthony
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as 'teleportation' and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Memory-built-in quantum cloning in a hybrid solid-state spin register
NASA Astrophysics Data System (ADS)
Wang, Weibin; Zu, Chong; He, Li; Zhang, Wengang; Duan, Luming
2015-05-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude, and making it an ideal memory qubit. Our experiment is based on control of an individual nitrogen vacancy (NV) center in the diamond, which is a diamond defect that attracts strong interest in recent years with great potential for implementation of quantum information protocols.
Entanglement enhances security in quantum communication
Demkowicz-Dobrzanski, Rafal; Sen, Aditi; Sen, Ujjwal; Lewenstein, Maciej
2009-07-15
Secret sharing is a protocol in which a 'boss' wants to send a classical message secretly to two 'subordinates', such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing--a parallel of the Csiszar-Koerner criterion in single-receiver classical cryptography.
Robust Operation of Tendon-Driven Robot Fingers Using Force and Position-Based Control Laws
NASA Technical Reports Server (NTRS)
Abdallah, Muhammad E (Inventor); Platt, Jr., Robert J. (Inventor); Reiland, Matthew J (Inventor); Hargrave, Brian (Inventor); Diftler, Myron A (Inventor); Strawser, Philip A (Inventor); Ihrke, Chris A. (Inventor)
2013-01-01
A robotic system includes a tendon-driven finger and a control system. The system controls the finger via a force-based control law when a tension sensor is available, and via a position-based control law when a sensor is not available. Multiple tendons may each have a corresponding sensor. The system selectively injects a compliance value into the position-based control law when only some sensors are available. A control system includes a host machine and a non-transitory computer-readable medium having a control process, which is executed by the host machine to control the finger via the force- or position-based control law. A method for controlling the finger includes determining the availability of a tension sensor(s), and selectively controlling the finger, using the control system, via the force or position-based control law. The position control law allows the control system to resist disturbances while nominally maintaining the initial state of internal tendon tensions.
Quantum key distribution session with 16-dimensional photonic states
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
The Quantum Information Revolution: 101 Uses for Schodinger's Cat
Kwait, Paul G.
2007-09-05
A century after Einstein's revolutionary suggestion that light is composed of particles, the quantum information revolution seeks to use the almost magical properties of non-classical physics to enable new feats in information processing. The critical quantum resource is entanglement, which can now be produced at high rates with exquisite precision, enabling such feats as quantum cryptography and teleportation. I will describe some of these "micracles," and our investigations into how the usual benefits can be further extended, by using more complex quantum states (e.g., "hyper-entanglement"), and by incorporating other elements of modern physics (e.g., special relativity). Time and appetites permitting, a brief lesson in quantum cooking may be forthcoming.
Quantum key distribution session with 16-dimensional photonic states
NASA Astrophysics Data System (ADS)
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-07-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.
Quantum key distribution session with 16-dimensional photonic states.
Etcheverry, S; Cañas, G; Gómez, E S; Nogueira, W A T; Saavedra, C; Xavier, G B; Lima, G
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards. PMID:23967037
Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards. PMID:23967037
Quantum crytography over 14km of installed optical fiber
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Simmons, C.
1995-09-01
We have made the first demonstration that low error rate quantum cryptography over long distances (14km) of installed optical fiber in a real-world environment, subject to uncontrolled temperature and mechanical influences, representing an important new step towards incorporation of quantum cryptography into existing information security systems. We also point out that the high visibility single-photon interference in our experiment allows us to infer a test of the superposition principle of quantum mechanics: a photon reaching the detector has traveled over 14km of optical fiber in a wavepacket comprising a coherent superposition of two components that are spatially separated by about 2m. In principle, there are decoherence processes (or even possible modifications of quantum mechanics) that could cause the photon`s wavefunction to collapse into one component or the other during propagation, leading to a reduction in visibility. However, our results are consistent with no such loss of quantum coherence during the 67-{mu}s propagation time.
Post-quantum attacks on key distribution schemes in the presence of weakly stochastic sources
NASA Astrophysics Data System (ADS)
Al–Safi, S. W.; Wilmott, C. M.
2015-09-01
It has been established that the security of quantum key distribution protocols can be severely compromised were one to permit an eavesdropper to possess a very limited knowledge of the random sources used between the communicating parties. While such knowledge should always be expected in realistic experimental conditions, the result itself opened a new line of research to fully account for real-world weak randomness threats to quantum cryptography. Here we expand of this novel idea by describing a key distribution scheme that is provably secure against general attacks by a post-quantum adversary. We then discuss possible security consequences for such schemes under the assumption of weak randomness.
Improving the security of arbitrated quantum signature against the forgery attack
NASA Astrophysics Data System (ADS)
Zhang, Ke-Jia; Zhang, Wei-Wei; Li, Dan
2013-08-01
As a feasible model for signing quantum messages, some cryptanalysis and improvement of arbitrated quantum signature (AQS) have received a great deal of attentions in recent years. However, in this paper we find the previous improvement is not suitable implemented in some typical AQS protocols in the sense that the receiver, Bob, can forge a valid signature under known message attack. We describe the forgery strategy and present some corresponding improved strategies to stand against the forgery attack by modifying the encryption algorithm, an important part of AQS. These works preserve the merits of AQS and lead some potential improvements of the security in quantum signature or other cryptography problems.
Quantum subsystems: Exploring the complementarity of quantum privacy and error correction
NASA Astrophysics Data System (ADS)
Jochym-O'Connor, Tomas; Kribs, David W.; Laflamme, Raymond; Plosker, Sarah
2014-09-01
This paper addresses and expands on the contents of the recent Letter [Phys. Rev. Lett. 111, 030502 (2013), 10.1103/PhysRevLett.111.030502] discussing private quantum subsystems. Here we prove several previously presented results, including a condition for a given random unitary channel to not have a private subspace (although this does not mean that private communication cannot occur, as was previously demonstrated via private subsystems) and algebraic conditions that characterize when a general quantum subsystem or subspace code is private for a quantum channel. These conditions can be regarded as the private analog of the Knill-Laflamme conditions for quantum error correction, and we explore how the conditions simplify in some special cases. The bridge between quantum cryptography and quantum error correction provided by complementary quantum channels motivates the study of a new, more general definition of quantum error-correcting code, and we initiate this study here. We also consider the concept of complementarity for the general notion of a private quantum subsystem.
Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Baek, Jang Woon; Nam, Young Jin; Seo, Dae-Wha
This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.
NASA Astrophysics Data System (ADS)
Bartkiewicz, Karol; Černoch, Antonín; Lemr, Karel; Miranowicz, Adam; Nori, Franco
2016-06-01
Temporal steering, which is a temporal analog of Einstein-Podolsky-Rosen steering, refers to temporal quantum correlations between the initial and final state of a quantum system. Our analysis of temporal steering inequalities in relation to the average quantum bit error rates reveals the interplay between temporal steering and quantum cloning, which guarantees the security of quantum key distribution based on mutually unbiased bases against individual attacks. The key distributions analyzed here include the Bennett-Brassard 1984 protocol and the six-state 1998 protocol by Bruss. Moreover, we define a temporal steerable weight, which enables us to identify a kind of monogamy of temporal correlation that is essential to quantum cryptography and useful for analyzing various scenarios of quantum causality.
Single-dot optical emission from ultralow density well-isolated InP quantum dots
Ugur, A.; Hatami, F.; Masselink, W. T.; Vamivakas, A. N.; Lombez, L.; Atatuere, M.
2008-10-06
We demonstrate a straightforward way to obtain single well-isolated quantum dots emitting in the visible part of the spectrum and characterize the optical emission from single quantum dots using this method. Self-assembled InP quantum dots are grown using gas-source molecular-beam epitaxy over a wide range of InP deposition rates, using an ultralow growth rate of about 0.01 atomic monolayers/s, a quantum-dot density of 1 dot/{mu}m{sup 2} is realized. The resulting isolated InP quantum dots embedded in an InGaP matrix are individually characterized without the need for lithographical patterning and masks on the substrate. Such low-density quantum dots show excitonic emission at around 670 nm with a linewidth limited by instrument resolution. This system is applicable as a single-photon source for applications such as quantum cryptography.
Efficient quantum optical state engineering and applications
NASA Astrophysics Data System (ADS)
McCusker, Kevin T.
Over a century after the modern prediction of the existence of individual particles of light by Albert Einstein, a reliable source of this simple quantum state of one photon does not exist. While common light sources such as a light bulb, LED, or laser can produce a pulse of light with an average of one photon, there is (currently) no way of knowing the number of photons in that pulse without first absorbing (and thereby destroying) them. Spontaneous parametric down-conversion, a process in which one high-energy photon splits into two lower-energy photons, allows us to prepare a single-photon state by detecting one of the photons, which then heralds the existence of its twin. This process has been the workhorse of quantum optics, allowing demonstrations of a myriad of quantum processes and protocols, such as entanglement, cryptography, superdense coding, teleportation, and simple quantum computing demonstrations. All of these processes would benefit from better engineering of the underlying down-conversion process, but despite significant effort (both theoretical and experimental), optimization of this process is ongoing. The focus of this work is to optimize certain aspects of a down-conversion source, and then use this tool in novel experiments not otherwise feasible. Specifically, the goal is to optimize the heralding efficiency of the down-conversion photons, i.e., the probability that if one photon is detected, the other photon is also detected. This source is then applied to two experiments (a single-photon source, and a quantum cryptography implementation), and the detailed theory of an additional application (a source of Fock states and path-entangled states, called N00N states) is discussed, along with some other possible applications.
Implementation of Pollard Rho attack on elliptic curve cryptography over binary fields
NASA Astrophysics Data System (ADS)
Wienardo, Yuliawan, Fajar; Muchtadi-Alamsyah, Intan; Rahardjo, Budi
2015-09-01
Elliptic Curve Cryptography (ECC) is a public key cryptosystem with a security level determined by discrete logarithm problem called Elliptic Curve Discrete Logarithm Problem (ECDLP). John M. Pollard proposed an algorithm for discrete logarithm problem based on Monte Carlo method and known as Pollard Rho algorithm. The best current brute-force attack for ECC is Pollard Rho algorithm. In this research we implement modified Pollard Rho algorithm on ECC over GF (241). As the result, the runtime of Pollard Rho algorithm increases exponentially with the increase of the ECC key length. This work also presents the estimated runtime of Pollard Rho attack on ECC over longer bits.
Design and Implementation of KSP on the Next Generation Cryptography API
NASA Astrophysics Data System (ADS)
Lina, Zhang
With good seamless connectivity and higher safety, KSP (Key Storage Providers) is the inexorable trend of security requirements and development to take the place of CSP (Cryptographic Service Provider). But the study on KSP has just started in our country, and almost no reports of its implementation can be found. Based on the analysis of function modules and the architecture of Cryptography API (Next Generation (CNG)), this paper discusses the design and implementation of KSP (key storage providers) based on smart card in detail, and an example is also presented to illustrate how to use KSP in Windows Vista.
Jin, Chunhua; Xu, Chunxiang; Zhang, Xiaojun; Zhao, Jining
2015-03-01
Radio Frequency Identification(RFID) is an automatic identification technology, which can be widely used in healthcare environments to locate and track staff, equipment and patients. However, potential security and privacy problems in RFID system remain a challenge. In this paper, we design a mutual authentication protocol for RFID based on elliptic curve cryptography(ECC). We use pre-computing method within tag's communication, so that our protocol can get better efficiency. In terms of security, our protocol can achieve confidentiality, unforgeability, mutual authentication, tag's anonymity, availability and forward security. Our protocol also can overcome the weakness in the existing protocols. Therefore, our protocol is suitable for healthcare environments. PMID:25666925
Chen, Wen; Chen, Xudong; Sheppard, Colin J R
2011-10-10
In this paper, we propose a method using structured-illumination-based diffractive imaging with a laterally-translated phase grating for optical double-image cryptography. An optical cryptosystem is designed, and multiple random phase-only masks are placed in the optical path. When a phase grating is laterally translated just before the plaintexts, several diffraction intensity patterns (i.e., ciphertexts) can be correspondingly obtained. During image decryption, an iterative retrieval algorithm is developed to extract plaintexts from the ciphertexts. In addition, security and advantages of the proposed method are analyzed. Feasibility and effectiveness of the proposed method are demonstrated by numerical simulation results. PMID:22015370
Optical asymmetric cryptography using a three-dimensional space-based model
NASA Astrophysics Data System (ADS)
Chen, Wen; Chen, Xudong
2011-07-01
In this paper, we present optical asymmetric cryptography combined with a three-dimensional (3D) space-based model. An optical multiple-random-phase-mask encoding system is developed in the Fresnel domain, and one random phase-only mask and the plaintext are combined as a series of particles. Subsequently, the series of particles is translated along an axial direction, and is distributed in a 3D space. During image decryption, the robustness and security of the proposed method are further analyzed. Numerical simulation results are presented to show the feasibility and effectiveness of the proposed optical image encryption method.
Robust quantum data locking from phase modulation
NASA Astrophysics Data System (ADS)
Lupo, Cosmo; Wilde, Mark M.; Lloyd, Seth
2014-08-01
Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the key by a proportionate amount. This implies that a constant size key can still lock an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random code words, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.
Fully device-independent quantum key distribution.
Vazirani, Umesh; Vidick, Thomas
2014-10-01
Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol. PMID:25325625
Quantum information processing with narrow band two-photon state
NASA Astrophysics Data System (ADS)
Lu, Yajun
Application of quantum sources in communication and information processing are believed to bring a new revolution to the on-going information age. The generation of applicable quantum sources such as single photon state and two-photon state, appears to be one of the most difficult in experimental quantum optics. Spontaneous Parametric Down-Conversion (PDC) is known to generate two-photon state, but bandwidth problem makes it less applicable in quantum information processing. The aim of this work is to generate a narrow band two-photon state and apply it to quantum information processing. We start by developing a cavity enhanced PDC device to narrow the bandwidth of the two-photon state. Direct measurement of the bandwidth of the generated state has been made and the quantum theory of such a device has been investigated. An application of this narrow band two-photon state is to generate anti-bunched photons for quantum cryptography, based on the quantum interference between the two-photon state and a coherent state. The feasibility of this scheme for pulsed pump is also investigated. When applying the concept of mode locking in lasers to a two-photon state, we have mode-locked two-photon state which exhibits a comb-like correlation function and may be used for engineering of quantum states in time domain. Other applications such as demonstration of single photon nonlocality, nonlinear sign gate in quantum computation, and direct measurement of quantum beating, will also be addressed.
BOOK REVIEW Quantum Measurement and Control Quantum Measurement and Control
NASA Astrophysics Data System (ADS)
Kiefer, Claus
2010-12-01
In the last two decades there has been an enormous progress in the experimental investigation of single quantum systems. This progress covers fields such as quantum optics, quantum computation, quantum cryptography, and quantum metrology, which are sometimes summarized as `quantum technologies'. A key issue there is entanglement, which can be considered as the characteristic feature of quantum theory. As disparate as these various fields maybe, they all have to deal with a quantum mechanical treatment of the measurement process and, in particular, the control process. Quantum control is, according to the authors, `control for which the design requires knowledge of quantum mechanics'. Quantum control situations in which measurements occur at important steps are called feedback (or feedforward) control of quantum systems and play a central role here. This book presents a comprehensive and accessible treatment of the theoretical tools that are needed to cope with these situations. It also provides the reader with the necessary background information about the experimental developments. The authors are both experts in this field to which they have made significant contributions. After an introduction to quantum measurement theory and a chapter on quantum parameter estimation, the central topic of open quantum systems is treated at some length. This chapter includes a derivation of master equations, the discussion of the Lindblad form, and decoherence - the irreversible emergence of classical properties through interaction with the environment. A separate chapter is devoted to the description of open systems by the method of quantum trajectories. Two chapters then deal with the central topic of quantum feedback control, while the last chapter gives a concise introduction to one of the central applications - quantum information. All sections contain a bunch of exercises which serve as a useful tool in learning the material. Especially helpful are also various separate
A novel protocol for multiparty quantum key management
NASA Astrophysics Data System (ADS)
Xu, Gang; Chen, Xiu-Bo; Dou, Zhao; Yang, Yi-Xian; Li, Zongpeng
2015-08-01
Key management plays a fundamental role in the field of cryptography. In this paper, we propose a novel multiparty quantum key management (QKM) protocol. Departing from single-function quantum cryptography protocols, our protocol has a salient feature in that it accomplishes a complete QKM process. In this process, we can simultaneously realize the functions of key generation, key distribution and key backup by executing the protocol once. Meanwhile, for the first time, we propose the idea of multi-function QKM. Firstly, the secret key is randomly generated by managers via the quantum measurements in -level Bell basis. Then, through entanglement swapping, the secret key is successfully distributed to users. Under circumstances of urgent requirement, all managers can cooperate to recover the users' secret key, but neither of them can recover it unilaterally. Furthermore, this protocol is further generalized into the multi-manager and multi-user QKM scenario. It has clear advantages in the burgeoning area of quantum security group communication. In this system, all group members share the same group key, and group key management is the foundation of secure group communication and hence an important subject of study.
Efficient arbitrated quantum signature and its proof of security
NASA Astrophysics Data System (ADS)
Li, Qin; Li, Chengqing; Long, Dongyang; Chan, Wai Hong; Wang, Changji
2013-07-01
In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.
Quantum Computation and Quantum Information
NASA Astrophysics Data System (ADS)
Nielsen, Michael A.; Chuang, Isaac L.
2010-12-01
Part I. Fundamental Concepts: 1. Introduction and overview; 2. Introduction to quantum mechanics; 3. Introduction to computer science; Part II. Quantum Computation: 4. Quantum circuits; 5. The quantum Fourier transform and its application; 6. Quantum search algorithms; 7. Quantum computers: physical realization; Part III. Quantum Information: 8. Quantum noise and quantum operations; 9. Distance measures for quantum information; 10. Quantum error-correction; 11. Entropy and information; 12. Quantum information theory; Appendices; References; Index.
Allam, Ahmed M; Abbas, Hazem M
2010-12-01
Neural cryptography deals with the problem of "key exchange" between two neural networks using the mutual learning concept. The two networks exchange their outputs (in bits) and the key between the two communicating parties is eventually represented in the final learned weights, when the two networks are said to be synchronized. Security of neural synchronization is put at risk if an attacker is capable of synchronizing with any of the two parties during the training process. Therefore, diminishing the probability of such a threat improves the reliability of exchanging the output bits through a public channel. The synchronization with feedback algorithm is one of the existing algorithms that enhances the security of neural cryptography. This paper proposes three new algorithms to enhance the mutual learning process. They mainly depend on disrupting the attacker confidence in the exchanged outputs and input patterns during training. The first algorithm is called "Do not Trust My Partner" (DTMP), which relies on one party sending erroneous output bits, with the other party being capable of predicting and correcting this error. The second algorithm is called "Synchronization with Common Secret Feedback" (SCSFB), where inputs are kept partially secret and the attacker has to train its network on input patterns that are different from the training sets used by the communicating parties. The third algorithm is a hybrid technique combining the features of the DTMP and SCSFB. The proposed approaches are shown to outperform the synchronization with feedback algorithm in the time needed for the parties to synchronize. PMID:20937580
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d’Ischia, Marco
2015-01-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system. PMID:26246999
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d'Ischia, Marco
2015-06-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system. PMID:26246999
ERIC Educational Resources Information Center
White, Tobin
2009-01-01
This paper introduces an applied problem-solving task, set in the context of cryptography and embedded in a network of computer-based tools. This designed learning environment engaged students in a series of collaborative problem-solving activities intended to introduce the topic of functions through a set of linked representations. In a…
Long-distance continuous-variable quantum key distribution by controlling excess noise
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network. PMID:26758727
Long-distance continuous-variable quantum key distribution by controlling excess noise
NASA Astrophysics Data System (ADS)
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network.
Long-distance continuous-variable quantum key distribution by controlling excess noise.
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network. PMID:26758727
Quantum Information with Continuous Variable systems
NASA Astrophysics Data System (ADS)
Rodó, Carles
2010-05-01
This thesis deals with the study of quantum communication protocols with Continuous Variable (CV) systems. Continuous Variable systems are those described by canonical conjugated coordinates x and p endowed with infinite dimensional Hilbert spaces, thus involving a complex mathematical structure. A special class of CV states, are the so-called Gaussian states. With them, it has been possible to implement certain quantum tasks as quantum teleportation, quantum cryptography and quantum computation with fantastic experimental success. The importance of Gaussian states is two-fold; firstly, its structural mathematical description makes them much more amenable than any other CV system. Secondly, its production, manipulation and detection with current optical technology can be done with a very high degree of accuracy and control. Nevertheless, it is known that in spite of their exceptional role within the space of all Continuous Variable states, in fact, Gaussian states are not always the best candidates to perform quantum information tasks. Thus non-Gaussian states emerge as potentially good candidates for communication and computation purposes.
Memory assisted free space quantum communication
NASA Astrophysics Data System (ADS)
Jordaan, Bertus; Namazi, Mehdi; Goham, Connor; Shahrokhshahi, Reihaneh; Vallone, Giuseppe; Villoresi, Paolo; Figueroa, Eden
2016-05-01
A quantum memory assisted node between different quantum channels has the capability to modify and synchronize its output, allowing for easy connectivity, and advanced cryptography protocols. We present the experimental progress towards the storage of single photon level pulses carrying random polarization qubits into a dual rail room temperature quantum memory (RTQM) after ~ 20m of free space propagation. The RTQM coherently stores the input pulses through electromagnetically induced transparency (EIT) of a warm 87 Rb vapor and filters the output by polarization elements and temperature-controlled etalon resonators. This allows the characterization of error rates for each polarization basis and the testing of the synchronization ability of the quantum memory. This work presents a steppingstone towards quantum key distribution and quantum repeater networks. The work was supported by the US-Navy Office of Naval Research, Grant Number N00141410801 and the Simons Foundation, Grant Number SBF241180.B. J. acknowledges financial assistance of the National Research Foundation (NRF) of South Africa.
Electroluminescence from a single InGaN quantum dot in the green spectral region up to 150 K.
Kalden, J; Tessarek, C; Sebald, K; Figge, S; Kruse, C; Hommel, D; Gutowski, J
2010-01-01
We present electrically driven luminescence from single InGaN quantum dots embedded into a light emitting diode structure grown by metal-organic vapor-phase epitaxy. Single sharp emission lines in the green spectral region can be identified. Temperature dependent measurements demonstrate thermal stability of the emission of a single quantum dot up to 150 K. These results are an important step towards applications like electrically driven single-photon emitters, which are a basis for applications incorporating plastic optical fibers as well as for modern concepts of free space quantum cryptography. PMID:19946174
Chen Benyong; Zhang Enzheng; Yan Liping; Li Chaorong; Tang Wuhua; Feng Qibo
2009-11-15
Not only the magnitude but also the position of straightness errors are of concern to users. However, current laser interferometers used for measuring straightness seldom give the relative position of the straightness error. To solve this problem, a laser interferometer for measuring straightness and its position based on heterodyne interferometry is proposed. The optical configuration of the interferometer is designed and the measurement principle is analyzed theoretically. Two experiments were carried out. The first experiment verifies the validity and repeatability of the interferometer by measuring a linear stage. Also, the second one for measuring a flexure-hinge stage demonstrates that the interferometer is capable of nanometer measurement accuracy. These results show that this interferometer has advantages of simultaneously measuring straightness error and the relative position with high precision, and a compact structure.
Scale-Free Correlations in Flocking Systems with Position-Based Interactions
NASA Astrophysics Data System (ADS)
Huepe, Cristián; Ferrante, Eliseo; Wenseleers, Tom; Turgut, Ali Emre
2015-02-01
We consider a model of self-propelled agents with spring-like interactions that depend only on relative positions, and not on relative orientations. We observe that groups of these agents self-organize to achieve collective motion (CM) through a mechanism based on the cascading of self-propulsion energy towards lower elastic modes. By computing the correlation functions of the speed and velocity fluctuations for different group sizes, we show that the corresponding correlation lengths are proportional to the linear size of the group and have no intrinsic length scale. We argue that such scale-free correlations are a natural consequence of the position-based interactions and associated CM dynamics. We hypothesize that this effect, acting in the context of more complex realistic interactions, could be at the origin of the scale-free correlations measured experimentally in flocks of starlings, instead of the previously argued proximity to a critical regime.
Quantum computing accelerator I/O : LDRD 52750 final report.
Schroeppel, Richard Crabtree; Modine, Normand Arthur; Ganti, Anand; Pierson, Lyndon George; Tigges, Christopher P.
2003-12-01
In a superposition of quantum states, a bit can be in both the states '0' and '1' at the same time. This feature of the quantum bit or qubit has no parallel in classical systems. Currently, quantum computers consisting of 4 to 7 qubits in a 'quantum computing register' have been built. Innovative algorithms suited to quantum computing are now beginning to emerge, applicable to sorting and cryptanalysis, and other applications. A framework for overcoming slightly inaccurate quantum gate interactions and for causing quantum states to survive interactions with surrounding environment is emerging, called quantum error correction. Thus there is the potential for rapid advances in this field. Although quantum information processing can be applied to secure communication links (quantum cryptography) and to crack conventional cryptosystems, the first few computing applications will likely involve a 'quantum computing accelerator' similar to a 'floating point arithmetic accelerator' interfaced to a conventional Von Neumann computer architecture. This research is to develop a roadmap for applying Sandia's capabilities to the solution of some of the problems associated with maintaining quantum information, and with getting data into and out of such a 'quantum computing accelerator'. We propose to focus this work on 'quantum I/O technologies' by applying quantum optics on semiconductor nanostructures to leverage Sandia's expertise in semiconductor microelectronic/photonic fabrication techniques, as well as its expertise in information theory, processing, and algorithms. The work will be guided by understanding of practical requirements of computing and communication architectures. This effort will incorporate ongoing collaboration between 9000, 6000 and 1000 and between junior and senior personnel. Follow-on work to fabricate and evaluate appropriate experimental nano/microstructures will be proposed as a result of this work.
Information hiding based on double random-phase encoding and public-key cryptography.
Sheng, Yuan; Xin, Zhou; Alam, Mohammed S; Xi, Lu; Xiao-Feng, Li
2009-03-01
A novel information hiding method based on double random-phase encoding (DRPE) and Rivest-Shamir-Adleman (RSA) public-key cryptosystem is proposed. In the proposed technique, the inherent diffusion property of DRPE is cleverly utilized to make up the diffusion insufficiency of RSA public-key cryptography, while the RSA cryptosystem is utilized for simultaneous transmission of the cipher text and the two phase-masks, which is not possible under the DRPE technique. This technique combines the complementary advantages of the DPRE and RSA encryption techniques and brings security and convenience for efficient information transmission. Extensive numerical simulation results are presented to verify the performance of the proposed technique. PMID:19259163
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2015-09-01
In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of asymmetric cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.
Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang
2010-08-16
Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs. PMID:20721222
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-01-01
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224
Zhang, Zezhong; Qi, Qingqing
2014-05-01
Medication errors are very dangerous even fatal since it could cause serious even fatal harm to patients. In order to reduce medication errors, automated patient medication systems using the Radio Frequency Identification (RFID) technology have been used in many hospitals. The data transmitted in those medication systems is very important and sensitive. In the past decade, many security protocols have been proposed to ensure its secure transition attracted wide attention. Due to providing mutual authentication between the medication server and the tag, the RFID authentication protocol is considered as the most important security protocols in those systems. In this paper, we propose a RFID authentication protocol to enhance patient medication safety using elliptic curve cryptography (ECC). The analysis shows the proposed protocol could overcome security weaknesses in previous protocols and has better performance. Therefore, the proposed protocol is very suitable for automated patient medication systems. PMID:24733525
Lin, Chao; Shen, Xueju; Wang, Zhisong; Zhao, Cheng
2014-06-20
We demonstrate a novel optical asymmetric cryptosystem based on the principle of elliptical polarized light linear truncation and a numerical reconstruction technique. The device of an array of linear polarizers is introduced to achieve linear truncation on the spatially resolved elliptical polarization distribution during image encryption. This encoding process can be characterized as confusion-based optical cryptography that involves no Fourier lens and diffusion operation. Based on the Jones matrix formalism, the intensity transmittance for this truncation is deduced to perform elliptical polarized light reconstruction based on two intensity measurements. Use of a quick response code makes the proposed cryptosystem practical, with versatile key sensitivity and fault tolerance. Both simulation and preliminary experimental results that support theoretical analysis are presented. An analysis of the resistance of the proposed method on a known public key attack is also provided. PMID:24979424
Lee, Kai-Hui; Chiu, Pei-Ling
2013-10-01
Conventional visual cryptography (VC) suffers from a pixel-expansion problem, or an uncontrollable display quality problem for recovered images, and lacks a general approach to construct visual secret sharing schemes for general access structures. We propose a general and systematic approach to address these issues without sophisticated codebook design. This approach can be used for binary secret images in non-computer-aided decryption environments. To avoid pixel expansion, we design a set of column vectors to encrypt secret pixels rather than using the conventional VC-based approach. We begin by formulating a mathematic model for the VC construction problem to find the column vectors for the optimal VC construction, after which we develop a simulated-annealing-based algorithm to solve the problem. The experimental results show that the display quality of the recovered image is superior to that of previous papers. PMID:23674454
Robust Public Key Cryptography — A New Cryptosystem Surviving Private Key Compromise
NASA Astrophysics Data System (ADS)
Shaik, Cheman
A weakness of the present-day public key cryptosystems is that these cryptosystems do not survive private-key compromise attacks resulting from an internal breach of trust. In a competitive business environment, private key compromise is a common incident that voids the strength of public key cryptosystems such as RSA and ECC. Bribing corporate employees to disclose their secret keys and inadvertently disclosing secret information are among a plethora of practical attacks that occur at the implementation level. Once a breach of trust takes place and subsequently the private key is revealed, any public key cryptosystem fails to secure electronic data in Internet communications. The revealed key may be used by an attacker to decipher the intercepted data at an intermediary router. This weakness of public key cryptography calls for an additional security measure that enables encryptions to survive private key compromise attacks.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-01-01
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224
Two-layer tree-connected feed-forward neural network model for neural cryptography
NASA Astrophysics Data System (ADS)
Lei, Xinyu; Liao, Xiaofeng; Chen, Fei; Huang, Tingwen
2013-03-01
Neural synchronization by means of mutual learning provides an avenue to design public key exchange protocols, bringing about what is known as neural cryptography. Two identically structured neural networks learn from each other and reach full synchronization eventually. The full synchronization enables two networks to have the same weight, which can be used as a secret key for many subsequent cryptographic purposes. It is striking to observe that after the first decade of neural cryptography, the tree parity machine (TPM) network with hidden unit K=3 appears to be the sole network that is suitable for a neural protocol. No convincingly secure neural protocol is well designed by using other network structures despite considerable research efforts. With the goal of overcoming the limitations of a suitable network structure, in this paper we develop a two-layer tree-connected feed-forward neural network (TTFNN) model for a neural protocol. The TTFNN model captures the notion that two partners are capable of exchanging a vector with multiple bits in each time step. An in-depth study of the dynamic process of TTFNN-based protocols is then undertaken, based upon which a feasible condition is theoretically obtained to seek applicable protocols. Afterward, according to two analytically derived heuristic rules, a complete methodology for designing feasible TTFNN-based protocols is elaborated. A variety of feasible neural protocols are constructed, which exhibit the effectiveness and benefits of the proposed model. With another look from the perspective of application, TTFNN-based instances, which can outperform the conventional TPM-based protocol with respect to synchronization speed, are also experimentally confirmed.
Quantum random bit generation using stimulated Raman scattering.
Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J
2011-12-01
Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond. PMID:22273908
Secret sharing with a single d -level quantum system
NASA Astrophysics Data System (ADS)
Tavakoli, Armin; Herbauts, Isabelle; Żukowski, Marek; Bourennane, Mohamed
2015-09-01
We give an example of a wide class of problems for which quantum-information protocols based on multisystem entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multipartite GHZ entanglement. We present a multiparty secret sharing protocol which requires only sequential communication of a single quantum d -level system (for any prime d ). It has huge advantages in scalability and can be realized with state-of-the-art technology.
Measurement-device-independent entanglement-based quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Liu, Hongwei; Yin, Zhenqiang; Li, Zuohan; Lian, Shibin; Du, Yungang; Wu, Lingan
2016-05-01
We present a quantum key distribution protocol in a model in which the legitimate users gather statistics as in the measurement-device-independent entanglement witness to certify the sources and the measurement devices. We show that the task of measurement-device-independent quantum communication can be accomplished based on monogamy of entanglement, and it is fairly loss tolerate including source and detector flaws. We derive a tight bound for collective attacks on the Holevo information between the authorized parties and the eavesdropper. Then with this bound, the final secret key rate with the source flaws can be obtained. The results show that long-distance quantum cryptography over 144 km can be made secure using only standard threshold detectors.
Quantum key distribution without detector vulnerabilities using optically seeded lasers
NASA Astrophysics Data System (ADS)
Comandar, L. C.; Lucamarini, M.; Fröhlich, B.; Dynes, J. F.; Sharpe, A. W.; Tam, S. W.-B.; Yuan, Z. L.; Penty, R. V.; Shields, A. J.
2016-05-01
Security in quantum cryptography is continuously challenged by inventive attacks targeting the real components of a cryptographic set-up, and duly restored by new countermeasures to foil them. Owing to their high sensitivity and complex design, detectors are the most frequently attacked components. It was recently shown that two-photon interference from independent light sources can be used to remove any vulnerability from detectors. This new form of detection-safe quantum key distribution (QKD), termed measurement-device-independent (MDI), has been experimentally demonstrated but with modest key rates. Here, we introduce a new pulsed laser seeding technique to obtain high-visibility interference from gain-switched lasers and thereby perform MDI-QKD with unprecedented key rates in excess of 1 megabit per second in the finite-size regime. This represents a two to six orders of magnitude improvement over existing implementations and supports the new scheme as a practical resource for secure quantum communications.
Industrial application for global quantum communication
NASA Astrophysics Data System (ADS)
Mirza, A.; Petruccione, F.
2012-09-01
In the last decade the quantum communication community has witnessed great advances in photonic quantum cryptography technology with the research, development and commercialization of automated Quantum Key Distribution (QKD) devices. These first generation devices are however bottlenecked by the achievable spatial coverage. This is due to the intrinsic absorption of the quantum particle into the communication medium. As QKD is of paramount importance in the future ICT landscape, various innovative solutions have been developed and tested to expand the spatial coverage of these networks such as the Quantum City initiative in Durban, South Africa. To expand this further into a global QKD-secured network, recent efforts have focussed on high-altitude free-space techniques through the use of satellites. This couples the QKD-secured Metropolitan Area Networks (MANs) with secured ground-tosatellite links as access points to a global network. Such a solution, however, has critical limitations that reduce its commercial feasibility. As parallel step to the development of satellitebased global QKD networks, we investigate the use of the commercial aircrafts' network as secure transport mechanisms in a global QKD network. This QKD-secured global network will provide a robust infrastructure to create, distribute and manage encryption keys between the MANs of the participating cities.
Long-distance quantum communication over noisy networks without long-time quantum memory
NASA Astrophysics Data System (ADS)
Mazurek, Paweł; Grudka, Andrzej; Horodecki, Michał; Horodecki, Paweł; Łodyga, Justyna; Pankowski, Łukasz; PrzysieŻna, Anna
2014-12-01
The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008), 10.1103/PhysRevA.78.062324] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission of quantum information in a D +1 -dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.
NASA Astrophysics Data System (ADS)
Kukita, Tatsuya; Takada, Hiroshi; Inoue, Kyo
2010-12-01
Since it was noted that quantum computers could break public key cryptosystems based on number theory, extensive studies have been undertaken on quantum cryptography, which offers unconditionally secure communication based on quantum mechanics. We investigate a quantum key distribution (QKD) scheme using macroscopic coherent light with optically pre-amplified direct differential detection. A transmitter “Alice” sends a series of two macroscopic nonorthogonal coherent states that partially overlap due to quantum noise. A receiver “Bob” amplifies and receives it with direct differential detection followed by a thresholding process. To avoid difficulties in detection, our scheme uses conventional direct differential photodetection, not single-photon detection or homodyne detection as in previous QKD protocols. System performance assuming some eavesdropping is evaluated, the results of which suggest that our scheme is usable for short or medium distance.
DPNuc: Identifying Nucleosome Positions Based on the Dirichlet Process Mixture Model.
Chen, Huidong; Guan, Jihong; Zhou, Shuigeng
2015-01-01
Nucleosomes and the free linker DNA between them assemble the chromatin. Nucleosome positioning plays an important role in gene transcription regulation, DNA replication and repair, alternative splicing, and so on. With the rapid development of ChIP-seq, it is possible to computationally detect the positions of nucleosomes on chromosomes. However, existing methods cannot provide accurate and detailed information about the detected nucleosomes, especially for the nucleosomes with complex configurations where overlaps and noise exist. Meanwhile, they usually require some prior knowledge of nucleosomes as input, such as the size or the number of the unknown nucleosomes, which may significantly influence the detection results. In this paper, we propose a novel approach DPNuc for identifying nucleosome positions based on the Dirichlet process mixture model. In our method, Markov chain Monte Carlo (MCMC) simulations are employed to determine the mixture model with no need of prior knowledge about nucleosomes. Compared with three existing methods, our approach can provide more detailed information of the detected nucleosomes and can more reasonably reveal the real configurations of the chromosomes; especially, our approach performs better in the complex overlapping situations. By mapping the detected nucleosomes to a synthetic benchmark nucleosome map and two existing benchmark nucleosome maps, it is shown that our approach achieves a better performance in identifying nucleosome positions and gets a higher F-score. Finally, we show that our approach can more reliably detect the size distribution of nucleosomes. PMID:26671796
All-optical cryptography of M-QAM formats by using two-dimensional spectrally sliced keys.
Abbade, Marcelo L F; Cvijetic, Milorad; Messani, Carlos A; Alves, Cleiton J; Tenenbaum, Stefan
2015-05-10
There has been an increased interest in enhancing the security of optical communications systems and networks. All-optical cryptography methods have been considered as an alternative to electronic data encryption. In this paper we propose and verify the use of a novel all-optical scheme based on cryptographic keys applied on the spectral signal for encryption of the M-QAM modulated data with bit rates of up to 200 gigabits per second. PMID:25967489
Sub-millimeter servo system for sample positioning based on thresholding of defocused laser spot
NASA Astrophysics Data System (ADS)
Wang, Zheng; Cao, Liangcai; Zhang, Enyao; Jin, Guofan
2013-12-01
Accurate sample positioning and automatic sample operation can improve the performance of measuring instruments. A Sub-millimeter servo system for sample positioning based on thresholding of defocused laser spot is proposed. The effective laser spot image is extracted by thresholding of the light cone section on the sample surface. By estimating the section area and centroid of the spot, the defocus status and position of the measured sample can be acquired. A focused light cone at visible wavelength is cast onto the surface of sample, forming a marked laser spot as the indicator of the measurement point. A CCD camera is used for visual imaging, and a high-precision three-dimensional motorized translation stage is used for the accurate servo control. The marked spot is real-time monitored and processed in the platform of LabVIEW. The Autonomous Thresholding Image-Processing Algorithm (ATIPA) is proposed to detect and analyze the defocused marked spot, through which system creates a servo whereby accurate position control of the sample can be achieved. The measurement point on the sample can be accurately located by computing the center coordinates of the marked spot. And a focus function is implemented by measuring the size of defocused spot. This focus function is then used within an improved climbing search algorithm to obtain the focused sample position via moving the sample stage. Experimental results show that the system could measure the laser spot and control the sample in a robust, repeatable way within reasonable errors. The accuracy of the sample autofocus reaches 0.1 mm.
Security of Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Lütkenhaus, Norbert
2007-03-01
Quantum Key Distribution (QKD) is the most advanced application of Quantum Information Science. It allows extending secret keys over some distances in such a way that the security of the resulting key material can be guaranteed by the laws of quantum mechanics. In contrast to presently used encryption techniques, the security of QKD can be proven in terms of information-theoretic measures. The resulting key can then be used for many tasks, including exchanging secret messages. QKD has been developed in the language of abstract two-level systems, the qubits. They cannot be easily implemented in optical signals. It took some time to bring the protocols and theory of QKD to the point where they fit to the realities of fiber-optical or free-space applications, including lossy channels. Today, QKD schemes can be implemented reliably using standard off-the-shelf components. Information theoretic security is a theoretical concept. Naturally, it is impossible to demonstrate directly that a given experimental set-up indeed creates a secret key. What one can do is to show that the experiment can give data within a certain parameters regime, such as error rate and loss rate, for which a security proof exists. I will discuss what parameter regime gives provable secure key and which parameter regime cannot lead to secret key. It is desirable to prove `unconditional security,' as it is termed in the world of classical cryptography: no assumption is made about the attacks of an eavesdropper on the quantum channel. However, one has to assume that the signal structure and the measurement device are correctly described by the adopted model and that no eavesdropper can intrude the sender or receiver unit. In this talk I will briefly introduce the concept of QKD and optical implementations. Especially I will discuss security aspects of modern approaches of QKD schemes that allow us to increase the covered distance and the achievable rate.
Low cost and compact quantum key distribution
NASA Astrophysics Data System (ADS)
Duligall, J. L.; Godfrey, M. S.; Harrison, K. A.; Munro, W. J.; Rarity, J. G.
2006-10-01
We present the design of a novel free-space quantum cryptography system, complete with purpose-built software, that can operate in daylight conditions. The transmitter and receiver modules are built using inexpensive off-the-shelf components. Both modules are compact allowing the generation of renewed shared secrets on demand over a short range of a few metres. An analysis of the software is shown as well as results of error rates and therefore shared secret yields at varying background light levels. As the system is designed to eventually work in short-range consumer applications, we also present a use scenario where the consumer can regularly 'top up' a store of secrets for use in a variety of one-time-pad (OTP) and authentication protocols.
NASA Astrophysics Data System (ADS)
Lukishova, Svetlana G.; Liapis, Andreas C.; Bissell, Luke J.; Gehring, George M.; Winkler, Justin M.; Boyd, Robert W.
2015-03-01
We present here our results on using liquid crystals in experiments with nonclassical light sources: (1) single-photon sources exhibiting antibunching (separation of all photons in time), which are key components for secure quantum communication systems, and (2) entangled photon source with photons exhibiting quantum interference in a Hong-Ou- Mandel interferometer. In the first part, cholesteric liquid crystal hosts were used to create definite circular polarization of antibunched photons emitted by nanocrystal quantum dots. If the photon has unknown polarization, filtering it through a polarizer to produce the desired polarization for quantum key distribution with bits based on polarization states of photons will reduce by half the efficiency of a quantum cryptography system. In the first part, we also provide our results on observation of a circular polarized microcavity resonance in nanocrystal quantum dot fluorescence in a 1-D chiral photonic bandgap cholesteric liquid crystal microcavity. In the second part of this paper with indistinguishable, time-entangled photons, we demonstrate our experimental results on simulating quantum-mechanical barrier tunnelling phenomena. A Hong-Ou-Mandel dip (quantum interference effect) is shifted when a phase change was introduced on the way of one of entangled photons in pair (one arm of the interferometer) by inserting in this arm an electrically controlled planar-aligned nematic liquid crystal layer between two prisms in the conditions close to a frustrated total internal reflection. By applying different AC-voltages to the planar-aligned nematic layer and changing its refractive index, we can obtain various conditions for incident photon propagation - from total reflection to total transmission. Measuring changes of tunnelling times of photon through this structure with femtosecond resolution permitted us to answer some unresolved questions in quantum-mechanical barrier tunnelling phenomena.
Security of quantum bit-string generation
Barrett, Jonathan; Massar, Serge
2004-11-01
We consider the cryptographic task of bit-string generation. This is a generalization of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have biased the string too much. We consider a quantum protocol for this task, originally introduced in Phys. Rev. A 69, 022322 (2004), that is feasible with present day technology. We introduce security conditions based on the average bias of the bits and the Shannon entropy of the string. For each, we prove rigorous security bounds for this protocol in both noiseless and noisy conditions under the most general attacks allowed by quantum mechanics. Roughly speaking, in the absence of noise, a cheater can only bias significantly a vanishing fraction of the bits, whereas in the presence of noise, a cheater can bias a constant fraction, with this fraction depending quantitatively on the level of noise. We also discuss classical protocols for the same task, deriving upper bounds on how well a classical protocol can perform. This enables the determination of how much noise the quantum protocol can tolerate while still outperforming classical protocols. We raise several conjectures concerning both quantum and classical possibilities for large n cryptography. An experiment corresponding to the scheme analyzed in this paper has been performed and is reported elsewhere.
Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes
NASA Astrophysics Data System (ADS)
Harrington, James William
Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present
Two-slit experiment: quantum and classical probabilities
NASA Astrophysics Data System (ADS)
Khrennikov, Andrei
2015-06-01
Inter-relation between quantum and classical probability models is one of the most fundamental problems of quantum foundations. Nowadays this problem also plays an important role in quantum technologies, in quantum cryptography and the theory of quantum random generators. In this letter, we compare the viewpoint of Richard Feynman that the behavior of quantum particles cannot be described by classical probability theory with the viewpoint that quantum-classical inter-relation is more complicated (cf, in particular, with the tomographic model of quantum mechanics developed in detail by Vladimir Man'ko). As a basic example, we consider the two-slit experiment, which played a crucial role in quantum foundational debates at the beginning of quantum mechanics (QM). In particular, its analysis led Niels Bohr to the formulation of the principle of complementarity. First, we demonstrate that in complete accordance with Feynman's viewpoint, the probabilities for the two-slit experiment have the non-Kolmogorovian structure, since they violate one of basic laws of classical probability theory, the law of total probability (the heart of the Bayesian analysis). However, then we show that these probabilities can be embedded in a natural way into the classical (Kolmogorov, 1933) probability model. To do this, one has to take into account the randomness of selection of different experimental contexts, the joint consideration of which led Feynman to a conclusion about the non-classicality of quantum probability. We compare this embedding of non-Kolmogorovian quantum probabilities into the Kolmogorov model with well-known embeddings of non-Euclidean geometries into Euclidean space (e.g., the Poincaré disk model for the Lobachvesky plane).
BOOK REVIEW: Quantum Squeezing
NASA Astrophysics Data System (ADS)
Zubairy, Suhail
2005-05-01
Langevin formalism for squeezing in lasing systems. In the last article of this part, Wiseman deals with squeezing systems when the system's environment can be deliberately engineered so that the feedback is important. The third part of the book includes four articles dealing with the applications of quantum squeezing. In the first article, Yuen presents a discussion of communications and measurement using squeezed states and discusses the advantages of using nonclassical light over classical light in communications and measurement. In the second article, Swain deals with the interaction of squeezed light with the atomic systems and presents a review of novel phenomena in spectroscopy. This chapter on two-level atomic system is followed by Ficek's article on squeezed-light based spectroscopy in three-level atomic systems. In the last article, Reid again addresses the advantages of squeezed light in communications, but her emphasis is different from that of Yuen's article. Here she discusses EPR correlations for squeezed light and presents squeezed-light based methods for quantum cryptography. All the authors are leading figures in the field of squeezed states who have made pioneering contributions to various aspects of the field over the years. This is reflected in the authoritative style with which all the articles are written. These articles are rich in content, easy to read and cover a broad base. The emphasis is however on the theoretical aspects with occasional references to experimental work. This book is an excellent collection of articles on quantum squeezing that are highly useful both for beginners who would like to learn about squeezing and its applications, as well as for experts who would like to learn about the frontiers.
Generation and confirmation of a (100 x 100)-dimensional entangled quantum system.
Krenn, Mario; Huber, Marcus; Fickler, Robert; Lapkiewicz, Radek; Ramelow, Sven; Zeilinger, Anton
2014-04-29
Entangled quantum systems have properties that have fundamentally overthrown the classical worldview. Increasing the complexity of entangled states by expanding their dimensionality allows the implementation of novel fundamental tests of nature, and moreover also enables genuinely new protocols for quantum information processing. Here we present the creation of a (100 × 100)-dimensional entangled quantum system, using spatial modes of photons. For its verification we develop a novel nonlinear criterion which infers entanglement dimensionality of a global state by using only information about its subspace correlations. This allows very practical experimental implementation as well as highly efficient extraction of entanglement dimensionality information. Applications in quantum cryptography and other protocols are very promising. PMID:24706902
Generation and confirmation of a (100 × 100)-dimensional entangled quantum system
Krenn, Mario; Huber, Marcus; Fickler, Robert; Lapkiewicz, Radek; Ramelow, Sven; Zeilinger, Anton
2014-01-01
Entangled quantum systems have properties that have fundamentally overthrown the classical worldview. Increasing the complexity of entangled states by expanding their dimensionality allows the implementation of novel fundamental tests of nature, and moreover also enables genuinely new protocols for quantum information processing. Here we present the creation of a (100 × 100)-dimensional entangled quantum system, using spatial modes of photons. For its verification we develop a novel nonlinear criterion which infers entanglement dimensionality of a global state by using only information about its subspace correlations. This allows very practical experimental implementation as well as highly efficient extraction of entanglement dimensionality information. Applications in quantum cryptography and other protocols are very promising. PMID:24706902
Quantum-locked key distribution at nearly the classical capacity rate.
Lupo, Cosmo; Lloyd, Seth
2014-10-17
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit. PMID:25361242
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-01-01
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs. PMID:24919012
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids.
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham-Yahalom logic. PMID:27007951
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-01-01
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs. PMID:24919012
NASA Astrophysics Data System (ADS)
Jungeblut, T.; Puttmann, C.; Dreesen, R.; Porrmann, M.; Thies, M.; Rückert, U.; Kastens, U.
2010-12-01
The secure transmission of data plays a significant role in today's information era. Especially in the area of public-key-cryptography methods, which are based on elliptic curves (ECC), gain more and more importance. Compared to asymmetric algorithms, like RSA, ECC can be used with shorter key lengths, while achieving an equal level of security. The performance of ECC-algorithms can be increased significantly by adding application specific hardware extensions. Due to their fine grained parallelism, VLIW-processors are well suited for the execution of ECC algorithms. In this work, we extended the fourfold parallel CoreVA-VLIW-architecture by several hardware accelerators to increase the resource efficiency of the overall system. For the design-space exploration we use a dual design flow, which is based on the automatic generation of a complete C-compiler based tool chain from a central processor specification. Using the hardware accelerators the performance of the scalar multiplication on binary fields can be increased by the factor of 29. The energy consumption can be reduced by up to 90%. The extended processor hardware was mapped on a current 65 nm low-power standard-cell-technology. The chip area of the CoreVA-VLIW-architecture is 0.24 mm2 at a power consumption of 29 mW/MHz. The performance gain is analyzed in respect to the increased hardware costs, as chip area or power consumption.
Evaluating security of a clone preventive techinque using physical randomness and cryptography
NASA Astrophysics Data System (ADS)
Matsumoto, Hiroyuki; Matsumoto, Tsutomu
2000-04-01
Clone resistance of most of all anti-counterfeiting techniques depends upon secret identifiers or difficulty of reproduction. However, these kinds of techniques are no use if a counterfeiter has enough financial a power to work the secret out or toe overcome the difficulty. We have focused on, among others, random patterns which can be inevitably difficult to reproduce. Consequently, we have developed a document protection system which utilizes random patterns of magnetic micro-fibers in substrates of documents. We have also applied cryptography to the system. The system verifies and authenticates a stochastic feature using pre-stored template data and a digital signature. The stochastic feature and the digital signature respectively prevent 'dead copying' and counterfeiting/alteration of the recorded data such as a value of the card. Therefore security of the system depends upon difficulty both in reproduction of the stochastic feature and in analysis of the digital signature. We have evalut3ed the security of the system for several kinds of criminal attacks. Some criminals may try to counterfeit a stochastic feature by modeling on a genuine document. In our paper we discuss security evaluation of our document protection system against such kinds of criminal methods and also discus a countermeasure and its difficulty.
An Interoperability Consideration in Selecting Domain Parameters for Elliptic Curve Cryptography
NASA Technical Reports Server (NTRS)
Ivancic, Will (Technical Monitor); Eddy, Wesley M.
2005-01-01
Elliptic curve cryptography (ECC) will be an important technology for electronic privacy and authentication in the near future. There are many published specifications for elliptic curve cryptosystems, most of which contain detailed descriptions of the process for the selection of domain parameters. Selecting strong domain parameters ensures that the cryptosystem is robust to attacks. Due to a limitation in several published algorithms for doubling points on elliptic curves, some ECC implementations may produce incorrect, inconsistent, and incompatible results if domain parameters are not carefully chosen under a criterion that we describe. Few documents specify the addition or doubling of points in such a manner as to avoid this problematic situation. The safety criterion we present is not listed in any ECC specification we are aware of, although several other guidelines for domain selection are discussed in the literature. We provide a simple example of how a set of domain parameters not meeting this criterion can produce catastrophic results, and outline a simple means of testing curve parameters for interoperable safety over doubling.
Deciphering the language of nature: cryptography, secrecy, and alterity in Francis Bacon.
Clody, Michael C
2011-01-01
The essay argues that Francis Bacon's considerations of parables and cryptography reflect larger interpretative concerns of his natural philosophic project. Bacon describes nature as having a language distinct from those of God and man, and, in so doing, establishes a central problem of his natural philosophy—namely, how can the language of nature be accessed through scientific representation? Ultimately, Bacon's solution relies on a theory of differential and duplicitous signs that conceal within them the hidden voice of nature, which is best recognized in the natural forms of efficient causality. The "alphabet of nature"—those tables of natural occurrences—consequently plays a central role in his program, as it renders nature's language susceptible to a process and decryption that mirrors the model of the bilateral cipher. It is argued that while the writing of Bacon's natural philosophy strives for literality, its investigative process preserves a space for alterity within scientific representation, that is made accessible to those with the interpretative key. PMID:22371983
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham- Yahalom logic. PMID:27007951
Securing display of grayscale and multicolored images by use of visual cryptography
NASA Astrophysics Data System (ADS)
Yamamoto, Hirotsugu; Hayasaki, Yoshio; Nishida, Nobuo
2004-06-01
Security has become an important issue as information technology has become increasingly pervasive in our everyday lives. Security risks arise with a display that shows decrypted information. In this paper, we propose a secure information display technique using visual cryptography. Its decryption requires no special computing devices and is implemented using only human vision: the proposed display appears as a random pattern to anyone who looks at it unless the person views the displayed image through a decoding mask. We have constructed code sets to represent grayscale and multicolored images. Each pixel in a secret image is expanded to a group of subpixels. The displayed image consists of black and white subpixels to encrypt a grayscale image. To encrypt a multicolor image, black, red, green, and blue subpixels compose the displayed image. The decoding mask consists of transparent and opaque subpixels. Every pixel is encrypted using a pair that is chosen at random. We have demonstrated the proposed secure display with an LCD panel and a transparency on which a decoding mask was printed. The secret image was visible for a viewer within the viewing zone, although viewers outside the viewing zone perceived it as a random dot pattern.
Modular exponential accelerator chip based on precomputations for RSA cryptography application
NASA Astrophysics Data System (ADS)
Ramschie, Victor W.; Hariz, Alex; Haskard, Malcolm R.
1999-10-01
A new algorithm, Square-and-Multiply for Modular Exponentiation (SMME), is proposed to calculate a modular exponentiation that is the core arithmetic function in RSA cryptography. The SMME scans the exponent form its MSB and pre-computes a set of exponents to the maximum bit length of l. These pre-computed exponents are stored in a look-up table. By using the look-up table, the number of multiplications required for modular exponentiation can be reduced. Modular multiplications are performed using a modified Montgomery's algorithm. The SMME takes in the order of n2(1 + 1(2l)) cycles to execute one n-bit modular exponentiation. The memory size to accommodate the pre- computed exponents is a 2l-1 (n + 1)-bit RAM. The SMME, with its regularity and local connections in a systolic array, makes it suitable for VLSI implementation. A 64-bit modular exponentiation chip is being designed using a 0.8 micrometers CMOS standard cell library from AMS. The simulation result show that at 25 MHz, the throughput is approximately 236 KBps; and an estimation of 40 KBps for a 512-bit exponent.
Quantum correlation via quantum coherence
NASA Astrophysics Data System (ADS)
Yu, Chang-shui; Zhang, Yang; Zhao, Haiqing
2014-06-01
Quantum correlation includes quantum entanglement and quantum discord. Both entanglement and discord have a common necessary condition—quantum coherence or quantum superposition. In this paper, we attempt to give an alternative understanding of how quantum correlation is related to quantum coherence. We divide the coherence of a quantum state into several classes and find the complete coincidence between geometric (symmetric and asymmetric) quantum discords and some particular classes of quantum coherence. We propose a revised measure for total coherence and find that this measure can lead to a symmetric version of geometric quantum correlation, which is analytic for two qubits. In particular, this measure can also arrive at a monogamy equality on the distribution of quantum coherence. Finally, we also quantify a remaining type of quantum coherence and find that for two qubits, it is directly connected with quantum nonlocality.
Molotkov, S. N.
2012-05-15
The fundamental quantum mechanics prohibitions on the measurability of quantum states allow secure key distribution between spatially remote users to be performed. Experimental and commercial implementations of quantum cryptography systems, however, use components that exist at the current technology level, in particular, one-photon avalanche photodetectors. These detectors are subject to the blinding effect. It was shown that all the known basic quantum key distribution protocols and systems based on them are vulnerable to attacks with blinding of photodetectors. In such attacks, an eavesdropper knows all the key transferred, does not produce errors at the reception side, and remains undetected. Three protocols of quantum key distribution stable toward such attacks are suggested. The security of keys and detection of eavesdropping attempts are guaranteed by the internal structure of protocols themselves rather than additional technical improvements.
Quantum-secure covert communication on bosonic channels
NASA Astrophysics Data System (ADS)
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-10-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
Quantum-secure covert communication on bosonic channels
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth—that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary—for example, thermal noise from blackbody radiation—the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary. PMID:26478089
Quantum-secure covert communication on bosonic channels.
Bash, Boulat A; Gheorghe, Andrei H; Patel, Monika; Habif, Jonathan L; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary. PMID:26478089
Arbitrated Quantum Signature Scheme with Continuous-Variable Coherent States
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Huang, Dazu; Shi, Jinjing
2016-04-01
Motivated by the revealing features of the continuous-variable (CV) quantum cryptography, we suggest an arbitrated quantum signature (AQS) protocol with CV coherent states. It involves three participants, i.e., the signer Alice, the verifier Bob and the arbitrator Charlie who is trustworthy by Alice and Bob. Three phases initializing phase, signing phase and verifying phase are included in our protocol. The security of the signature scheme is guaranteed by the generation of the shared keys via the CV-based quantum key distribution (CV-QKD) and the implementation process of the CV-based quantum teleportation as well. Security analysis demonstrates that the signature can be neither forged by anyone nor disavowed by the receiver and signer. Moreover, the authenticity and integrality of the transmitted messages can be ensured. The paper shows that a potential high-speed quantum signature scheme with high detection efficiency and repetition rate can be realized when compared to the discrete-variable (DV) quantum signature scheme attributing to the well characteristics of CV-QKD.
Entanglement enhances security in quantum communication
NASA Astrophysics Data System (ADS)
Demkowicz-Dobrzański, Rafał; Sen(de), Aditi; Sen, Ujjwal; Lewenstein, Maciej
2009-07-01
Secret sharing is a protocol in which a “boss” wants to send a classical message secretly to two “subordinates,” such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing—a parallel of the Csiszár-Körner criterion in single-receiver classical cryptography.
Measurement-device-independent quantum coin tossing
NASA Astrophysics Data System (ADS)
Zhao, Liangyuan; Yin, Zhenqiang; Wang, Shuang; Chen, Wei; Chen, Hua; Guo, Guangcan; Han, Zhengfu
2015-12-01
Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest. However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice, which will possibly make the protocol completely insecure. Here, we report a simple strategy of a detector-blinding attack based on a recent experiment. To remove all the detector side channels, we present a solution of measurement-device-independent QCT (MDI-QCT). This method is similar to the idea of MDI quantum key distribution (QKD). MDI-QCT is loss tolerant with single-photon sources and has the same bias as the original loss-tolerant QCT under a coherent attack. Moreover, it provides the potential advantage of doubling the secure distance for some special cases. Finally, MDI-QCT can also be modified to fit the weak coherent-state sources. Thus, based on the rapid development of practical MDI-QKD, our proposal can be implemented easily.
NASA Astrophysics Data System (ADS)
Georgescu, I. M.; Ashhab, S.; Nori, Franco
2014-01-01
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable or accessible quantum system, i.e., quantum simulation. Quantum simulation promises to have applications in the study of many problems in, e.g., condensed-matter physics, high-energy physics, atomic physics, quantum chemistry, and cosmology. Quantum simulation could be implemented using quantum computers, but also with simpler, analog devices that would require less control, and therefore, would be easier to construct. A number of quantum systems such as neutral atoms, ions, polar molecules, electrons in semiconductors, superconducting circuits, nuclear spins, and photons have been proposed as quantum simulators. This review outlines the main theoretical and experimental aspects of quantum simulation and emphasizes some of the challenges and promises of this fast-growing field.
NASA Astrophysics Data System (ADS)
Gaidash, A. A.; Egorov, V. I.; Gleim, A. V.
2014-10-01
Quantum cryptography in theory allows distributing secure keys between two users so that any performed eavesdropping attempt would be immediately discovered. However, in practice an eavesdropper can obtain key information from multi-photon states when attenuated laser radiation is used as a source. In order to overcome this possibility, it is generally suggested to implement special cryptographic protocols, like decoy states or SARG04. We present an alternative method based on monitoring photon number statistics after detection. This method can therefore be used with any existing protocol.
Transmission medium and full fiber-optic setup for quantum key distribution applications
NASA Astrophysics Data System (ADS)
Tsakiris, Stavros I.; Uzunoglu, Nikolaos K.
2006-12-01
A fiber-optic-based coupled waveguide transmission medium is proposed to distribute secret keys in a single-photon polarization-based quantum cryptography setup. Polarization maintenance properties and coupling phenomena of the transmission medium are exploited to achieve accuracy and security of the transferred key. Elliptic fibers and fiber couplers are used to prepare the transmitted photons at the sender as well as analyze them at the receiver. The uniqueness of the setup stands on the exclusive use of fiber-optic components, enabling its construction on a single fiber line.
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
NASA Astrophysics Data System (ADS)
Buhrman, Harry; Christandl, Matthias; Schaffner, Christian
2012-10-01
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other’s input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice.
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope
NASA Astrophysics Data System (ADS)
Feist, Armin; Echternkamp, Katharina E.; Schauss, Jakob; Yalunin, Sergey V.; Schäfer, Sascha; Ropers, Claus
2015-05-01
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven `quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.
Scalable quantum information processing with photons and atoms
NASA Astrophysics Data System (ADS)
Pan, Jian-Wei
Over the past three decades, the promises of super-fast quantum computing and secure quantum cryptography have spurred a world-wide interest in quantum information, generating fascinating quantum technologies for coherent manipulation of individual quantum systems. However, the distance of fiber-based quantum communications is limited due to intrinsic fiber loss and decreasing of entanglement quality. Moreover, probabilistic single-photon source and entanglement source demand exponentially increased overheads for scalable quantum information processing. To overcome these problems, we are taking two paths in parallel: quantum repeaters and through satellite. We used the decoy-state QKD protocol to close the loophole of imperfect photon source, and used the measurement-device-independent QKD protocol to close the loophole of imperfect photon detectors--two main loopholes in quantum cryptograph. Based on these techniques, we are now building world's biggest quantum secure communication backbone, from Beijing to Shanghai, with a distance exceeding 2000 km. Meanwhile, we are developing practically useful quantum repeaters that combine entanglement swapping, entanglement purification, and quantum memory for the ultra-long distance quantum communication. The second line is satellite-based global quantum communication, taking advantage of the negligible photon loss and decoherence in the atmosphere. We realized teleportation and entanglement distribution over 100 km, and later on a rapidly moving platform. We are also making efforts toward the generation of multiphoton entanglement and its use in teleportation of multiple properties of a single quantum particle, topological error correction, quantum algorithms for solving systems of linear equations and machine learning. Finally, I will talk about our recent experiments on quantum simulations on ultracold atoms. On the one hand, by applying an optical Raman lattice technique, we realized a two-dimensional spin-obit (SO
Quantum networks reveal quantum nonlocality.
Cavalcanti, Daniel; Almeida, Mafalda L; Scarani, Valerio; Acín, Antonio
2011-01-01
The results of local measurements on some composite quantum systems cannot be reproduced classically. This impossibility, known as quantum nonlocality, represents a milestone in the foundations of quantum theory. Quantum nonlocality is also a valuable resource for information-processing tasks, for example, quantum communication, quantum key distribution, quantum state estimation or randomness extraction. Still, deciding whether a quantum state is nonlocal remains a challenging problem. Here, we introduce a novel approach to this question: we study the nonlocal properties of quantum states when distributed and measured in networks. We show, using our framework, how any one-way entanglement distillable state leads to nonlocal correlations and prove that quantum nonlocality is a non-additive resource, which can be activated. There exist states, local at the single-copy level, that become nonlocal when taking several copies of them. Our results imply that the nonlocality of quantum states strongly depends on the measurement context. PMID:21304513
Experimental quantum key distribution with finite-key security analysis for noisy channels
NASA Astrophysics Data System (ADS)
Bacco, Davide; Canale, Matteo; Laurenti, Nicola; Vallone, Giuseppe; Villoresi, Paolo
2013-09-01
In quantum key distribution implementations, each session is typically chosen long enough so that the secret key rate approaches its asymptotic limit. However, this choice may be constrained by the physical scenario, as in the perspective use with satellites, where the passage of one terminal over the other is restricted to a few minutes. Here we demonstrate experimentally the extraction of secure keys leveraging an optimal design of the prepare-and-measure scheme, according to recent finite-key theoretical tight bounds. The experiment is performed in different channel conditions, and assuming two distinct attack models: individual attacks or general quantum attacks. The request on the number of exchanged qubits is then obtained as a function of the key size and of the ambient quantum bit error rate. The results indicate that viable conditions for effective symmetric, and even one-time-pad, cryptography are achievable.
Security bound of two-basis quantum-key-distribution protocols using qudits
Nikolopoulos, Georgios M.; Alber, Gernot
2005-09-15
We investigate the security bounds of quantum-cryptographic protocols using d-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.
A generator for unique quantum random numbers based on vacuum states
NASA Astrophysics Data System (ADS)
Gabriel, Christian; Wittmann, Christoffer; Sych, Denis; Dong, Ruifang; Mauerer, Wolfgang; Andersen, Ulrik L.; Marquardt, Christoph; Leuchs, Gerd
2010-10-01
Random numbers are a valuable component in diverse applications that range from simulations over gambling to cryptography. The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational unpredictability of quantum mechanics. However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique. Here we present a simple experimental setup based on homodyne measurements that uses the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators.
Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network
NASA Astrophysics Data System (ADS)
Tang, Yan-Lin; Yin, Hua-Lei; Zhao, Qi; Liu, Hui; Sun, Xiang-Xiang; Huang, Ming-Qi; Zhang, Wei-Jun; Chen, Si-Jing; Zhang, Lu; You, Li-Xing; Wang, Zhen; Liu, Yang; Lu, Chao-Yang; Jiang, Xiao; Ma, Xiongfeng; Zhang, Qiang; Chen, Teng-Yun; Pan, Jian-Wei
2016-01-01
Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.
Stapp, H.P.
1988-12-01
Quantum ontologies are conceptions of the constitution of the universe that are compatible with quantum theory. The ontological orientation is contrasted to the pragmatic orientation of science, and reasons are given for considering quantum ontologies both within science, and in broader contexts. The principal quantum ontologies are described and evaluated. Invited paper at conference: Bell's Theorem, Quantum Theory, and Conceptions of the Universe, George Mason University, October 20-21, 1988. 16 refs.
Local Random Quantum Circuits are Approximate Polynomial-Designs
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-08-01
We prove that local random quantum circuits acting on n qubits composed of O(t 10 n 2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t 10 n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n k ) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n (k-9)/11) that are given oracle access to U.
High-capacity quantum Fibonacci coding for key distribution
NASA Astrophysics Data System (ADS)
Simon, David S.; Lawrence, Nate; Trevino, Jacob; Dal Negro, Luca; Sergienko, Alexander V.
2013-03-01
Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.
Quantum anonymous voting with unweighted continuous-variable graph states
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Zeng, Guihua
2016-08-01
Motivated by the revealing topological structures of continuous-variable graph state (CVGS), we investigate the design of quantum voting scheme, which has serious advantages over the conventional ones in terms of efficiency and graphicness. Three phases are included, i.e., the preparing phase, the voting phase and the counting phase, together with three parties, i.e., the voters, the tallyman and the ballot agency. Two major voting operations are performed on the yielded CVGS in the voting process, namely the local rotation transformation and the displacement operation. The voting information is carried by the CVGS established before hand, whose persistent entanglement is deployed to keep the privacy of votes and the anonymity of legal voters. For practical applications, two CVGS-based quantum ballots, i.e., comparative ballot and anonymous survey, are specially designed, followed by the extended ballot schemes for the binary-valued and multi-valued ballots under some constraints for the voting design. Security is ensured by entanglement of the CVGS, the voting operations and the laws of quantum mechanics. The proposed schemes can be implemented using the standard off-the-shelf components when compared to discrete-variable quantum voting schemes attributing to the characteristics of the CV-based quantum cryptography.
Quantum anonymous voting with unweighted continuous-variable graph states
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Zeng, Guihua
2016-05-01
Motivated by the revealing topological structures of continuous-variable graph state (CVGS), we investigate the design of quantum voting scheme, which has serious advantages over the conventional ones in terms of efficiency and graphicness. Three phases are included, i.e., the preparing phase, the voting phase and the counting phase, together with three parties, i.e., the voters, the tallyman and the ballot agency. Two major voting operations are performed on the yielded CVGS in the voting process, namely the local rotation transformation and the displacement operation. The voting information is carried by the CVGS established before hand, whose persistent entanglement is deployed to keep the privacy of votes and the anonymity of legal voters. For practical applications, two CVGS-based quantum ballots, i.e., comparative ballot and anonymous survey, are specially designed, followed by the extended ballot schemes for the binary-valued and multi-valued ballots under some constraints for the voting design. Security is ensured by entanglement of the CVGS, the voting operations and the laws of quantum mechanics. The proposed schemes can be implemented using the standard off-the-shelf components when compared to discrete-variable quantum voting schemes attributing to the characteristics of the CV-based quantum cryptography.
Quantum Computer Games: Quantum Minesweeper
ERIC Educational Resources Information Center
Gordon, Michal; Gordon, Goren
2010-01-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…
NASA Astrophysics Data System (ADS)
Pfeiffer, P.; Egusquiza, I. L.; di Ventra, M.; Sanz, M.; Solano, E.
2016-07-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.
Pfeiffer, P; Egusquiza, I L; Di Ventra, M; Sanz, M; Solano, E
2016-01-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems. PMID:27381511
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E.
2016-01-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems. PMID:27381511
Quantum Error Correction with Biased Noise
NASA Astrophysics Data System (ADS)
Brooks, Peter
Quantum computing offers powerful new techniques for speeding up the calculation of many classically intractable problems. Quantum algorithms can allow for the efficient simulation of physical systems, with applications to basic research, chemical modeling, and drug discovery; other algorithms have important implications for cryptography and internet security. At the same time, building a quantum computer is a daunting task, requiring the coherent manipulation of systems with many quantum degrees of freedom while preventing environmental noise from interacting too strongly with the system. Fortunately, we know that, under reasonable assumptions, we can use the techniques of quantum error correction and fault tolerance to achieve an arbitrary reduction in the noise level. In this thesis, we look at how additional information about the structure of noise, or "noise bias," can improve or alter the performance of techniques in quantum error correction and fault tolerance. In Chapter 2, we explore the possibility of designing certain quantum gates to be extremely robust with respect to errors in their operation. This naturally leads to structured noise where certain gates can be implemented in a protected manner, allowing the user to focus their protection on the noisier unprotected operations. In Chapter 3, we examine how to tailor error-correcting codes and fault-tolerant quantum circuits in the presence of dephasing biased noise, where dephasing errors are far more common than bit-flip errors. By using an appropriately asymmetric code, we demonstrate the ability to improve the amount of error reduction and decrease the physical resources required for error correction. In Chapter 4, we analyze a variety of protocols for distilling magic states, which enable universal quantum computation, in the presence of faulty Clifford operations. Here again there is a hierarchy of noise levels, with a fixed error rate for faulty gates, and a second rate for errors in the distilled
Dissipative production of a maximally entangled steady state of two quantum bits
NASA Astrophysics Data System (ADS)
Lin, Y.; Gaebler, J. P.; Reiter, F.; Tan, T. R.; Bowler, R.; Sørensen, A. S.; Leibfried, D.; Wineland, D. J.
2013-12-01
Entangled states are a key resource in fundamental quantum physics, quantum cryptography and quantum computation. Introduction of controlled unitary processes--quantum gates--to a quantum system has so far been the most widely used method to create entanglement deterministically. These processes require high-fidelity state preparation and minimization of the decoherence that inevitably arises from coupling between the system and the environment, and imperfect control of the system parameters. Here we combine unitary processes with engineered dissipation to deterministically produce and stabilize an approximate Bell state of two trapped-ion quantum bits (qubits), independent of their initial states. Compared with previous studies that involved dissipative entanglement of atomic ensembles or the application of sequences of multiple time-dependent gates to trapped ions, we implement our combined process using trapped-ion qubits in a continuous time-independent fashion (analogous to optical pumping of atomic states). By continuously driving the system towards the steady state, entanglement is stabilized even in the presence of experimental noise and decoherence. Our demonstration of an entangled steady state of two qubits represents a step towards dissipative state engineering, dissipative quantum computation and dissipative phase transitions. Following this approach, engineered coupling to the environment may be applied to a broad range of experimental systems to achieve desired quantum dynamics or steady states. Indeed, concurrently with this work, an entangled steady state of two superconducting qubits was demonstrated using dissipation.
NASA Astrophysics Data System (ADS)
Ohori, Daisuke; Fukuyama, Atsuhiko; Thomas, Cedric; Higo, Akio; Samukawa, Seiji; Ikari, Tetsuo
2016-09-01
We demonstrated that the lattice-matched GaAs quantum nanodisks (QNDs) embedded in an AlGaAs matrix were fabricated by our original top-down nanoprocess. Lattice-matched GaAs QNDs are very attractive in quantum cryptography because the spin relaxation time of QNDs might be longer than that of strained quantum dots. Quantum levels of QNDs were investigated by the photoluminescence (PL) technique. The minimum diameter and thickness of QNDs were 7 and 8 nm, respectively. PL peaks of QNDs at 1.64 and 1.66 eV were observed to be higher than that of multiple quantum wells (MQWs) observed at 1.57 eV. It is suggested that these peaks are due to the diameter distribution of QNDs. The calculated quantum levels were in good agreement with the present experimental results. The observation of the PL peaks from QNDs demonstrates that the quantum level is strongly confined not only in the perpendicular direction but also in the lateral direction.
Completely device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin
2016-08-01
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
EDITORIAL The 17th Central European Workshop on Quantum Optics
NASA Astrophysics Data System (ADS)
Man'ko, Margarita A.
2011-02-01
Although the origin of quantum optics can be traced back to the beginning of the 20th century, when the fundamental ideas about the quantum nature of the interaction between light and matter were put forward, the splendid blossoming of this part of physics began half a century later, after the invention of masers and lasers. It is remarkable that after another half a century the tree of quantum optics is not only very strong and spreading, but all its branches continue to grow, showing new beautiful blossoms and giving very useful fruits. A reflection of this progress has been the origin and development of the series of annual events called the Central European Workshops on Quantum Optics (CEWQO). They started at the beginning of the 1990s as rather small meetings of physicists from a few countries in central-eastern Europe, but in less than two decades they have transformed into important events, gathering 100 to 200 participants from practically all European countries. Moreover, many specialists from other continents like to attend these meetings, since they provide an excellent chance to hear about the latest results and new directions of research. Regarding this, it seems worth mentioning at least some of the most interesting and important areas of quantum optics that have attracted the attention of researchers for the past two decades. One of these areas is quantum information, which over the course of time has become an almost independent area of quantum physics. But it still maintains very close ties with quantum optics. The specific parts of this area are, in particular, quantum computing, quantum communication and quantum cryptography, and the problem of quantitative description of such genuine quantum phenomena as entanglement is one of the central items in the current stream of publications. Theory and experiment related to quantum tomography have also become important to contemporary quantum optics. They are closely related to the subject of so
Quantum robots and quantum computers
Benioff, P.
1998-07-01
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and systems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.
Quantum hair and quantum gravity
Coleman, S. ); Krauss, L.M. ); Preskill, J. ); Wilczek, F. )
1992-01-01
A black hole may carry quantum numbers that are not associated with massless gauge fields, contrary to the spirit of the 'no-hair' theorems. The 'quantum hair' is invisible in the classical limit, but measurable via quantum interference experiments. Quantum hair alters the temperature of the radiation emitted by a black hole. It also induces non-zero expectation values for fields outside the event horizon; these expectation values are non-perturbative in [Dirac h], and decay exponentially far from the hole. The existence of quantum hair demonstrates that a black hole can have an intricate quantum-mechanical structure that is completely missed by standard semiclassical theory.
Zurek, Wojciech H
2008-01-01
Quantum Darwinism - proliferation, in the environment, of multiple records of selected states of the system (its information-theoretic progeny) - explains how quantum fragility of individual state can lead to classical robustness of their multitude.
NASA Astrophysics Data System (ADS)
Harju, Antti J.
2016-06-01
This is a study of orbifold-quotients of quantum groups (quantum orbifolds {Θ } rightrightarrows Gq). These structures have been studied extensively in the case of the quantum S U 2 group. A generalized theory of quantum orbifolds over compact simple and simply connected quantum groups is developed. Associated with a quantum orbifold there is an invariant subalgebra and a crossed product algebra. For each spin quantum orbifold, there is a unitary equivalence class of Dirac spectral triples over the invariant subalgebra, and for each effective spin quantum orbifold associated with a finite group action, there is a unitary equivalence class of Dirac spectral triples over the crossed product algebra. A Hopf-equivariant Fredholm index problem is studied as an application.
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E.
2016-07-06
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantummore » regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. As a result, the proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.« less
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-08-01
A novel image encryption system based on double random phase encoding (DRPE) and RSA public-key algorithm is proposed. The main characteristic of the system is that each encryption process produces a new decryption key (even for the same plaintext), thus the encryption system conforms to the feature of the one-time pad (OTP) cryptography. The other characteristic of the system is the use of fingerprint key. Only with the rightful authorization will the true decryption be obtained, otherwise the decryption will result in noisy images. So the proposed system can be used to determine whether the ciphertext is falsified by attackers. In addition, the system conforms to the basic agreement of asymmetric cryptosystem (ACS) due to the combination with the RSA public-key algorithm. The simulation results show that the encryption scheme has high robustness against the existing attacks.
NASA Astrophysics Data System (ADS)
Moulick, Subhayan Roy; Panigrahi, Prasanta K.
2016-06-01
We propose the idea of a quantum cheque scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a quantum cheque and present the first unconditionally secure quantum cheque scheme and show it to be secure against any no-signalling adversary. The proposed quantum cheque scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.
NASA Astrophysics Data System (ADS)
Moulick, Subhayan Roy; Panigrahi, Prasanta K.
2016-03-01
We propose the idea of a quantum cheque scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a quantum cheque and present the first unconditionally secure quantum cheque scheme and show it to be secure against any no-signalling adversary. The proposed quantum cheque scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.
NASA Astrophysics Data System (ADS)
Brown, Matthew J.
2014-02-01
The framework of quantum frames can help unravel some of the interpretive difficulties i the foundation of quantum mechanics. In this paper, I begin by tracing the origins of this concept in Bohr's discussion of quantum theory and his theory of complementarity. Engaging with various interpreters and followers of Bohr, I argue that the correct account of quantum frames must be extended beyond literal space-time reference frames to frames defined by relations between a quantum system and the exosystem or external physical frame, of which measurement contexts are a particularly important example. This approach provides superior solutions to key EPR-type measurement and locality paradoxes.
Practical quantum key distribution protocol without monitoring signal disturbance.
Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato
2014-05-22
Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD. PMID:24848060
NASA Astrophysics Data System (ADS)
Steffen, Matthias
2013-03-01
Quantum mechanics plays a crucial role in many day-to-day products, and has been successfully used to explain a wide variety of observations in Physics. While some quantum effects such as tunneling limit the degree to which modern CMOS devices can be scaled to ever reducing dimensions, others may potentially be exploited to build an entirely new computing architecture: The quantum computer. In this talk I will review several basic concepts of a quantum computer. Why quantum computing and how do we do it? What is the status of several (but not all) approaches towards building a quantum computer, including IBM's approach using superconducting qubits? And what will it take to build a functional machine? The promise is that a quantum computer could solve certain interesting computational problems such as factoring using exponentially fewer computational steps than classical systems. Although the most sophisticated modern quantum computing experiments to date do not outperform simple classical computations, it is increasingly becoming clear that small scale demonstrations with as many as 100 qubits are beginning to be within reach over the next several years. Such a demonstration would undoubtedly be a thrilling feat, and usher in a new era of controllably testing quantum mechanics or quantum computing aspects. At the minimum, future demonstrations will shed much light on what lies ahead.
NASA Astrophysics Data System (ADS)
Ryabov, V. A.
2015-08-01
Quantum systems in a mechanical embedding, the breathing mode of a small particles, optomechanical system, etc. are far not the full list of examples in which the volume exhibits quantum behavior. Traditional consideration suggests strain in small systems as a result of a collective movement of particles, rather than the dynamics of the volume as an independent variable. The aim of this work is to show that some problem here might be essentially simplified by introducing periodic boundary conditions. At this case, the volume is considered as the independent dynamical variable driven by the internal pressure. For this purpose, the concept of quantum volume based on Schrödinger’s equation in 𝕋3 manifold is proposed. It is used to explore several 1D model systems: An ensemble of free particles under external pressure, quantum manometer and a quantum breathing mode. In particular, the influence of the pressure of free particle on quantum oscillator is determined. It is shown also that correction to the spectrum of the breathing mode due to internal degrees of freedom is determined by the off-diagonal matrix elements of the quantum stress. The new treatment not using the “force” theorem is proposed for the quantum stress tensor. In the general case of flexible quantum 3D dynamics, quantum deformations of different type might be introduced similarly to monopole mode.
Quantum games as quantum types
NASA Astrophysics Data System (ADS)
Delbecque, Yannick
In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a lambda-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other
Exciton fine-structure splitting in GaN/AlN quantum dots
NASA Astrophysics Data System (ADS)
Kindel, C.; Kako, S.; Kawano, T.; Oishi, H.; Arakawa, Y.; Hönig, G.; Winkelnkemper, M.; Schliwa, A.; Hoffmann, A.; Bimberg, D.
2010-06-01
Exciton bright-state fine-structure splitting (FSS) in single GaN/AlN quantum dots (QDs) is reported, presenting an important step toward the realization of room temperature single-qubit emitters for quantum cryptography and communication. The FSS in nitride QDs is up to 7 meV and thus much larger than for other QD systems. We find also a surprising dependence of FSS on the QD size, inverse to that of arsenide QDs. Now we are able to explain why FSS can only be observed in small QDs of high-emission energies. Our calculations reveal a shape/strain anisotropy as origin of the large FSS allowing different approaches to control FSS in nitrides.
Augusiak, Remigiusz; Horodecki, Pawel
2006-07-15
It is shown that Smolin four-qubit bound entangled states [J. A. Smolin, Phys. Rev. A 63, 032306 (2001)] can maximally violate the simple two-setting Bell inequality similar to the standard Clauser-Horne-Shimony-Holt (CHSH) inequality. The simplicity of the setting and the robustness of the entanglement make it promising for current experimental technology. On the other hand, the entanglement does not allow for secure key distillation, so neither entanglement nor maximal violation of Bell inequalities implies directly the presence of a quantum secure key. As a result, one concludes that two tasks--reducing of communication complexity and cryptography--are not (even qualitatively) equivalent in a quantum multipartite scenario.
NASA Astrophysics Data System (ADS)
Levy, Amikam; Diósi, Lajos; Kosloff, Ronnie
2016-05-01
In this work we present the concept of a quantum flywheel coupled to a quantum heat engine. The flywheel stores useful work in its energy levels, while additional power is extracted continuously from the device. Generally, the energy exchange between a quantum engine and a quantized work repository is accompanied by heat, which degrades the charging efficiency. Specifically when the quantum harmonic oscillator acts as a work repository, quantum and thermal fluctuations dominate the dynamics. Quantum monitoring and feedback control are applied to the flywheel in order to reach steady state and regulate its operation. To maximize the charging efficiency one needs a balance between the information gained by measuring the system and the information fed back to the system. The dynamics of the flywheel are described by a stochastic master equation that accounts for the engine, the external driving, the measurement, and the feedback operations.
NASA Astrophysics Data System (ADS)
Xu, Ping
We introduce a general notion of quantum universal enveloping algebroids (QUE algebroids), or quantum groupoids, as a unification of quantum groups and star-products. Some basic properties are studied including the twist construction and the classical limits. In particular, we show that a quantum groupoid naturally gives rise to a Lie bialgebroid as a classical limit. Conversely, we formulate a conjecture on the existence of a quantization for any Lie bialgebroid, and prove this conjecture for the special case of regular triangular Lie bialgebroids. As an application of this theory, we study the dynamical quantum groupoid , which gives an interpretation of the quantum dynamical Yang-Baxter equation in terms of Hopf algebroids.
NASA Astrophysics Data System (ADS)
Braun, Daniel; Giraud, Olivier; Braun, Peter A.
2010-03-01
We introduce and study a measure of ``quantumness'' of a quantum state based on its Hilbert-Schmidt distance from the set of classical states. ``Classical states'' were defined earlier as states for which a positive P-function exists, i.e. they are mixtures of coherent states [1]. We study invariance properties of the measure, upper bounds, and its relation to entanglement measures. We evaluate the quantumness of a number of physically interesting states and show that for any physical system in thermal equilibrium there is a finite critical temperature above which quantumness vanishes. We then use the measure for identifying the ``most quantum'' states. Such states are expected to be potentially most useful for quantum information theoretical applications. We find these states explicitly for low-dimensional spin-systems, and show that they possess beautiful, highly symmetric Majorana representations. [4pt] [1] Classicality of spin states, Olivier Giraud, Petr Braun, and Daniel Braun, Phys. Rev. A 78, 042112 (2008)
Coleman, Piers; Schofield, Andrew J
2005-01-20
As we mark the centenary of Albert Einstein's seminal contribution to both quantum mechanics and special relativity, we approach another anniversary--that of Einstein's foundation of the quantum theory of solids. But 100 years on, the same experimental measurement that puzzled Einstein and his contemporaries is forcing us to question our understanding of how quantum matter transforms at ultra-low temperatures. PMID:15662409
NASA Astrophysics Data System (ADS)
Wang, Huiquan; Wu, Junjie; He, Hongjuan; Tang, Yuhua
2016-08-01
Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers' state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state 1/√{2}(|A rangle _1|Arangle _2 ± |Brangle _1|Brangle _2) in the coin space of two walkers with fidelity greater than 99.99999 % in theory, and we have at least a 50 % probability to obtain the expected Bell state after a proper local measurement.
NASA Astrophysics Data System (ADS)
Tartakovskii, Alexander
2012-07-01
Part I. Nanostructure Design and Structural Properties of Epitaxially Grown Quantum Dots and Nanowires: 1. Growth of III/V semiconductor quantum dots C. Schneider, S. Hofling and A. Forchel; 2. Single semiconductor quantum dots in nanowires: growth, optics, and devices M. E. Reimer, N. Akopian, M. Barkelid, G. Bulgarini, R. Heeres, M. Hocevar, B. J. Witek, E. Bakkers and V. Zwiller; 3. Atomic scale analysis of self-assembled quantum dots by cross-sectional scanning tunneling microscopy and atom probe tomography J. G. Keizer and P. M. Koenraad; Part II. Manipulation of Individual Quantum States in Quantum Dots Using Optical Techniques: 4. Studies of the hole spin in self-assembled quantum dots using optical techniques B. D. Gerardot and R. J. Warburton; 5. Resonance fluorescence from a single quantum dot A. N. Vamivakas, C. Matthiesen, Y. Zhao, C.-Y. Lu and M. Atature; 6. Coherent control of quantum dot excitons using ultra-fast optical techniques A. J. Ramsay and A. M. Fox; 7. Optical probing of holes in quantum dot molecules: structure, symmetry, and spin M. F. Doty and J. I. Climente; Part III. Optical Properties of Quantum Dots in Photonic Cavities and Plasmon-Coupled Dots: 8. Deterministic light-matter coupling using single quantum dots P. Senellart; 9. Quantum dots in photonic crystal cavities A. Faraon, D. Englund, I. Fushman, A. Majumdar and J. Vukovic; 10. Photon statistics in quantum dot micropillar emission M. Asmann and M. Bayer; 11. Nanoplasmonics with colloidal quantum dots V. Temnov and U. Woggon; Part IV. Quantum Dot Nano-Laboratory: Magnetic Ions and Nuclear Spins in a Dot: 12. Dynamics and optical control of an individual Mn spin in a quantum dot L. Besombes, C. Le Gall, H. Boukari and H. Mariette; 13. Optical spectroscopy of InAs/GaAs quantum dots doped with a single Mn atom O. Krebs and A. Lemaitre; 14. Nuclear spin effects in quantum dot optics B. Urbaszek, B. Eble, T. Amand and X. Marie; Part V. Electron Transport in Quantum Dots Fabricated by
Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem
NASA Astrophysics Data System (ADS)
Guo, Ying; Luo, Peng; Wang, Yijun
2016-07-01
Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.
Dissipative quantum computing with open quantum walks
Sinayskiy, Ilya; Petruccione, Francesco
2014-12-04
An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.
Generation of entanglement in quantum parametric oscillators using phase control
Gonzalez-Henao, J. C.; Pugliese, E.; Euzzor, S.; Abdalah, S.F.; Meucci, R.; Roversi, J. A.
2015-01-01
The control of quantum entanglement in systems in contact with environment plays an important role in information processing, cryptography and quantum computing. However, interactions with the environment, even when very weak, entail decoherence in the system with consequent loss of entanglement. Here we consider a system of two coupled oscillators in contact with a common heat bath and with a time dependent oscillation frequency. The possibility to control the entanglement of the oscillators by means of an external sinusoidal perturbation applied to the oscillation frequency has been theoretically explored. We demonstrate that the oscillators become entangled exactly in the region where the classical counterpart is unstable, otherwise when the classical system is stable, entanglement is not possible. Therefore, we can control the entanglement swapping from stable to unstable regions by adjusting amplitude and phase of our external controller. We also show that the entanglement rate is approximately proportional to the real part of the Floquet coefficient of the classical counterpart of the oscillators. Our results have the intriguing peculiarity of manipulating quantum information operating on a classical system. PMID:26286485
QKD Via a Quantum Wavelength Router Using Spatial Soliton
NASA Astrophysics Data System (ADS)
Kouhnavard, M.; Amiri, I. S.; Afroozeh, A.; Jalil, M. A.; Ali, J.; Yupapin, P. P.
2011-05-01
A system for continuous variable quantum key distribution via a wavelength router is proposed. The Kerr type of light in the nonlinear microring resonator (NMRR) induces the chaotic behavior. In this proposed system chaotic signals are generated by an optical soliton or Gaussian pulse within a NMRR system. The parameters, such as input power, MRRs radii and coupling coefficients can change and plays important role in determining the results in which the continuous signals are generated spreading over the spectrum. Large bandwidth signals of optical soliton are generated by the input pulse propagating within the MRRs, which is allowed to form the continuous wavelength or frequency with large tunable channel capacity. The continuous variable QKD is formed by using the localized spatial soliton pulses via a quantum router and networks. The selected optical spatial pulse can be used to perform the secure communication network. Here the entangled photon generated by chaotic signals has been analyzed. The continuous entangled photon is generated by using the polarization control unit incorporating into the MRRs, required to provide the continuous variable QKD. Results obtained have shown that the application of such a system for the simultaneous continuous variable quantum cryptography can be used in the mobile telephone hand set and networks. In this study frequency band of 500 MHz and 2.0 GHz and wavelengths of 775 nm, 2,325 nm and 1.55 μm can be obtained for QKD use with input optical soliton and Gaussian beam respectively.
Generation of entanglement in quantum parametric oscillators using phase control.
Gonzalez-Henao, J C; Pugliese, E; Euzzor, S; Abdalah, S F; Meucci, R; Roversi, J A
2015-01-01
The control of quantum entanglement in systems in contact with environment plays an important role in information processing, cryptography and quantum computing. However, interactions with the environment, even when very weak, entail decoherence in the system with consequent loss of entanglement. Here we consider a system of two coupled oscillators in contact with a common heat bath and with a time dependent oscillation frequency. The possibility to control the entanglement of the oscillators by means of an external sinusoidal perturbation applied to the oscillation frequency has been theoretically explored. We demonstrate that the oscillators become entangled exactly in the region where the classical counterpart is unstable, otherwise when the classical system is stable, entanglement is not possible. Therefore, we can control the entanglement swapping from stable to unstable regions by adjusting amplitude and phase of our external controller. We also show that the entanglement rate is approximately proportional to the real part of the Floquet coefficient of the classical counterpart of the oscillators. Our results have the intriguing peculiarity of manipulating quantum information operating on a classical system. PMID:26286485
Quantum computer games: quantum minesweeper
NASA Astrophysics Data System (ADS)
Gordon, Michal; Gordon, Goren
2010-07-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.
Pure sources and efficient detectors for optical quantum information processing
NASA Astrophysics Data System (ADS)
Zielnicki, Kevin
Over the last sixty years, classical information theory has revolutionized the understanding of the nature of information, and how it can be quantified and manipulated. Quantum information processing extends these lessons to quantum systems, where the properties of intrinsic uncertainty and entanglement fundamentally defy classical explanation. This growing field has many potential applications, including computing, cryptography, communication, and metrology. As inherently mobile quantum particles, photons are likely to play an important role in any mature large-scale quantum information processing system. However, the available methods for producing and detecting complex multi-photon states place practical limits on the feasibility of sophisticated optical quantum information processing experiments. In a typical quantum information protocol, a source first produces an interesting or useful quantum state (or set of states), perhaps involving superposition or entanglement. Then, some manipulations are performed on this state, perhaps involving quantum logic gates which further manipulate or entangle the intial state. Finally, the state must be detected, obtaining some desired measurement result, e.g., for secure communication or computationally efficient factoring. The work presented here concerns the first and last stages of this process as they relate to photons: sources and detectors. Our work on sources is based on the need for optimized non-classical states of light delivered at high rates, particularly of single photons in a pure quantum state. We seek to better understand the properties of spontaneous parameteric downconversion (SPDC) sources of photon pairs, and in doing so, produce such an optimized source. We report an SPDC source which produces pure heralded single photons with little or no spectral filtering, allowing a significant rate enhancement. Our work on detectors is based on the need to reliably measure single-photon states. We have focused on
NASA Technical Reports Server (NTRS)
Lee, H.; Kok, P.; Dowling, J. P.
2002-01-01
This paper addresses the formal equivalence between the Mach-Zehnder interferometer, the Ramsey spectroscope, and a specific quantum logical gate. Based on this equivalence we introduce the quantum Rosetta Stone, and we describe a projective measurement scheme for generating the desired correlations between the interferometric input states in order to achieve Heisenberg-limited sensitivity.
Trevors, J T; Masson, L
2011-01-01
During his famous 1943 lecture series at Trinity College Dublin, the reknown physicist Erwin Schrodinger discussed the failure and challenges of interpreting life by classical physics alone and that a new approach, rooted in Quantum principles, must be involved. Quantum events are simply a level of organization below the molecular level. This includes the atomic and subatomic makeup of matter in microbial metabolism and structures, as well as the organic, genetic information code of DNA and RNA. Quantum events at this time do not elucidate, for example, how specific genetic instructions were first encoded in an organic genetic code in microbial cells capable of growth and division, and its subsequent evolution over 3.6 to 4 billion years. However, due to recent technological advances, biologists and physicists are starting to demonstrate linkages between various quantum principles like quantum tunneling, entanglement and coherence in biological processes illustrating that nature has exerted some level quantum control to optimize various processes in living organisms. In this article we explore the role of quantum events in microbial processes and endeavor to show that after nearly 67 years, Schrödinger was prophetic and visionary in his view of quantum theory and its connection with some of the fundamental mechanisms of life. PMID:21368338
NASA Astrophysics Data System (ADS)
Coecke, Bob
2010-01-01
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the 'no-cloning theorem' is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of 'quantum teleportation'? We claim that the quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is 'low-level'. In this review we present steps towards a diagrammatic 'high-level' alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the no-cloning theorem, and phenomena such as quantum teleportation. As a logic, it supports 'automation': it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required step-stone towards a deeper conceptual understanding of quantum theory, as well as its unification with other physical theories. Specific applications discussed here are purely diagrammatic proofs of several quantum computational schemes, as well as an analysis of the structural origin of quantum non-locality. The underlying mathematical foundation of this high-level diagrammatic formalism relies on so-called monoidal categories, a product of a fairly
NASA Astrophysics Data System (ADS)
Claeson, Tord; Delsing, Per; Wendin, Göran
2009-12-01
correction, have yet to be solved. It has been predicted that quantum computers will be able to perform certain complicated computations or simulations in minutes or hours instead of years as with present computers. So far there exist very few useful quantum algorithms; however there is hope that the development of these will be stimulated once there is a breakthrough in hardware. Remarkable progress has been made in quantum engineering and quantum measurements, but a large scale quantum computer is still far off. Quantum communication and cryptography are much closer to the market than a quantum computer. The development of quantum information has meant a large push in the field of quantum physics, that previously could only be studied in the microscopic world. Artificial atoms, realized by circuit technology and mimicking the properties of 'natural' atoms, are one example of the new possibilities opened up by quantum engineering. Several different types of qubits have been suggested. Some are based upon microscopic entities, like atoms and ions in traps, or nuclear spins in molecules. They can have long coherence times (i.e. a long period allowing many operations, of the order of 10 000, to be performed before the state needs to be refreshed) but they are difficult to integrate into large systems. Other qubits are based upon solid state components that facilitate integration and coupling between qubits, but they suffer from interactions with the environment and their coherent states have a limited lifetime. Advanced experiments have been performed with superconducting Josephson junctions and many breakthroughs have been reported in the last few years. They have an advantage in the inherent coherence of superconducting Cooper pairs over macroscopic distances. We chose to focus the Nobel Symposium on Qubits for Future Quantum Information on superconducting qubits to allow for depth in discussions, but at the same time to allow comparison with other types of qubits that may
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
2006-11-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
1995-04-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
Quantum strategies of quantum measurements
NASA Astrophysics Data System (ADS)
Li, Chuan-Feng; Zhang, Yong-Sheng; Huang, Yun-Feng; Guo, Guang-Can
2001-03-01
In the classical Monty Hall problem, one player can always win with probability 2/3. We generalize the problem to the quantum domain and show that a fair two-party zero-sum game can be carried out if the other player is permitted to adopt quantum measurement strategy.
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.'s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols. PMID:27163786
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.’s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.’s protocol and existing similar protocols. PMID:27163786
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope.
Feist, Armin; Echternkamp, Katharina E; Schauss, Jakob; Yalunin, Sergey V; Schäfer, Sascha; Ropers, Claus
2015-05-14
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers. PMID:25971512
Noise and measurement errors in a practical two-state quantum bit commitment protocol
NASA Astrophysics Data System (ADS)
Loura, Ricardo; Almeida, Álvaro J.; André, Paulo S.; Pinto, Armando N.; Mateus, Paulo; Paunković, Nikola
2014-05-01
We present a two-state practical quantum bit commitment protocol, the security of which is based on the current technological limitations, namely the nonexistence of either stable long-term quantum memories or nondemolition measurements. For an optical realization of the protocol, we model the errors, which occur due to the noise and equipment (source, fibers, and detectors) imperfections, accumulated during emission, transmission, and measurement of photons. The optical part is modeled as a combination of a depolarizing channel (white noise), unitary evolution (e.g., systematic rotation of the polarization axis of photons), and two other basis-dependent channels, namely the phase- and bit-flip channels. We analyze quantitatively the effects of noise using two common information-theoretic measures of probability distribution distinguishability: the fidelity and the relative entropy. In particular, we discuss the optimal cheating strategy and show that it is always advantageous for a cheating agent to add some amount of white noise—the particular effect not being present in standard quantum security protocols. We also analyze the protocol's security when the use of (im)perfect nondemolition measurements and noisy or bounded quantum memories is allowed. Finally, we discuss errors occurring due to a finite detector efficiency, dark counts, and imperfect single-photon sources, and we show that the effects are the same as those of standard quantum cryptography.
ERIC Educational Resources Information Center
Aldrovandi, R.: Ferreira, P. Leal
1980-01-01
Discusses the problem of the mathematical pendulum in its classical, semiclassical, and quantum aspects. The energy spectrum and its eigenfunctions are presented under the usual requirement of single valuedness of the solutions. (Author/CS)
NASA Astrophysics Data System (ADS)
Mitin, Vladimir; Kochelap, Viacheslav; Stroscio, Michael A.
1999-07-01
Quantum Heterostructures provides a detailed description of the key physical and engineering principles of quantum semiconductor heterostructures. Blending important concepts from physics, materials science, and electrical engineering, it also explains clearly the behavior and operating features of modern microelectronic and optoelectronic devices. The authors begin by outlining the trends that have driven development in this field, most importantly the need for high-performance devices in computer, information, and communications technologies. They then describe the basics of quantum nanoelectronics, including various transport mechanisms. In the latter part of the book, they cover novel microelectronic devices, and optical devices based on quantum heterostructures. The book contains many homework problems and is suitable as a textbook for undergraduate and graduate courses in electrical engineering, physics, or materials science. It will also be of great interest to those involved in research or development in microelectronic or optoelectronic devices.
NASA Astrophysics Data System (ADS)
Stapp, Henry P.
2012-05-01
Robert Griffiths has recently addressed, within the framework of a `consistent quantum theory' that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues that the putative proofs of this property that involve hidden variables include in their premises some essentially classical-physics-type assumptions that are not entailed by the precepts of quantum mechanics. Thus whatever is proved is not a feature of quantum mechanics, but is a property of a theory that tries to combine quantum theory with quasi-classical features that go beyond what is entailed by quantum theory itself. One cannot logically prove properties of a system by establishing, instead, properties of a system modified by adding properties alien to the original system. Hence Griffiths' rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his `consistent quantum theory' shows that the cited proof is valid within that restrictive version of quantum theory. An added section responds to Griffiths' reply, which cites general possibilities of ambiguities that might make what is to be proved ill-defined, and hence render the pertinent `consistent framework' ill defined. But the vagaries that he cites do not upset the proof in question, which, both by its physical formulation and by explicit identification, specify the framework to be used. Griffiths confirms the validity of the proof insofar as that pertinent framework is used. The section also shows
Quantum correlations and distinguishability of quantum states
Spehner, Dominique
2014-07-15
A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.
Quantum Particles From Quantum Information
NASA Astrophysics Data System (ADS)
Görnitz, T.; Schomäcker, U.
2012-08-01
Many problems in modern physics demonstrate that for a fundamental entity a more general conception than quantum particles or quantum fields are necessary. These concepts cannot explain the phenomena of dark energy or the mind-body-interaction. Instead of any kind of "small elementary building bricks", the Protyposis, an abstract and absolute quantum information, free of special denotation and open for some purport, gives the solution in the search for a fundamental substance. However, as long as at least relativistic particles are not constructed from the Protyposis, such an idea would remain in the range of natural philosophy. Therefore, the construction of relativistic particles without and with rest mass from quantum information is shown.
NASA Astrophysics Data System (ADS)
Demming, Anna
2012-07-01
Technological developments sparked by quantum mechanics and wave-particle duality are still gaining ground over a hundred years after the theories were devised. While the impact of the theories in fundamental research, philosophy and even art and literature is widely appreciated, the implications in device innovations continue to breed potential. Applications inspired by these concepts include quantum computation and quantum cryptography protocols based on single photons, among many others. In this issue, researchers in Germany and the US report a step towards precisely triggered single-photon sources driven by surface acoustic waves (SAWs) [1]. The work brings technology based on quantum mechanics yet another step closer to practical device reality. Generation of single 'antibunched' photons has been one of the key challenges to progress in quantum information processing and communication. Researchers from Toshiba and Cambridge University in the UK recently reported what they described as 'the first electrically driven single-photon source capable of emitting indistinguishable photons' [2]. Single-photon sources have been reported previously [3]. However the approach demonstrated by Shields and colleagues allows electrical control, which is particularly useful for implementing in compact devices. The researchers used a layer of InAs quantum dots embedded in the intrinsic region of a p-i-n diode to demonstrate interference between single photons. They also present a complete theory based on the interference of photons with a Lorentzian spectrum, which they compare with both continuous-wave and pulsed experiments. The application of SAWs in achieving precisely triggered single-photon sources develops the work of researchers in Germany in the late 1990s [4]. Surface acoustic waves travel like sound waves, but are characterized by an amplitude that typically decays exponentially with depth into the substrate. As Rocke and colleagues demonstrated, they can be used to
NASA Astrophysics Data System (ADS)
Abrams, Daniel S.
This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Fast algorithms for simulating many body Fermi systems are also provided in both first and second quantized descriptions. An efficient quantum algorithm for anti-symmetrization is given as well as a detailed discussion of a simulation of the Hubbard model. In addition, quantum algorithms that calculate numerical integrals and various characteristics of stochastic processes are described. Two techniques are given, both of which obtain an exponential speed increase in comparison to the fastest known classical deterministic algorithms and a quadratic speed increase in comparison to classical Monte Carlo (probabilistic) methods. I derive a simpler and slightly faster version of Grover's mean algorithm, show how to apply quantum counting to the problem, develop some variations of these algorithms, and show how both (apparently distinct) approaches can be understood from the same unified framework. Finally, the relationship between physics and computation is explored in some more depth, and it is shown that computational complexity theory depends very sensitively on physical laws. In particular, it is shown that nonlinear quantum mechanics allows for the polynomial time solution of NP-complete and #P oracle problems. Using the Weinberg model as a simple example, the explicit construction of the necessary gates is derived from the underlying physics. Nonlinear quantum algorithms are also presented using Polchinski type nonlinearities which do not allow for superluminal communication. (Copies available exclusively from MIT Libraries, Rm. 14- 0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Introduction to Quantum Simulation
NASA Technical Reports Server (NTRS)
Williams, Colin P.
2005-01-01
This viewgraph presentation addresses the problem of efficiently simulating the evolution of a quantum system. The contents include: 1) Quantum Simulation; 2) Extracting Answers from Quantum Simulations; 3) Quantum Fourier Transform; 4) Eigenvalue Estimation; 5) Fermionic Simulations.
Quantum Physics for Beginners.
ERIC Educational Resources Information Center
Strand, J.
1981-01-01
Suggests a new approach for teaching secondary school quantum physics. Reviews traditional approaches and presents some characteristics of the three-part "Quantum Physics for Beginners" project, including: quantum physics, quantum mechanics, and a short historical survey. (SK)
Oppenheim, Jonathan; Horodecki, Michal
2005-10-15
Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we introduce relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case.
NASA Astrophysics Data System (ADS)
Schieve, William C.; Horwitz, Lawrence P.
2009-04-01
1. Foundations of quantum statistical mechanics; 2. Elementary examples; 3. Quantum statistical master equation; 4. Quantum kinetic equations; 5. Quantum irreversibility; 6. Entropy and dissipation: the microscopic theory; 7. Global equilibrium: thermostatics and the microcanonical ensemble; 8. Bose-Einstein ideal gas condensation; 9. Scaling, renormalization and the Ising model; 10. Relativistic covariant statistical mechanics of many particles; 11. Quantum optics and damping; 12. Entanglements; 13. Quantum measurement and irreversibility; 14. Quantum Langevin equation: quantum Brownian motion; 15. Linear response: fluctuation and dissipation theorems; 16. Time dependent quantum Green's functions; 17. Decay scattering; 18. Quantum statistical mechanics, extended; 19. Quantum transport with tunneling and reservoir ballistic transport; 20. Black hole thermodynamics; Appendix; Index.
Kendon, Viv
2014-12-04
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.
NASA Astrophysics Data System (ADS)
Yoshida, Z.; Mahajan, S. M.
2016-02-01
Quantum systems often exhibit fundamental incapability to entertain vortex. The Meissner effect, a complete expulsion of the magnetic field (the electromagnetic vorticity), for instance, is taken to be the defining attribute of the superconducting state. Superfluidity is another, close-parallel example; fluid vorticity can reside only on topological defects with a limited (quantized) amount. Recent developments in the Bose-Einstein condensates produced by particle traps further emphasize this characteristic. We show that the challenge of imparting vorticity to a quantum fluid can be met through a nonlinear mechanism operating in a hot fluid corresponding to a thermally modified Pauli-Schrödinger spinor field. The thermal baroclinic effect is represented by a nonlinear, non-Hermitian Hamiltonian, which, in conjunction with spin vorticity, leads to new interesting quantum states; a spiral solution is explicitly worked out in a simple field-free model.
Habib, S.
1994-10-01
We consider a simple quantum system subjected to a classical random force. Under certain conditions it is shown that the noise-averaged Wigner function of the system follows an integro-differential stochastic Liouville equation. In the simple case of polynomial noise-couplings this equation reduces to a generalized Fokker-Planck form. With nonlinear noise injection new ``quantum diffusion`` terms rise that have no counterpart in the classical case. Two special examples that are not of a Fokker-Planck form are discussed: the first with a localized noise source and the other with a spatially modulated noise source.
NASA Astrophysics Data System (ADS)
Sych, Denis; Leuchs, Gerd
2015-12-01
Classical physics allows for the existence of pairs of absolutely identical systems. Pairwise application of identical measurements to each of those systems always leads to exactly alike results irrespectively of the choice of measurements. Here we ask a question how the picture looks like in the quantum domain. Surprisingly, we get a counterintuitive outcome. Pairwise application of identical (but a priori unknown) measurements cannot always lead to exactly alike results. We interpret this as quantum uniqueness—a feature that has no classical analog.
Lincoln, Don
2014-10-24
The laws of quantum mechanics and relativity are quite perplexing however it is when the two theories are merged that things get really confusing. This combined theory predicts that empty space isn’t empty at all – it’s a seething and bubbling cauldron of matter and antimatter particles springing into existence before disappearing back into nothingness. Scientists call this complicated state of affairs “quantum foam.” In this video, Fermilab’s Dr. Don Lincoln discusses this mind-bending idea and sketches some of the experiments that have convinced scientists that this crazy prediction is actually true.
NASA Astrophysics Data System (ADS)
Baaquie, Belal E.
2007-09-01
Foreword; Preface; Acknowledgements; 1. Synopsis; Part I. Fundamental Concepts of Finance: 2. Introduction to finance; 3. Derivative securities; Part II. Systems with Finite Number of Degrees of Freedom: 4. Hamiltonians and stock options; 5. Path integrals and stock options; 6. Stochastic interest rates' Hamiltonians and path integrals; Part III. Quantum Field Theory of Interest Rates Models: 7. Quantum field theory of forward interest rates; 8. Empirical forward interest rates and field theory models; 9. Field theory of Treasury Bonds' derivatives and hedging; 10. Field theory Hamiltonian of forward interest rates; 11. Conclusions; Appendix A: mathematical background; Brief glossary of financial terms; Brief glossary of physics terms; List of main symbols; References; Index.
NASA Astrophysics Data System (ADS)
Ekert, Artur
1994-08-01
As computers become faster they must become smaller because of the finiteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another - from gears to relays to valves to transistors to integrated circuits and so on. Quantum mechanics is already important in the design of microelectronic components. Soon it will be necessary to harness quantum mechanics rather than simply take it into account, and at that point it will be possible to give data processing devices new functionality.
Attacks exploiting deviation of mean photon number in quantum key distribution and coin tossing
NASA Astrophysics Data System (ADS)
Sajeed, Shihan; Radchenko, Igor; Kaiser, Sarah; Bourgoin, Jean-Philippe; Pappa, Anna; Monat, Laurent; Legré, Matthieu; Makarov, Vadim
2015-03-01
The security of quantum communication using a weak coherent source requires an accurate knowledge of the source's mean photon number. Finite calibration precision or an active manipulation by an attacker may cause the actual emitted photon number to deviate from the known value. We model effects of this deviation on the security of three quantum communication protocols: the Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol without decoy states, Scarani-Acín-Ribordy-Gisin 2004 (SARG04) QKD protocol, and a coin-tossing protocol. For QKD we model both a strong attack using technology possible in principle and a realistic attack bounded by today's technology. To maintain the mean photon number in two-way systems, such as plug-and-play and relativistic quantum cryptography schemes, bright pulse energy incoming from the communication channel must be monitored. Implementation of a monitoring detector has largely been ignored so far, except for ID Quantique's commercial QKD system Clavis2. We scrutinize this implementation for security problems and show that designing a hack-proof pulse-energy-measuring detector is far from trivial. Indeed, the first implementation has three serious flaws confirmed experimentally, each of which may be exploited in a cleverly constructed Trojan-horse attack. We discuss requirements for a loophole-free implementation of the monitoring detector.
Quantum learning without quantum memory
Sentís, G.; Calsamiglia, J.; Muñoz-Tapia, R.; Bagan, E.
2012-01-01
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an “estimate-and-discriminate” machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates. PMID:23050092
NASA Technical Reports Server (NTRS)
Dowling, Jonathan P.
2000-01-01
Recently, several researchers, including yours truly, have been able to demonstrate theoretically that quantum photon entanglement has the potential to also revolutionize the entire field of optical interferometry, by providing many orders of magnitude improvement in interferometer sensitivity. The quantum entangled photon interferometer approach is very general and applies to many types of interferometers. In particular, without nonlocal entanglement, a generic classical interferometer has a statistical-sampling shot-noise limited sensitivity that scales like 1/Sqrt[N], where N is the number of particles (photons, electrons, atoms, neutrons) passing through the interferometer per unit time. However, if carefully prepared quantum correlations are engineered between the particles, then the interferometer sensitivity improves by a factor of Sqrt[N] (square root of N) to scale like 1/N, which is the limit imposed by the Heisenberg Uncertainty Principle. For optical (laser) interferometers operating at milliwatts of optical power, this quantum sensitivity boost corresponds to an eight-order-of-magnitude improvement of signal to noise. Applications are to tests of General Relativity such as ground and orbiting optical interferometers for gravity wave detection, Laser Interferometer Gravity Observatory (LIGO) and the European Laser Interferometer Space Antenna (LISA), respectively.
NASA Astrophysics Data System (ADS)
Cheon, Taksu; Tsutsui, Izumi; Fülöp, Tamás
2004-09-01
We show that the point interactions on a line can be utilized to provide U(2) family of qubit operations for quantum information processing. Qubits are realized as states localized in either side of the point interaction which represents a controllable gate. The qubit manipulation proceeds in a manner analogous to the operation of an abacus.
Visser, M. )
1991-01-15
This paper presents an application of quantum-mechanical principles to a microscopic variant of the traversable wormholes recently introduced by Morris and Thorne. The analysis, based on the surgical grafting of two Reissner-Nordstroem spacetimes, proceeds by using a minisuperspace model to approximate the geometry of these wormholes. The thin shell'' formalism is applied to this minisuperspace model to extract the effective Lagrangian appropriate to this one-degree-of-freedom system. This effective Lagrangian is then quantized and the wave function for the wormhole is explicitly exhibited. A slightly more general class of wormholes---corresponding to the addition of some dust'' to the wormhole throat---is analyzed by recourse to WKB techniques. In all cases discussed in this paper, the expectation value of the wormhole radius is calculated to be of the order of the Planck length. Accordingly, though these quantum wormholes are of considerable theoretical interest they do not appear to be useful as a means for interstellar travel. The results of this paper may also have a bearing on the question of topological fluctuations in quantum gravity. These calculations serve to suggest that topology-changing effects might in fact be {ital suppressed} by quantum-gravity effects.
NASA Astrophysics Data System (ADS)
2009-01-01
The demonstration in this issue that strong magnetic confinement of electrons can dramatically increase the operating temperature of terahertz quantum cascade lasers is good news for the dream of reaching room temperature. Nature Photonics spoke with Qing Hu about the result and the future prospects.
Sassoli de Bianchi, Massimiliano
2013-09-15
In a letter to Born, Einstein wrote [42]: “Quantum mechanics is certainly imposing. But an inner voice tells me that it is not yet the real thing. The theory says a lot, but does not really bring us any closer to the secret of the ‘old one.’ I, at any rate, am convinced that He does not throw dice.” In this paper we take seriously Einstein’s famous metaphor, and show that we can gain considerable insight into quantum mechanics by doing something as simple as rolling dice. More precisely, we show how to perform measurements on a single die, to create typical quantum interference effects, and how to connect (entangle) two identical dice, to maximally violate Bell’s inequality. -- Highlights: •Rolling a die is a quantum process admitting a Hilbert space representation. •Rolling experiments with a single die can produce interference effects. •Two connected dice can violate Bell’s inequality. •Correlations need to be created by the measurement, to violate Bell’s inequality.
NASA Astrophysics Data System (ADS)
Goldenberg, Lior; Vaidman, Lev; Wiesner, Stephen
1999-04-01
We present a two-party protocol for ``quantum gambling,'' a new task closely related to coin tossing. The protocol allows two remote parties to play a gambling game such that in a certain limit it becomes a fair game. No unconditionally secure classical method is known to accomplish this task.
NASA Astrophysics Data System (ADS)
Lanzagorta, Marco O.; Gomez, Richard B.; Uhlmann, Jeffrey K.
2003-08-01
In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.
NASA Astrophysics Data System (ADS)
Toussaint, Kimani Christopher, Jr.
Ellipsometry is a technique in which the polarization of light is used to determine the optical properties of a material (sample) and infer information such as the thickness of a thin film. Traditional ellipsometric measurements are limited in their accuracy because of the use of an external reference sample for calibration, and because of the quantum noise inherent in the source that becomes important at low light levels. A new technique called quantum ellipsometry is investigated, and is shown to circumvent these limitations by using a non-classical source of light, namely, twin photons generated by the process of spontaneous parametric downconversion (SPDC), in conjunction with a novel polarization interferometer and coincidence-counting detection scheme. Quantum ellipsometry comes in two forms: correlated-photon and entangled-photon ellipsometry. Both ellipsometric techniques yield estimated of the sample reflectance/transmittance with accuracy greater than conventional ellipsometry. Specifically, when the quantum efficiencies of the detectors used are above a certain threshold the signal-to-noise ratio of the measured ellipsometric parameters is larger for quantum ellipsometry than for conventional ellipsometry. This is because the photon pairs generated by SPDC have a fully correlated joint photon counting distribution. Furthermore, both correlated-photon and entangled-photon ellipsometry have the added advantage that they do not require calibration by an external reference sample, which is another limitation on the accuracy for most conventional ellipsometry. Quantum ellipsometry exploits the property of photon number correlation and polarization entanglement. The entanglement property, inherent in entangled-photon ellipsometry, is shown to allow for the movement of the optical elements that precede the sample to the sample-free optical channel in the setup. A theoretical and experimental investigation of quantum ellipsometry was conducted. Both correlated
Quantum state and quantum entanglement protection using quantum measurements
NASA Astrophysics Data System (ADS)
Wang, Shuchao; Li, Ying; Wang, Xiangbin; Kwek, Leong Chuan; Yu, Zongwen; Zou, Wenjie
2015-03-01
The time evolution of some quantum states can be slowed down or even stopped under frequent measurements. This is the usual quantum Zeno effect. Here we report an operator quantum Zeno effect, in which the evolution of some physical observables is slowed down through measurements even though thequantum state changes randomly with time. Based on the operator quantum Zeno effect, we show how we can protect quantum information from decoherence with two-qubit measurements, realizable with noisy two-qubit interactions. Besides, we report the quantum entanglement protection using weak measurement and measurement reversal scheme. Exposed in the nonzero temperature environment, a quantum system can both lose and gain excitations by interacting with the environment. In this work, we show how to optimally protect quantum states and quantum entanglement in such a situation based on measurement reversal from weak measurement. In particular, we present explicit formulas of protection. We find that this scheme can circumvent the entanglement sudden death in certain conditions.
Cavity Quantum Electrodynamics: The Strange Theory of Light in a Box
NASA Astrophysics Data System (ADS)
Dutra, Sergio M.
2004-12-01
What happens to light when it is trapped in a box? Cavity Quantum Electrodynamics addresses a fascinating question in physics: what happens to light, and in particular to its interaction with matter, when it is trapped inside a box? With the aid of a model-building approach, readers discover the answer to this question and come to appreciate its important applications in computing, cryptography, quantum teleportation, and opto-electronics. Instead of taking a traditional approach that requires readers to first master a series of seemingly unconnected mathematical techniques, this book engages the readers' interest and imagination by going straight to the point, introducing the mathematics along the way as needed. Appendices are provided for the additional mathematical theory. Researchers, scientists, and students of modern physics can refer to Cavity Quantum Electrodynamics and examine the field thoroughly. Several key topics covered that readers cannot find in any other quantum optics book include: * Introduction to the problem of the "vacuum catastrophe" and the cosmological constant * Detailed up-to-date account of cavity QED lasers and thresholdless lasing * Examination of cavities with movable walls * First-principles discussion about cavity QED in open cavities * Pedagogical account of microscopic quantization in dielectrics Complementing the coverage of the most advanced theory and techniques, the author provides context by discussing the historical evolution of the field and its discoveries. In that spirit, "recommended reading," provided in each chapter, leads readers to both contemporary literature as well as key historical papers. Despite being one of many specialties within physics, cavity quantum electrodynamics serves as a window to many of the fundamental issues of physics. Cavity Quantum Electrodynamics will serve as an excellent resource for advanced undergraduate quantum mechanics courses as well as for graduate students, researchers, and
Efficient quantum walk on a quantum processor.
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L; Wang, Jingbo B; Matthews, Jonathan C F
2016-01-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471
Quantum Secure Dialogue with Quantum Encryption
NASA Astrophysics Data System (ADS)
Ye, Tian-Yu
2014-09-01
How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.
Efficient quantum walk on a quantum processor
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.
2016-01-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471
Efficient quantum walk on a quantum processor
NASA Astrophysics Data System (ADS)
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.
2016-05-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
NASA Astrophysics Data System (ADS)
Chimalgi, Vinay; Ahmed, Shaikh
2014-03-01
Recent advances in growth techniques and increasing number of experimental studies have made semiconducting InAs/GaAs quantum dots (QDs) grown along different crystallographic directions a reality and promising systems for applications in infrared detection, optical memories, laser, and in quantum cryptography as single photon sources and quantum computation. However, only few theoretical investigations have been performed on these QDs due to the complex nature of the coupling of atomicity, structural fields, polarization, and quantum size-quantization, all strong function of the crystallographic direction. The objective of this paper is to integrate a computational framework employing a combination of fully atomistic valence force-field molecular mechanics and 20-band sp3 s *d5 -SO tight-binding based electronic bandstructure models, and numerically investigate the effects of internal fields on the electronic and optical properties of InAs/GaAs quantum dots grown on (100), (110), and (111) orientated substrates. It is found that, while piezoelectricity has largest effects on lowering the symmetry of (100) oriented QDs, its effect is minimum in (111) orientated QDs. Supported by the U.S. National Science Foundation Grant No. 1102192.
Stapp, H.P.
1988-04-01
It is argued that the validity of the predictions of quantum theory in certain spin-correlation experiments entails a violation of Einstein's locality idea that no causal influence can act outside the forward light cone. First, two preliminary arguments suggesting such a violation are reviewed. They both depend, in intermediate stages, on the idea that the results of certain unperformed experiments are physically determinate. The second argument is entangled also with the problem of the meaning of physical reality. A new argument having neither of these characteristics is constructed. It is based strictly on the orthodox ideas of Bohr and Heisenberg, and has no realistic elements, or other ingredients, that are alien to orthodox quantum thinking.
NASA Astrophysics Data System (ADS)
Lo, C. F.; Kiang, D.
2003-12-01
Based upon a modification of Li et al.'s "minimal" quantization rules (Phys. Lett. A306(2002) 73), we investigate the quantum version of the Cournot and Bertrand oligopoly. In the Cournot oligopoly, the profit of each of the N firms at the Nash equilibrium point rises monotonically with the measure of the quantum entanglement. Only at maximal entanglement, however, does the Nash equilibrium point coincide with the Pareto optimal point. In the Bertrand case, the Bertrand Paradox remains for finite entanglement (i.e., the perfectly competitive stage is reached for any N>=2), whereas with maximal entanglement each of the N firms will still have a non-zero shared profit. Hence, the Bertrand Paradox is completely resolved. Furthermore, a perfectly competitive market is reached asymptotically for N → ∞ in both the Cournot and Bertrand oligopoly.
Adiabatically implementing quantum gates
Sun, Jie; Lu, Songfeng Liu, Fang
2014-06-14
We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.
NASA Astrophysics Data System (ADS)
Piotrowski, Edward W.; Sładkowski, Jan
2003-02-01
We continue the analysis of quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory and quantum computing. The present paper is devoted to quantum English auction which we consider as a special class of quantum market games. The approach allows to calculate profit intensities for various possible strategies.
NASA Astrophysics Data System (ADS)
Murdin, P.
2000-11-01
A development of quantum theory that was initiated in the 1920s by Werner Heisenberg (1901-76) and Erwin Schrödinger (1887-1961). The theory drew on a proposal made in 1925 Prince Louis de Broglie (1892-1987), that particles have wavelike properties (the wave-particle duality) and that an electron, for example, could in some respects be regarded as a wave with a wavelength that depended on its mo...
NASA Astrophysics Data System (ADS)
Rae, Alastair
2012-03-01
Preface to the second edition; Preface to the first edition; 1. Quantum physics; 2. Which way are the photons pointing?; 3. What can be hidden in a pair of photons?; 4. Wonderful Copenhagen?; 5. Is it all in the mind?; 6. Many worlds; 7. Is it a matter of size?; 8. Backwards and forwards; 9. Only one way forward?; 10. Can we be consistent?; 11. Illusion or reality?; Further reading.
Efficient Quantum Information Processing via Quantum Compressions
NASA Astrophysics Data System (ADS)
Deng, Y.; Luo, M. X.; Ma, S. Y.
2016-01-01
Our purpose is to improve the quantum transmission efficiency and reduce the resource cost by quantum compressions. The lossless quantum compression is accomplished using invertible quantum transformations and applied to the quantum teleportation and the simultaneous transmission over quantum butterfly networks. New schemes can greatly reduce the entanglement cost, and partially solve transmission conflictions over common links. Moreover, the local compression scheme is useful for approximate entanglement creations from pre-shared entanglements. This special task has not been addressed because of the quantum no-cloning theorem. Our scheme depends on the local quantum compression and the bipartite entanglement transfer. Simulations show the success probability is greatly dependent of the minimal entanglement coefficient. These results may be useful in general quantum network communication.
Quantum Information Theory for Quantum Communication
NASA Astrophysics Data System (ADS)
Koashi, Masato
This chapter gives a concise description of the fundamental concepts of quantum information and quantum communication, which is pertinent to the discussions in the subsequent chapters. Beginning with the basic set of rules that dictate quantum mechanics, the chapter explains the most general ways to describe quantum states, measurements, and state transformations. Convenient mathematical tools are also presented to provide an intuitive picture of a qubit, which is the simplest unit of quantum information. The chapter then elaborates on the distinction between quantum communication and classical communication, with emphasis on the role of quantum entanglement as a communication resource. Quantum teleportation and dense coding are then explained in the context of optimal resource conversions among quantum channels, classical channels, and entanglement.
Stapp, Henry
2011-11-10
Robert Griffiths has recently addressed, within the framework of a ‘consistent quantum theory’ (CQT) that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues, on the basis of his examination of certain arguments that claim to demonstrate the existence of such nonlocal influences, that such influences do not exist. However, his examination was restricted mainly to hidden-variable-based arguments that include in their premises some essentially classical-physics-type assumptions that are fundamentally incompatible with the precepts of quantum physics. One cannot logically prove properties of a system by attributing to the system properties alien to that system. Hence Griffiths’ rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his ‘consistent quantum theory’ shows that the cited proof is valid within that restrictive framework. This necessary existence, within the ‘consistent’ framework, of long range essentially instantaneous influences refutes the claim made by Griffiths that his ‘consistent’ framework is superior to the orthodox quantum theory of von Neumann because it does not entail instantaneous influences. An added section responds to Griffiths’ reply, which cites a litany of ambiguities that seem to restrict, devastatingly, the scope of his CQT formalism, apparently to buttress his claim that my use of that formalism to validate the nonlocality theorem is flawed. But the
Quantum probability and quantum decision-making.
Yukalov, V I; Sornette, D
2016-01-13
A rigorous general definition of quantum probability is given, which is valid not only for elementary events but also for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting observables in addition to commutative observables. Our proposed definition of quantum probability makes it possible to describe quantum measurements and quantum decision-making on the same common mathematical footing. Conditions are formulated for the case when quantum decision theory reduces to its classical counterpart and for the situation where the use of quantum decision theory is necessary. PMID:26621989
Interpreting quantum discord through quantum state merging
Madhok, Vaibhav; Datta, Animesh
2011-03-15
We present an operational interpretation of quantum discord based on the quantum state merging protocol. Quantum discord is the markup in the cost of quantum communication in the process of quantum state merging, if one discards relevant prior information. Our interpretation has an intuitive explanation based on the strong subadditivity of von Neumann entropy. We use our result to provide operational interpretations of other quantities like the local purity and quantum deficit. Finally, we discuss in brief some instances where our interpretation is valid in the single-copy scenario.
Quantum coherence and correlations in quantum system
Xi, Zhengjun; Li, Yongming; Fan, Heng
2015-01-01
Criteria of measure quantifying quantum coherence, a unique property of quantum system, are proposed recently. In this paper, we first give an uncertainty-like expression relating the coherence and the entropy of quantum system. This finding allows us to discuss the relations between the entanglement and the coherence. Further, we discuss in detail the relations among the coherence, the discord and the deficit in the bipartite quantum system. We show that, the one-way quantum deficit is equal to the sum between quantum discord and the relative entropy of coherence of measured subsystem. PMID:26094795
Twisted Quantum Toroidal Algebras
NASA Astrophysics Data System (ADS)
Jing, Naihuan; Liu, Rongjia
2014-09-01
We construct a principally graded quantum loop algebra for the Kac-Moody algebra. As a special case a twisted analog of the quantum toroidal algebra is obtained together with the quantum Serre relations.
Quantum differential cryptanalysis
NASA Astrophysics Data System (ADS)
Zhou, Qing; Lu, Songfeng; Zhang, Zhigang; Sun, Jie
2015-06-01
In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on the quantum minimum/maximum-finding algorithm, where the values to be compared and filtered are obtained by calling the quantum counting algorithm. Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.
Quantum key distribution in a multi-user network at gigahertz clock rates
NASA Astrophysics Data System (ADS)
Fernandez, Veronica; Gordon, Karen J.; Collins, Robert J.; Townsend, Paul D.; Cova, Sergio D.; Rech, Ivan; Buller, Gerald S.
2005-07-01
In recent years quantum information research has lead to the discovery of a number of remarkable new paradigms for information processing and communication. These developments include quantum cryptography schemes that offer unconditionally secure information transport guaranteed by quantum-mechanical laws. Such potentially disruptive security technologies could be of high strategic and economic value in the future. Two major issues confronting researchers in this field are the transmission range (typically <100km) and the key exchange rate, which can be as low as a few bits per second at long optical fiber distances. This paper describes further research of an approach to significantly enhance the key exchange rate in an optical fiber system at distances in the range of 1-20km. We will present results on a number of application scenarios, including point-to-point links and multi-user networks. Quantum key distribution systems have been developed, which use standard telecommunications optical fiber, and which are capable of operating at clock rates of up to 2GHz. They implement a polarization-encoded version of the B92 protocol and employ vertical-cavity surface-emitting lasers with emission wavelengths of 850 nm as weak coherent light sources, as well as silicon single-photon avalanche diodes as the single photon detectors. The point-to-point quantum key distribution system exhibited a quantum bit error rate of 1.4%, and an estimated net bit rate greater than 100,000 bits-1 for a 4.2 km transmission range.
Position-momentum uncertainty relations in the presence of quantum memory
NASA Astrophysics Data System (ADS)
Furrer, Fabian; Berta, Mario; Tomamichel, Marco; Scholz, Volkher B.; Christandl, Matthias
2014-12-01
A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that no particle may be prepared with certain outcomes for both position and momentum measurements. Often the statistical uncertainties are thereby measured in terms of entropies providing a clear operational interpretation in information theory and cryptography. Recently, entropic uncertainty relations have been used to show that the uncertainty can be reduced in the presence of entanglement and to prove security of quantum cryptographic tasks. However, much of this recent progress has been focused on observables with only a finite number of outcomes not including Heisenberg's original setting of position and momentum observables. Here, we show entropic uncertainty relations for general observables with discrete but infinite or continuous spectrum that take into account the power of an entangled observer. As an illustration, we evaluate the uncertainty relations for position and momentum measurements, which is operationally significant in that it implies security of a quantum key distribution scheme based on homodyne detection of squeezed Gaussian states.
Position-momentum uncertainty relations in the presence of quantum memory
Furrer, Fabian; Berta, Mario; Tomamichel, Marco; Scholz, Volkher B.; Christandl, Matthias
2014-12-15
A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that no particle may be prepared with certain outcomes for both position and momentum measurements. Often the statistical uncertainties are thereby measured in terms of entropies providing a clear operational interpretation in information theory and cryptography. Recently, entropic uncertainty relations have been used to show that the uncertainty can be reduced in the presence of entanglement and to prove security of quantum cryptographic tasks. However, much of this recent progress has been focused on observables with only a finite number of outcomes not including Heisenberg’s original setting of position and momentum observables. Here, we show entropic uncertainty relations for general observables with discrete but infinite or continuous spectrum that take into account the power of an entangled observer. As an illustration, we evaluate the uncertainty relations for position and momentum measurements, which is operationally significant in that it implies security of a quantum key distribution scheme based on homodyne detection of squeezed Gaussian states.
NASA Astrophysics Data System (ADS)
Baptista, M. S.
1998-03-01
It is possible to encrypt a message (a text composed by some alphabet) using the ergodic property of the simple low-dimensional and chaotic logistic equation. The basic idea is to encrypt each character of the message as the integer number of iterations performed in the logistic equation, in order to transfer the trajectory from an initial condition towards an ɛ-interval inside the logistic chaotic attractor.
Optical digital chaos cryptography
NASA Astrophysics Data System (ADS)
Arenas-Pingarrón, Álvaro; González-Marcos, Ana P.; Rivas-Moscoso, José M.; Martín-Pereda, José A.
2007-10-01
In this work we present a new way to mask the data in a one-user communication system when direct sequence - code division multiple access (DS-CDMA) techniques are used. The code is generated by a digital chaotic generator, originally proposed by us and previously reported for a chaos cryptographic system. It is demonstrated that if the user's data signal is encoded with a bipolar phase-shift keying (BPSK) technique, usual in DS-CDMA, it can be easily recovered from a time-frequency domain representation. To avoid this situation, a new system is presented in which a previous dispersive stage is applied to the data signal. A time-frequency domain analysis is performed, and the devices required at the transmitter and receiver end, both user-independent, are presented for the optical domain.
Small circuits for cryptography.
Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree; Miller, Russell D.; Anderson, William Erik
2005-10-01
This report examines a number of hardware circuit design issues associated with implementing certain functions in FPGA and ASIC technologies. Here we show circuit designs for AES and SHA-1 that have an extremely small hardware footprint, yet show reasonably good performance characteristics as compared to the state of the art designs found in the literature. Our AES performance numbers are fueled by an optimized composite field S-box design for the Stratix chipset. Our SHA-1 designs use register packing and feedback functionalities of the Stratix LE, which reduce the logic element usage by as much as 72% as compared to other SHA-1 designs.
Hybrid cryptography key management.
Draelos, Timothy John; Torgerson, Mark Dolan; Neumann, William Douglas; Gallup, Donald R.; Collins, Michael Joseph; Beaver, Cheryl Lynn
2003-11-01
Wireless communication networks are highly resource-constrained; thus many security protocols which work in other settings may not be efficient enough for use in wireless environments. This report considers a variety of cryptographic techniques which enable secure, authenticated communication when resources such as processor speed, battery power, memory, and bandwidth are tightly limited.
ERIC Educational Resources Information Center
Myerscough, Don; And Others
1996-01-01
Describes an activity whose objectives are to encode and decode messages using linear functions and their inverses; to use modular arithmetic, including use of the reciprocal for simple equation solving; to analyze patterns and make and test conjectures; to communicate procedures and algorithms; and to use problem-solving strategies. (ASK)
NASA Astrophysics Data System (ADS)
Kotulski, Zbigniew; Szczepaski, Janusz
In the paper we propose a new method of constructing cryptosystems utilising a nonpredictability property of discrete chaotic systems. We formulate the requirements for such systems to assure their safety. We also give examples of practical realisation of chaotic cryptosystems, using a generalisation of the method presented in [7]. The proposed algorithm of encryption and decryption is based on multiple iteration of a certain dynamical chaotic system. We assume that some part of the initial condition is a plain message. As the secret key we assume the system parameter(s) and additionally another part of the initial condition.
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response
Stipčević, Mario; Ursin, Rupert
2015-01-01
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physicsal process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, wich can be described by a probabilistic theory only, even in principle. Here we present a conceptualy simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology. PMID:26057576