Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “KEYING”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Secure key storage and distribution

This disclosure describes a distributed, fault-tolerant security system that enables the secure storage and distribution of private keys. In one implementation, the security system includes a plurality of computing resources that independently store private keys provided by publishers and encrypted using a single security system public key. To protect against malicious activity, the security system private key necessary to decrypt the publication private keys is not stored at any of the computing resources. Rather portions, or shares of the security system private key are stored at each of the computing resources within the security system and multiple security systems must communicate and share partial decryptions in order to decrypt the stored private key.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Partitioned key-value store with atomic memory operations

A partitioned key-value store is provided that supports atomic memory operations. A server performs a memory operation in a partitioned key-value store by receiving a request from an application for at least one atomic memory operation, the atomic memory operation comprising a memory address identifier; and, in response to the atomic memory operation, performing one or more of (i) reading a client-side memory location identified by the memory address identifier and storing one or more key-value pairs from the client-side memory location in a local key-value store of the server; and (ii) obtaining one or more key-value pairs from the local key-value store of the server and writing the obtained one or more key-value pairs into the client-side memory location identified by the memory address identifier. The server can perform functions obtained from a client-side memory location and return a result to the client using one or more of the atomic memory operations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Parallel storage system with burst buffer appliance for storage of partitioned key-value store across a plurality of storage tiers

Parallel storage systems are provided with a burst buffer appliance for storage of a partitioned key-value store across a plurality of storage tiers. The burst buffer appliance is configured to store key-value data on first and second storage tiers comprising respective disjoint subsets of storage. One or more servers in the partitioned key-value store provide (i) an interface between one or more local key-value stores and one or more additional storage architectures, and/or (ii) a key value interface that provides access to at least one hardware key-value store. The local key-values are optionally sorted both locally by the local store and globally by the overall MDHIM framework. The local and global sorting can be leveraged to provide batch input/output (IO) operations that aggregate multiple requests into batch operations on one or more sorted ranges.

Bent, John M.↗
NASA NTRS2008

Optimizing Requirements Decisions with KEYS

Recent work with NASA's Jet Propulsion Laboratory has allowed for external access to five of JPL's real-world requirements models, anonymized to conceal proprietary information, but retaining their computational nature. Experimentation with these models, reported herein, demonstrates a dramatic speedup in the computations performed on them. These models have a well defined goal: select mitigations that retire risks which, in turn, increases the number of attainable requirements. Such a non-linear optimization is a well-studied problem. However identification of not only (a) the optimal solution(s) but also (b) the key factors leading to them is less well studied. Our technique, called KEYS, shows a rapid way of simultaneously identifying the solutions and their key factors. KEYS improves on prior work by several orders of magnitude. Prior experiments with simulated annealing or treatment learning took tens of minutes to hours to terminate. KEYS runs much faster than that; e.g for one model, KEYS ran 13,000 times faster than treatment learning (40 minutes versus 0.18 seconds). Processing these JPL models is a non-linear optimization problem: the fewest mitigations must be selected while achieving the most requirements. Non-linear optimization is a well studied problem. With this paper, we challenge other members of the PROMISE community to improve on our results with other techniques.

requirements↗
NASA NTRS2013

Modular Connector Keying Concept

For panel-mount-type connectors, keying is usually "built-in" to the connector body, necessitating different part numbers for each key arrangement. This is costly for jobs that require small quantities. This invention was driven to provide a cost savings and to reduce documentation of individual parts. The keys are removable and configurable in up to 16 combinations. Since the key parts are separate from the connector body, a common design can be used for the plug, receptacle, and key parts. The keying can then be set at the next higher assembly.

Ishman, Scott↗
DOE OSTI2013

Secure multi-party communication with quantum key distribution managed by trusted authority

Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

Secure multi-party communication with quantum key distribution managed by trusted authority

Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Secure multi-party communication with quantum key distribution managed by trusted authority

Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Fault Tolerant Key Generation and Secure Spread Spectrum Communication

This study presents a secure information transmission system compromised of two main parts. The first component makes use of the principle of reciprocity in frequency-selective wireless channels to derive a pair of keys for two legitimate parties. The proposed key generation algorithm allows for two asynchronous transceivers to derive a pair of similar keys. Moreover, we apply a unique augmentation - called strongest path cancellation (SPC) - to the keys and have validated through simulation and real-world measurements that this technique significantly boosts the security level of the overall design. In the second part of the secure information transmission system, we introduce the concept of artificial noise to multi-carrier spread-spectrum (MC-SS) systems. The keys generated in the first part are used as spreading code sequences for MC-SS and artificial noise is added to further enhance the security of this communication setup. Two different attacks on our proposed system are evaluated. First, a passive adversary who follows the exact same steps as the legitimate users to detect confidential information is considered. In the second attack, we evaluate the design in presence of an adversary with significant blind detection capabilities.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2017

