Composite Private Key Generation via Addressable Cryptographic Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional encryption schemes using shared keys face challenges in generating extended-length cryptographic keys without reducing entropy, as they require sharing and storing large keys, which is resource-intensive and can compromise security, especially when multiple keys are needed.
Innovation Solution
The method involves generating composite encryption keys by concatenating and manipulating bitstreams from an addressable cryptographic table using co-prime integers and permutation instructions, with error correction and physical unclonable function (PUF) devices to create extended-length keys that do not repeat patterns, optimizing key generation through multi-threaded processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional encryption schemes use shared cryptographic keys, then secure communication is achieved, but the key length and number of available keys are limited by memory limitations and communication bandwidth
Solution Approach 1:
The cryptographic table is divided into multiple segments or regions that can be independently addressed. Instead of transmitting or storing entire long keys, the system segments the key space into manageable portions accessible through addressable locations in the cryptographic table, allowing long effective key lengths without proportional increases in memory or bandwidth requirements
Solution Approach 2:
The cryptographic table acts as an intermediary structure between the communication parties. Rather than directly sharing long cryptographic keys, parties use the table as a mediator where key material is stored at specific addresses, and only address information (not the full key content) needs to be communicated, thus achieving long key lengths without proportional increases in communication bandwidth
2Adaptability or versatility
If multiple cryptographic keys are generated and stored, then key availability increases, but memory requirements and security risks increase
Solution Approach 1:
The cryptographic table serves multiple functions simultaneously: it stores key material, provides addressable access to numerous keys, enables secure communication, and supports generation of extended-length keys. This multi-functionality allows the system to provide numerous available keys without proportionally increasing memory requirements, as the same structure supports both storage and access efficiency
3Ease of operation
If cryptographic tables are shared between sender and receiver, then key establishment is simplified, but the system becomes vulnerable to attacks and requires secure transmission of table information
Solution Approach 1:
The critical secret information is extracted from the full cryptographic table content and reduced to only the address information needed to access specific key material. Instead of sharing or transmitting the entire cryptographic table or full keys, only the addresses (which are much smaller and can be securely managed) need to be communicated between parties, reducing the attack surface while maintaining ease of key establishment
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This approach extends the private key space indefinitely, ensuring high entropy and efficient generation of multiple composite keys, improving speed and security by using permutations and manipulations to create unique composite keys without repeating patterns.
Implementation Method 1
retrieving the first and second bitstreams from the addressable cryptographic table comprises measuring physical characteristics of physical unclonable function (“PUF”) devices of a PUF array of the computing device at addresses in the PUF array derived from the initial instruction
Data Source
AI summary
A system and method for the generation of composite private keys are provided. First and second bitstreams are retrieved from an addressable cryptographic table by deriving addresses in the addressable cryptographic table from an initial instruction, accessing first and second bit values stored at addresses belonging to the derived addresses in the addressable cryptographic table, and outputting the first bit values as the first bitstream and the second bit values as the second bitstream. The first bitstream is concatenated with data from the first bitstream to form a data stream having a desired length and the second bitstream is concatenated with data from the second bitstream to form a selector stream having the desired length. A first composite encryption key having a length longer than the first and second bitstreams is formed by selecting values of the data stream identified by corresponding bit values of the selector stream.