Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum cryptography”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Concatenation of Keys in Quantum Cryptography: How Quantum Entanglement “Penetrates to” Classical Devices

Quantum mechanics admits collective measurements that are related to the projection onto entangled states and allow one to retrieve more classical information from an ensemble of quantum states compared with individual measurements. In this relation, a fundamental question arises for key secrecy in quantum cryptography. Should the secrecy criterion be formulated with regard to all keys distributed both on previous and future quantum key distribution (QKD) sessions, or it suffices to guarantee key secrecy only in an individual QKD session? The study of this question is the subject of the present paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum cryptography and combined schemes of quantum cryptography communication networks

We discuss cryptographic data protection network schemes combining the approaches of quantum cryptography with advanced computer information processing methods. The use of the latter is due to the presence of a number of unsolved problems in the existing quantum key distribution systems and is also associated with projects for the development of network-centric quantum communications and photonic networks, which involves the employment of multi-agent control models. Developments based on the Y-00 protocol with data encoding by the quantum noise of a transmitting laser are considered, and achievements in the field of quantum-optical random number generators are presented. The latter can be also used to design secure multi-valued logic encoding schemes that are promising for increasing the dimension of the key space in the ‘one-time pad’ method, for solving the tasks of position-dependent cryptography and for implementing multi-agent models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement-device-independent quantum cryptography

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Possibilities of using practical limitations of an eavesdropper in quantum cryptography

An important advantage of quantum cryptography over classical cryptography consists in the fact that the security of the transmitted keys is not related to the assumptions about the eavesdropper capabilities and is guaranteed by the laws of nature. Nevertheless, in some situations it makes sense to consider some reasonable assumptions about the eavesdropper capabilities, which can increase the secret key distribution rate. Methods are proposed for legitimate users to employ some practical limitations, and attacks are constructed that the eavesdropper can apply under the conditions of these limitations. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Insecurity of position-based quantum-cryptography protocols against entanglement attacks

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distinguishability of quantum states and shannon complexity in quantum cryptography

The proof of the security of quantum key distribution is a rather complex problem. Security is defined in terms different from the requirements imposed on keys in classical cryptography. In quantum cryptography, the security of keys is expressed in terms of the closeness of the quantum state of an eavesdropper after key distribution to an ideal quantum state that is uncorrelated to the key of legitimate users. A metric of closeness between two quantum states is given by the trace metric. In classical cryptography, the security of keys is understood in terms of, say, the complexity of key search in the presence of side information. In quantum cryptography, side information for the eavesdropper is given by the whole volume of information on keys obtained from both quantum and classical channels. The fact that the mathematical apparatuses used in the proof of key security in classical and quantum cryptography are essentially different leads to misunderstanding and emotional discussions [1]. Therefore, one should be able to answer the question of how different cryptographic robustness criteria are related to each other. In the present study, it is shown that there is a direct relationship between the security criterion in quantum cryptography, which is based on the trace distance determining the distinguishability of quantum states, and the criterion in classical cryptography, which uses guesswork on the determination of a key in the presence of side information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Streaming authentication and multi-level security for communications networks using quantum cryptography

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

97 MATHEMATICS AND COMPUTING↗

Streaming authentication and multi-level security for communications networks using quantum cryptography

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

Hughes, Richard J.↗

Coherent-state quantum cryptography using pseudorandom number generators

Quantum key distribution plays an important role in modern cryptography, since the security of the transmitted keys is guaranteed by fundamental laws of nature. A method using pseudorandom number generators well known from classical cryptography is considered. It is shown that their use in quantum cryptography makes it possible to increase the key generation rate under very weak assumptions about the capabilities of the eavesdropper. A practical scheme of a coherent-state quantum key distribution protocol using pseudorandom sequences is proposed. The cryptographic strength of the proposed protocol against a beam-splitting attack is considered. (quantum cryptography)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relativistic quantum cryptography

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesoscopic quantum cryptography

Since a strictly single-photon source is not yet available, in quantum cryptography systems, one uses, as information quantum states, coherent radiation of a laser with an average number of photons of μ ≈ 0.1–0.5 in a pulse, attenuated to the quasi-single-photon level. The linear independence of a set of coherent quasi-single-photon information states leads to the possibility of unambiguous measurements that, in the presence of losses in the line, restrict the transmission range of secret keys. Starting from a certain value of critical loss (the length of the line), the eavesdropper knows the entire key, does not make errors, and is not detected—the distribution of secret keys becomes impossible. This problem is solved by introducing an additional reference state with an average number of photons of μ{sub cl} ≈ 10{sup 3}–10{sup 6}, depending on the length of the communication line. It is shown that the use of a reference state does not allow the eavesdropper to carry out measurements with conclusive outcome while remaining undetected. A reference state guarantees detecting an eavesdropper in a channel with high losses. In this case, information states may contain a mesoscopic average number of photons in the range of μ{sub q} ≈ 0.5–10{sup 2}. The protocol proposed is easy to implement technically, admits flexible adjustment of parameters to the length of the communication line, and is simple and transparent for proving the secrecy of keys.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On a two-pass scheme without a faraday mirror for free-space relativistic quantum cryptography

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comment on 'Two-way protocols for quantum cryptography with a nonmaximally entangled qubit pair'

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of intensity fluctuations in quantum cryptography with coherent states

A new type of attack in quantum cryptography with coherent states is considered. This attack calls for only a possibility of changing (within some limits) the intensity of the states reaching a receiver. The critical quantum bit error rate (QBER) of the B92 protocol with a strong reference state is calculated for different limitations on intensity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Are There Enough Decoy States to Ensure Key Secrecy in Quantum Cryptography?

The decoy state method has been proposed to detect a photon number splitting (PNS) attack. Today, the decoy state method is considered to be an almost universal method for proving the secrecy of quantum cryptography protocols and calculating the length of a secret key. In this paper, it is shown that there exist attacks, for example, a beam splitting (BS) attack, to which the decoy state method turns out to be insensitive. The decoy state method is oriented to the detection of changes in the photocount statistics of information states and decoy states under a PNS attack. Under a BS attack, the photocount statistics is not changed. As a result, the decoy state method significantly overestimates the length of the key. Thus, the decoy state method is not a universal method that allows the detection of various attacks. Apparently, due to a large number of publications on the decoy state method, a widespread opinion has been formed that this method is universal. This fact has led to attempts to adopt this method as an international standard in quantum cryptography, which is clearly premature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Security of counterfactual quantum cryptography

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