Provably secure and high-rate quantum key distribution with time-bin qudits

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

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↗
DOE OSTI2023

Inventory of Public Key Cryptography in US Electric Vehicle Charging

Electric vehicles (EVs) and charging infrastructure are networked systems, which employ high-level communications in support of charging and grid service decisions. Public key cryptography (PKC) underlies much of the security and privacy protections of the information exchange. We are entering a new epoch where quantum computing threats must be seriously considered. A sufficiently large quantum computer, so named Cryptographically Relevant Quantum Computer (QRQC), will be able to perform the mathematical operations to efficiently attack the underpinnings of traditional PKC, thus jeopardizing the digital foundations for trust, communications security, and data security. Estimates suggest a QRQC can break public key encryption and digital signatures in the manner of tens to hundreds of hours, compared to traditional computing that would demand more than 10 18 years in a brute force-style attack. A consensus belief of quantum theorists, quantum experimenters, and cryptographers suggest that the quantum threat will be likely realized in the next twenty years. To address the threat, post-quantum cryptography, which is cryptosystems that are designed to be secure against both traditional and quantum computing threats, must be adopted. Migration from traditional PKC to quantum-resilient cryptography is a global undertaking and likely represents the largest transition in computing history. The nascent state of EV public key infrastructure, combined with limited adoption of the vehicle secure charging features, presents an opportunity to establish a preference for quantum-resistant cryptography as a step on the migration path. Delays will stunt the efforts as rapidly accelerating EVs sales and huge infrastructure investments will create large growing bases of long-lived vehicles and infrastructure. Migration preparations can commence while NIST continues the process to standardize post-quantum cryptography (PQC), which are quantum-resilient algorithms designed to be secure against traditional and quantum computing threats. The first step in preparing EV charging is to identify the presence of traditional public key cryptography algorithms and applications. With this objective in mind, this report is intended to advise the vehicle manufacturers, charging station manufacturers, charging station operators, charge network providers and other EV charging stakeholders with information on traditional PKC application and the potential risks when PKC becomes insecure. This report, the first in a series of reports discussing the topics existing at the confluence of post-quantum cryptography adoption and EV charging, identifies traditional public key applications employed and identifies potential consequences of leaving EV charging infrastructure vulnerable to quantum computing. The focus remains squarely on the of EV charging and infrastructure with respect to PKC and is believed by the authors to complement the NIST SP 1800-38 Migration to Post-Quantum Cryptography. While the report is centered on infrastructure, there are implications to vehicles.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Theoretical studies of chemical reactions related to the formation and growth of polycyclic aromatic hydrocarbons (PAH) and molecular properties of their key intermediates (Final Progress Report)

The formation mechanisms of polycyclic aromatic hydrocarbons, (PAHs) – organic molecules carrying fused benzene rings – are of great interest to scientists and engineers due to their importance in combustion chemistry and astrochemistry. On Earth, PAHs are largely produced in incomplete combustion of fossil fuel and are considered as critical precursors to unwanted soot particles leading to combustion inefficiency and causing air pollution along with detrimental health effects. Simple PAH molecules initially formed in the gas phase, are further involved in a build-up process in combustion flames leading to larger PAH, bowl-shaped nanostructures, fullerenes, and solid-phase species including carbonaceous dust, graphene particles, and soot. In deep space, PAH and their derivatives are potential key intermediates and nucleation sites leading eventually to carbonaceous nanoparticles (“interstellar grains”). Therefore, the understanding of the key processes in the synthesis of PAHs along with their precursors and their degradation mechanisms in combustion systems and in interstellar, circumstellar, and planetary atmospheric environments will provide critical insights into how complex aromatic structures, carbonaceous nanoparticles, and fullerenes are formed and destroyed. Achieving this understanding is an important step in the development of the efficient combustion processes and of the ecofriendly devices with reduced environmental pollution as well as technological strategies for the production of hydrogen and solid carbon through thermal or plasma-assisted pyrolysis of natural gas and biomass. Also, the understanding of the key processes of PAH and soot growth will help in our comprehension of chemical evolution in the universe. Detailed information on the mechanisms and reliable rate constants of the key elementary chemical reactions involved in PAH formation and destruction processes and in inception of soot particles is often missing, with the main deficiencies being the absence of temperature- and pressure-dependent rate constants for the broad range of conditions occurring in various terrestrial and interstellar processes and the lack of data on the reaction products and their branching ratios. Complementary to experimental studies, these gaps in knowledge can be filled by using quantum chemical calculations of reaction potential energy surfaces providing us with accurate energies of reaction products, intermediates, and transition states, revealing the reaction mechanism, and giving the molecular properties required to compute rate constants for relevant reaction steps and product branching ratios using the RRKM-Master Equation (ME) method. Molecular dynamics (MD) simulations can be used in cases when a reaction rate cannot be properly described by statistical theories. During the terminal renewal project period we employed these ab initio/RRKM-ME and MD approaches to complete our studies on several key reactions relevant to the formation/growth of PAH and inception of soot particles including (1) the reaction mechanism and kinetics of the resonance stabilized fulvenallenyl radical with propargyl and C 3 H 4 isomers; (2) the reaction mechanism and kinetics for the C + indene and C 2 + styrene reactions producing naphthyl or azulenyl radicals in low-temperature environments; (3) the MD study of non-equilibrium dimerization of acepyrene and coronene and its radical. The information derived from our theoretical calculations contributed to a better fundamental understanding of the reaction mechanisms and provide missing critical kinetic data to improve combustion models of hydrocarbon fuels and astrochemical models of the growth of carbonaceous molecules and particles in cold molecular clouds, circumstellar envelopes, and planetary atmospheres.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1996

