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 217 records · Page 12

Quantum circuit for the proof of the security of quantum key distribution without encryption of error syndrome and noisy processing

One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High heralding-efficiency of near-IR fiber coupled photon pairs for quantum technologies

We report on the development and use of a high heralding-efficiency, single-mode-fiber coupled telecom-band source of entangled photons for quantum technology applications. The source development efforts consisted of theoretical and experimental efforts and we demonstrated a correlated-mode coupling efficiency of 97% 2%, the highest efficiency yet achieved for this type of system. We then incorporated these beneficial source development techniques in a Sagnac configured telecom-band entangled photon source that generates photon pairs entangled in both time/energy and polarization degrees of freedom. We made use of these highly desirable entangled states to investigate several promising quantum technologies.

CRYPTOGRAPHY↗

The Essence of Cryptol: A Denotational Cryptol Interpreter in Coq for Foundational Assurances for Quantum Resistant Cryptosystems

Systems of the utmost consequence need a means to establish authenticity of software and data. Cryptosystems implement authentication, but can be vulnerable to cryptographic and implementation attacks. With the threat of quantum cryptographic attacks, “post-quantum” cryptosystems (PQCs) must be henceforth used in these systems. However, the new cryptography needs new ways to, rigorously and machine-checkably, prove systems free of vulnerabilities. We propose a retargetable capability to rapidly instantiate proven correct postquantum cryptosystems through novel proof-carrying synthesis and proof-automation technique, extending those proven successful on existing systems. This capability is crucial to meeting the cryptographic requirements for future high-consequence systems. Since specifications for high consequence cryptography are presently captured in a domain specific language known as Cryptol. While this can enable convenient fully automated reasoning about Cryptol specificaitons and implementations via the Software Analysis Workbench (SAW), Cryptol has expressivity gaps, so that cryptosystems with probabilistic programming features like Falcon cannot be fully expressed in the language. Moreover, SAW’s automation fails for programs and specificaitons with inductive and recursive structure, as in the Sphincs+ PQC. Finally, Cryptol and SAW together represent some 200,000 lines of unverified Haskell, so that the any guarantees about high consequence cryptography are presently contingent on a large, unverified, yet trusted computing base. The first step of the larger project of agile, assured crpytography is therefore to provide a formal, mechanized semantics for Cryptol, so that the specifications expressed by cryptographers in Cryptol can be reasoned about and compiled into performant implementations with a foundational, machine checkable certificate of correctness. This report describes our work on this first step, culminating in the design of a certified denotational interpreter, in Coq, for core Cryptol.

97 MATHEMATICS AND COMPUTING↗

Pseudorandomness from Subset States

We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of Aaronson et al. [arXiv:2211.00747], who devised a similar construction augmented by pseudorandom phases. Our result follows from a direct calculation of the trace distance between t copies of random subset states and the Haar measure, via the representation theory of the symmetric group. We show that the trace distance is negligibly small, as long as the subsets are of an appropriate size which is neither too big nor too small. In particular, we analyze the action of basis permutations on the symmetric subspace, and show that the largest component is described by the Johnson scheme: the double-cosets of the symmetric group S N by the subgroup S t x S N-t . The Gelfand pair property of this setting implies that the matrix eigenbasis coincides with the symmetric group irreducible blocks, with the largest eigenblock asymptotically approaching the Haar average. An immediate corollary of our result is that quantum pseudorandom and pseudoentangled state ensembles do not require relative phases.

Computational Complexity (cs.CC)↗

An asymmetric hybrid cryptosystem using equal modulus and random decomposition in hybrid transform domain

In this paper, an asymmetric hybrid cryptosystem with coherent superposition, equal modulus and random decomposition in hybrid transform domain is proposed. To further strengthen the security of the cryptosystem, a hyperchaotic system is used as a pixel-swapping procedure. The hybrid transform is generated by utilizing fractional Fourier transform of various orders and Walsh transform. The hyperchaotic framework’s parameters and starting conditions alongside the fractional orders of the fractional Fourier transform extend the key-space and consequently give extra strength to the proposed cryptosystem. The designed cryptosystem has an extended key-space to avoid any brute-force attack and is non-linear in nature. The scheme is validated on gray-scale images. Computer based simulations have been performed to verify the validity and the performance of the proposed cryptosystem against different types of attacks. Results demonstrate that the proposed cryptosystem not only offers higher protection against noise attacks but is also invulnerable to special attack.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theoretical modeling of the dynamics of a semiconductor laser subject to double-reflector optical feedback

