Variable Layout Cryptography for Linear Complexity Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional cryptographic algorithms face performance inefficiencies due to increasing computational complexity with larger key lengths, leading to slower encryption and decryption processes as the size of the key increases exponentially with each bit added.
Innovation Solution
A variable layout cryptography system that generates a primary encryption/decryption key with metadata and key-blocks, splitting data into portions based on parallel and series nodes for parallel processing, reducing computational complexity and increasing encryption/decryption speed by handling each segment in parallel.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the key length is increased to improve security, then the encryption strength is improved, but the computational complexity increases exponentially
Solution Approach 1:
The patent divides the encryption process into multiple passes, where each pass uses a portion of the key bits. Instead of applying one large key in a single operation, the key is segmented and applied iteratively through multiple encryption passes, transforming exponential complexity into linear complexity while maintaining security.
2Reliability
If the key length is increased to improve security, then the encryption strength is improved, but the encryption speed decreases
Solution Approach 1:
The encryption process is segmented into multiple passes, each handling a portion of the key. This segmentation allows the system to process the same security level as a long key but with faster, smaller operations repeated multiple times, improving overall encryption speed while maintaining security strength.
Solution Approach 2:
The patent employs periodic action by repeating the encryption process multiple times in succession, with each pass using a different segment of the key. This periodic application of encryption transforms the single slow operation into multiple faster operations, achieving both security and speed improvements.
3Reliability
If the key length is increased to improve security, then the encryption strength is improved, but the computation time increases
Solution Approach 1:
The key is segmented into multiple portions that are applied in separate encryption passes. This segmentation reduces the computational burden of each individual pass, allowing the system to achieve the same security level as a long key but with significantly reduced computation time per pass, overall reducing total computation time.
Solution Approach 2:
The encryption process is executed periodically in multiple passes rather than as a single operation. This periodic execution breaks down the time-consuming long-key encryption into several shorter, faster operations, maintaining security while reducing total computation time.
Data Source
AI summary
Methods, systems and computer program products for improving performance of a cryptographic algorithm are described. First, data to be encrypted/decrypted is provided as input to the system. A primary key, or multiple keys (in case of asymmetric cryptography), is generated for the encryption/decryption process. The primary key consists of metadata as well as key blocks containing secondary keys. The metadata contains information explaining how the data will be handled from algorithmic structure to the base cryptographic scheme to be used. Further, the data is split and processed via relevant portions of the key blocks. Finally, the completed encrypted/decrypted data segments are combined in order to complete the process. The used process ensures higher performance as well as higher algorithmic entropy than comparable methods in literature or on the market.