A Secure Key Distribution System of Quantum Cryptography Based on the Coherent State

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.

Guo, Guang-Can↗
NASA NTRS1960

Problems Involved in an Emergency Method of Guiding a Gliding Vehicle from High Altitudes to a High Key Position

An investigation has been conducted to determine the problems involved in an emergency method of guiding a gliding vehicle from high altitudes to a high key position (initial position) above a landing field. A jet airplane in a simulated flameout condition, conventional ground-tracking radar, and a scaled wire for guidance programming on the radar plotting board were used in the tests. Starting test altitudes varied from 30,000 feet to 46,500 feet, and starting positions ranged 8.4 to 67 nautical miles from the high key. Specified altitudes of the high key were 12,000, 10,000 or 4,000 feet. Lift-drag ratios of the aircraft of either 17, 16, or 6 were held constant during any given flight; however, for a few flights the lift-drag ratio was varied from 11 to 6. Indicated airspeeds were held constant at either 160 or 250 knots. Results from these tests indicate that a gliding vehicle having a lift-drag ratio of 16 and an indicated approach speed of 160 knots can be guided to within 800 feet vertically and 2,400 feet laterally of a high key position. When the lift-drag ratio of the vehicle is reduced to 6 and the indicated approach speed is raised to 250 knots, the radar controller was able to guide the vehicle to within 2,400 feet vertically and au feet laterally of the high key. It was also found that radar stations which give only azimuth-distance information could control the glide path of a gliding vehicle as well as stations that receive azimuth-distance-altitude information, provided that altitude information is supplied by the pilot.

Jewel, Joseph W., Jr.↗
DOE OSTI2014

Apparatus, system, and method for synchronizing a timer key

A timer key relating to monitoring a countdown time of a countdown routine of an electronic device is disclosed. The timer key comprises a processor configured to respond to a countdown time associated with operation of the electronic device, a display operably coupled with the processor, and a housing configured to house at least the processor. The housing has an associated structure configured to engage with the electronic device to share the countdown time between the electronic device and the timer key. The processor is configured to begin a countdown routine based at least in part on the countdown time, wherein the countdown routine is at least substantially synchronized with a countdown routine of the electronic device when the timer key is removed from the electronic device. A system and method for synchronizing countdown routines of a timer key and an electronic device are also disclosed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Methods for synchronizing a countdown routine of a timer key and electronic device

A timer key relating to monitoring a countdown time of a countdown routine of an electronic device is disclosed. The timer key comprises a processor configured to respond to a countdown time associated with operation of the electronic device, a display operably coupled with the processor, and a housing configured to house at least the processor. The housing has an associated structure configured to engage with the electronic device to share the countdown time between the electronic device and the timer key. The processor is configured to begin a countdown routine based at least in part on the countdown time, wherein the countdown routine is at least substantially synchronized with a countdown routine of the electronic device when the timer key is removed from the electronic device. A system and method for synchronizing countdown routines of a timer key and an electronic device are also disclosed.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

Rethinking key–value store for parallel I/O optimization

Key-value stores are being widely used as the storage system for large-scale internet services and cloud storage systems. However, they are rarely used in HPC systems, where parallel file systems are the dominant storage solution. In this study, we examine the architecture differences and performance characteristics of parallel file systems and key-value stores. We propose using key-value stores to optimize overall Input/Output (I/O) performance, especially for workloads that parallel file systems cannot handle well, such as the cases with intense data synchronization or heavy metadata operations. We conducted experiments with several synthetic benchmarks, an I/O benchmark, and a real application. We modeled the performance of these two systems using collected data from our experiments, and we provide a predictive method to identify which system offers better I/O performance given a specific workload. The results show that we can optimize the I/O performance in HPC systems by utilizing key-value stores.

Hyperdex↗