We theoretically model the dynamics of semiconductor lasers subject to the double-reflector feedback. The proposed model is a new modification of the time-delay rate equations of semiconductor lasers under the optical feedback to account for this type of the double-reflector feedback. We examine the influence of adding the second reflector to dynamical states induced by the single-reflector feedback: periodic oscillations, period doubling, and chaos. Regimes of both short and long external cavities are considered. The present analyses are done using the bifurcation diagram, temporal trajectory, phase portrait, and fast Fourier transform of the laser intensity. We show that adding the second reflector attracts the periodic and perioddoubling oscillations, and chaos induced by the first reflector to a route-to-continuous-wave operation. During this operation, the periodic-oscillation frequency increases with strengthening the optical feedback. We show that the chaos induced by the double-reflector feedback is more irregular than that induced by the single-reflector feedback. The power spectrum of this chaos state does not reflect information on the geometry of the optical system, which then has potential for use in chaotic (secure) optical data encryption.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Programmable Quantum Networked Microgrids

Quantum key distribution (QKD) provides a potent solution to securely distribute keys for two parties. However, QKD itself is vulnerable to denial of service (DoS) attacks. A flexible and resilient QKD-enabled networked microgrids (NMs) architecture is needed but does not yet exist. In this article, we present a programmable quantum NMs (PQNMs) architecture. It is a novel framework that integrates both QKD and software-defined networking (SDN) techniques capable of enabling scalable, programmable, quantum-engineered, and ultra-resilient NMs. Equipped with a software-defined adaptive post-processing approach, a two-level key pool sharing strategy and an SDN-enabled event-triggered communication scheme, these PQNMs mitigate the impact of DoS attacks through programmable post-processing and secure key sharing among QKD links, a capability unattainable using existing technologies. Through comprehensive evaluations, we validate the benefits of PQNMs and demonstrate the efficacy of the presented strategies under various circumstances. Extensive results provide insightful resources for building QKD-enabled NMs in practice.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Quantum Key Distribution Applicability to Smart Grid Cybersecurity Systems

To meet the increasing demand for electricity and to have a more reliable and resilient electric grid against conventional and extreme events, grid modernization is more crucial now than ever before. This will require the development and deployment of devices that provide advanced communication capabilities. The overall efficiency, reliability, and resilience of the smart grid will be inextricably linked to the exchange of information between these devices. Unfortunately, the increased information flow will increase the potential attack surface and introduce new vulnerabilities. While a smarter grid will depend critically on information flow, these benefits will be accrued only if that information can be protected. Nowadays, information is secured in smart grids primarily through cryptography. However, with the increasing number of sophisticated attacks as well as the increasing computational power, the security of the “classical” cryptographic algorithms is threatened. Quantum information science offers solutions to this problem, specifically quantum key distribution (QKD), which provides a means for the generation and secure distribution of symmetric cryptographic keys. The security of QKD stems ultimately from the very nature of quantum physics. In this paper, we investigate the applicability of QKD to the various smart grid sectors and specific use cases. We have identified 18 smart grid use cases of interest for QKD suitability together with 7 QKD factors used for the assessment of the various use cases. For each use case, the impact to security of the loss of confidentiality, integrity, and/or availability is specified. In addition, the suitability of QKD is assessed for each use case with respect to multiple factors.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Synchronization and an application of a novel fractional order King Cobra chaotic system

In this paper, we design a new three dimensional King Cobra face shaped fractional order chaotic system. The multi-scale synchronization scheme of two fractional order chaotic systems is described. The necessary conditions for the multi-scale synchronization of two identical fractional order King Cobra chaotic systems are derived through feedback control. A new cryptosystem is proposed for an image encryption and decryption by using synchronized fractional order King Cobra chaotic systems with the supports of multiple cryptographic assumptions. The security of the proposed cryptosystem is analyzed by the well known algebraic attacks. Numerical simulations are given to show the effectiveness of the proposed theoretical results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new reduced-order observer for the synchronization of nonlinear chaotic systems: An application to secure communications

This paper deals with the master-slave synchronization scheme for partially known nonlinear chaotic systems, where the unknown dynamics is considered as the master system and we propose the slave system structure which estimates the unknown states. It introduced a new reduced order observer, using the concept of Algebraic Observability; we applied the results to a Sundarapandian chaotic system, and by means of some numerical simulations we show the effectiveness of the suggested approach. Finally, the proposed observer is utilized for encryption, where encryption key is the master system and decryption key is the slave system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

pnnl/QASMBench

A low-level OpenQASM benchmark suite for NISQ evaluation and simulation. Please see our paper for details. n this repository you will find a low-level and light-weighted benchmark suite based on IBM OpenQASM language (see spec). It collects commonly seen quantum algorithms and routines from various domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, etc. QASMBench trades-off between generality and usability, covering the number of qubits ranging from 2 to 60K, and the circuit depth from 4 to 12M

