Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 145 records · Page 8

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↗

Verifying the Computational Integrity of Power Grid Controls with Zero-Knowledge Proof

The control of future power grids is migrating from a centralized to a distributed/decentralized scheme to enable a massive penetration of distributed energy resources with rising dependence on communication infrastructure. A common assumption made for most existing distributed/decentralized controllers is that local controllers would faithfully follow the designated controller dynamics based on the data received from communication channels. However, with increased probability of cyberattacks on Operational Technology infrastructure, such an assumption could be risky because proper execution of the controller dynamics is then built on trust in secure communication and computation. In this work, we leverage a cryptography technology known as zero-knowledge scalable transparent arguments of knowledge (zk-STARK) to verify the computational integrity of power grid control algorithms, with projected linear dynamics-based control schemes as the initial proof-of-concept test case. The method presented here converts the cybersecurity challenge of data integrity for grid control into a subset of computational integrity.

computational integrity↗

Practical State Machine Replication with Confidentiality

We study how to enable arbitrary randomized algorithms in Byzantine fault-tolerant (BFT) settings. We formalize a randomized BFT protocol and provide a simple and efficient construction that can be built on any existing BFT protocols while adding practically no overhead. We go one step further to revisit a confidential BFT protocol (Yin et al., SOSP '03). We show that their scheme is potentially susceptible to safety and confidentiality attacks. We then present a new protocol that is secure in the stronger model we formalize, by extending the idea of a randomized BFT protocol. Our protocol uses only efficient symmetric cryptography, while Yin et al.'s uses costly threshold signatures. We implemented and evaluated our protocols on microbenchmarks and real-world use cases. We show that our randomized BFT protocol is as efficient as conventional BFT protocols, and our confidential BFT protocol is two to three orders of magnitude faster than Yin et al.'s, which is less secure than ours.

Duan, Sisi↗

The Complexity of Bit Retrieval

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

97 MATHEMATICS AND COMPUTING↗

Entanglement classifier in chemical reactions

The Einstein, Podolsky, and Rosen (EPR) entanglement, which features the essential difference between classical and quantum physics, has received wide theoretical and experimental attentions. Recently, the desire to understand and create quantum entanglement between particles such as spins, photons, atoms, and molecules is fueled by the development of quantum teleportation, quantum communication, quantum cryptography, and quantum computation. Although most of the work has focused on showing that entanglement violates the famous Bell’s inequality and its generalization for discrete measurements, few recent attempts focus on continuous measurement results. Here, we have developed a general practical inequality to test entanglement for continuous measurement results, particularly scattering of chemical reactions. After we explain how to implement this inequality to classify entanglement in scattering experiments, we propose a specific chemical reaction to test the violation of this inequality. The method is general and could be used to classify entanglement for continuous measurement results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A chemical path to quantum information

The second quantum revolution is rapidly transforming fields like structural biology, cryptography, and condensed matter physics. The qubit is the core quantum unit, which has an infinite number of possible configurations through the superposition of its quantum states. This quantum property provides a unique approach for solving problems in computing, sensing, and metrology. Creating and manipulating qubits is a grand challenge, leading to a plethora of viable approaches. Spinbased molecular qubits are promising because they unify atomic scale spatial precision with structural customization for systems integration. Lombardi et al. exemplify this approach by constructing an electronic spin-based molecular qubit from a carefully engineered state in nanoscale graphene, providing an elegant example of atomic control over qubit design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

A Fast VANET-Assisted Scheme for Event Data Recorders

An event data recorder (EDR) is a device installed in a vehicle to record information. Similar to a black box in an airplane, an EDR is used in the study of automobile accidents. Many schemes have been proposed that use vehicle network technology to help record EDR data, including schemes involving storing data on roadside units or nearby vehicles and schemes leveraging blockchain technology. However, these schemes do not take into account the vehicle company’s server; with the increased use of autonomous vehicles, the data related to these vehicles are always uploaded to the vehicle company’s server. In this scenario, we classify the situation into different cases, according to whether or not it is an emergency and whether the vehicle and the server are connected. For these cases, we propose a scheme whereby a vehicle uploads the EDR data to a cloud server and sends the evidence of storage to the nearby vehicle through a vehicular ad hoc network. Our scheme offers a fast response due to the use of symmetric cryptography algorithms while also considering security requirements.

Liu, Wei↗

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↗

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↗

Quantum key distribution and beyond: introduction

This feature issue presents a collection of recent theoretical and experimental developments in the field of quantum key distribution (QKD) and its extension to other quantum cryptography protocols and devices. It encompasses work on a variety of QKD protocols, including continuous-variable, measurement-device independent, and twin-field QKD, as well as other newly proposed protocols, in platforms ranging from optical fiber through to wireless indoor and satellite links. It covers examples of hacking strategies and their countermeasures as well as applications of machine learning techniques in designing quantum networks. It also includes new developments in efficient superconducting photon-number resolving detectors as well as fast quantum random number generators. Distinctively, this feature issue demonstrates how different expertise in science and engineering can come together to produce an outcome that hopefully takes us one step closer to the wide-scale deployment of quantum communications technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement-based quantum digital signatures over a deployed campus network

The quantum digital signature protocol offers a replacement for most aspects of public-key digital signatures ubiquitous in today’s digital world. A major advantage of a quantum-digital-signatures protocol is that it can have information-theoretic security, whereas public-key cryptography cannot. Here we demonstrate and characterize hardware to implement entanglement-based quantum digital signatures over our campus network. Over 25 hours, we collect measurements on our campus network, where we measure sufficiently low quantum bit error rates (<5% in most cases) which in principle enable quantum digital signatures at over 50 km as shown through rigorous simulation accompanied by a noise model developed specifically for our implementation. These results show quantum digital signatures can be successfully employed over deployed fiber. Moreover, our reported method provides great flexibility in the number of users, but with reduced entanglement rate per user. Finally, while the current implementation of our entanglement-based approach has a low signature rate, feasible upgrades would significantly increase the signature rate.

97 MATHEMATICS AND COMPUTING↗

Efficient design of random metasurfaces

Random media introduce large degrees of freedom in device design and can thus address challenges in manipulating optical waves. Wave shaping with metasurfaces has mainly utilized periodic or quasi-periodic grids, and the potential of random arrangement of particles for devices has only come under investigation recently. The main difficulty in pursuing random metasurfaces is the identification of the degrees of freedom that optimize their efficiencies and functions. They can also encode information using the statistics of particle distribution. We propose a phase-map that accounts for the statistical nature of random media. The method takes into account effects of random near-field couplings that introduce phase errors by affecting the phase shift of elements. The proposed approach increases the efficiency of our random metasurface devices by up to ~20%. Furthermore, this work paves the way toward the efficient design of random metasurfaces with potential applications in highly secure optical cryptography and information encoding.

Nasari, Hadiseh↗

Nanolaser arrays: toward application-driven dense integration

Abstract The past two decades have seen widespread efforts being directed toward the development of nanoscale lasers. A plethora of studies on single such emitters have helped demonstrate their advantageous characteristics such as ultrasmall footprints, low power consumption, and room-temperature operation. Leveraging knowledge about single nanolasers, the next phase of nanolaser technology will be geared toward scaling up design to form arrays for important applications. In this review, we discuss recent progress on the development of such array architectures of nanolasers. We focus on valuable attributes and phenomena realized due to unique array designs that may help enable real-world, practical applications. Arrays consisting of exactly two nanolasers are first introduced since they can serve as a building block toward comprehending the behavior of larger lattices. These larger-sized lattices can be distinguished depending on whether or not their constituent elements are coupled to one another in some form. While uncoupled arrays are suitable for applications such as imaging, biosensing, and even cryptography, coupling in arrays allows control over many aspects of the emission behavior such as beam directionality, mode switching, and orbital angular momentum. We conclude by discussing some important future directions involving nanolaser arrays.

Deka, Suruj S.↗

Analysis of Design Constraints and System Impact of DER Cryptographic Module

In designing a security module for inverter communications in a DER environment, it is critical to consider the impact of the additional security on the environment as well as what types of security is required for the various messages that must pass from the inverter to and from a utility. Also, since cyber security is more than just preventing an unauthorized user from viewing data, mechanisms for proving identity and ensuring that data cannot be altered without such a modification being discovered are needed. This is where the security principles of confidentiality, integrity, and availability come into play. For different types of communications, these different security principles may be important or not needed at all. Furthermore, the cost and constraints for applying cryptography for securing DER communications must be considered to help determine what is feasible within this environment and what will be the impact and cost of applying common cryptographic protections to inverter communications.

97 MATHEMATICS AND COMPUTING↗

Analysis of Design Constraints and System Impact of DER Cryptographic Module

In designing a security module for inverter communications in a DER environment, it is critical to consider the impact of the additional security on the environment as well as what types of security is required for the various messages that must pass from the inverter to and from a utility. Also, since cyber security is more than just preventing an unauthorized user from viewing data, mechanisms for proving identity and ensuring that data cannot be altered without such a modification being discovered are needed. This is where the security principles of confidentiality, integrity, and availability come into play. For different types of communications, these different security principles may be important or not needed at all. Furthermore, the cost and constraints for applying cryptography for securing DER communications must be considered to help determine what is feasible within this environment and what will be the impact and cost of applying common cryptographic protections to inverter communications.

97 MATHEMATICS AND COMPUTING↗

Module OT Laboratory Test Procedure

This document will detail a test procedure, involving bench and emulation testing, for the Module OT device developed for the joint NREL-SNL DOE CEDS project titled "Modular Security Apparatus for Managing Distributed Cryptography for Command & Control Messages on Operational Technology (OT) Networks." The aim of this document is to create the testing and evaluation protocol for the module for lab-level testing; this includes checklists and experiments for information gathering, functional testing, cryptographic implementation, public key infrastructure, key exchange/authentication, encryption, and implementation testing in the emulation environment.

97 MATHEMATICS AND COMPUTING↗

Module OT PNM Field Demonstration Test Procedure

This document will detail a field demonstration test procedure for the Module OT device developed for the joint NREL-SNL DOE CEDS project titled "Modular Security Apparatus for Managing Distributed Cryptography for Command & Control Messages on Operational Technology (OT) Networks." The aim of this document is to create the testing and evaluation procedure for field demonstration of the device; this includes primarily functional testing and implementation testing at Public Service Company of New Mexico's (PNM's) Prosperity solar site environment. Specifically, the Module OT devices will be integrated into the Prosperity solar site system; traffic will be encrypted between several points of interest at the site (e.g., inverter micrologger and switch). The tests described in this document will be performed to assess the impact and effectiveness of the encryption capabilities provided by the Module OT device.

97 MATHEMATICS AND COMPUTING↗