Li, Ang↗

QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, and so on, trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, comprising 25K circuit evaluations. In addition we also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system.

97 MATHEMATICS AND COMPUTING↗

An iris biometric protection scheme using 4D hyperchaotic system and modified equal modulus decomposition in hybrid multi resolution wavelet domain

In this paper, a hybrid iris biometric protection scheme using 4D hyperchaotic system by means of coherent superposition and modified equal modulus decomposition in hybrid multi-resolution wavelet domain is proposed. The 4D hyperchaotic framework is employed for producing the permutation keystream for pixel swap-over mechanism. The hybrid multi-resolution is produced by means of Kronecker product of Walsh transform and fractional Fourier transform of different orders. Fractional orders of the hybrid multiresolution wavelet along with the parameters and initial conditions of the 4D hyperchaotic framework, later fill in as additional keys, thus enhancing the key space of the proposed mechanism. The proposed scheme has nonlinear characteristics and has high robustness against brute-force attack attributable to its enormous key-space. Numerical simulations have been carried out on grayscale images to prove the authenticity and efficacy of the proposed cryptosystem. The functioning of the proposed cryptosystem is investigated against various attacks including special attack. Outcomes display that the proposed iris template protection scheme not only has higher robustness against noise attack but is also unassailable to the iterative transform-based attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient wireless power transfer system with security considerations for electric vehicle applications

This paper presents a secure inductive wireless power transfer (WPT) system for electric vehicle (EV) applications, such as charging the electric devices inside EVs and performing energy exchange between EVs. The key is to employ chaos theory to encrypt the wirelessly transferred energy which can then be decrypted by specific receptors in the multi-objective system. In this paper, the principle of encrypted WPT is first revealed. Then, computer simulation is conducted to validate the feasibility of the proposed system. Moreover, by comparing the WPT systems with and without encryption, the proposed energy encryption scheme does not involve noticeable power consumption.

42 ENGINEERING↗

A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TRIM: AI Guided Random Number Generation for Resource-Constrained IoT Systems

Random numbers often serve as the backbone for many security solutions in diverse domains such as cryptography, side channel leakage prevention, and moving target defense. However, generating true random numbers requires a physical source of entropy (e.g. hardware, quantum, environmental phenomenon) making it difficult to realize at a large scale and at a low cost. On the flip side, pseudorandom number generators (easy to implement) following a specific distribution (e.g. Gaussian) can be easily compromised given a sufficient amount of traces. In this work, we have developed a machine learning-guided generative approach that can be used to create portable, resource-efficient, and cost-effective random number generators with high throughput and true randomness characteristics. We implement the proposed approach as a highly parameterized framework and perform extensive evaluation for different settings. The framework was able to learn from true random sources such as irrational numbers and environmental audio noise and imitate those sources towards generating new good quality random numbers on demand. We have generated more than 1 billion bits and observed robust performance in terms of true randomness metrics obtained from NIST SP 800-22 and FIPS 140-1 randomness test suites achieving a throughput of up to 142.85 Mbps. Compared to the state-of-the-art (SOTA) technique, the iso-cost setup of our framework can achieve more than 500 Mbps in a distributed setting. We have evaluated the efficacy of running the true randomness imitation AI models on target edge devices such as Raspberry Pi 4 (Model B), Nvidia Jetson Nano, Nvidia Jetson Orin Nano and Nvidia Jetson Xavier. We have also looked at the security of the TRIM framework itself against different adversarial threat models.

Cybersecurity↗

Extending quantum key distribution through proxy re-encryption

Modern quantum key distribution (QKD) network designs are based on sending photons from one node to another and require free-space or dedicated fiber optic cables between nodes. The purpose of this is to co-generate secret key material on both sides of the quantum channel. In addition to this quantum link, there are several insecure classical channels that allow QKD algorithms to exchange book-keeping information and send symmetrically encrypted data. The attenuation of photons transmitted through fiber becomes too high to practically generate key material over fiber at distances of more than 100 km. Free-space transmission through the atmosphere or the vacuum of space can reduce attenuation, but at the cost of system complexity and sensitivity to other impairments, such as weather. To extend the effective range of QKD networks, we present a method that combines QKD algorithms with post-quantum, homomorphic key-switching to allow multiple parties to effectively share secret key material over longer distances through semi-trusted relay nodes. We define how such a system should work for arbitrary network topologies and provide proofs that our scheme is both correct and secure. We assess the feasibility of this solution by building and evaluating two implementations based on lattice-based cryptography: learning with errors.

97 MATHEMATICS AND COMPUTING↗