Random-Key Algorithm for Data Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional symmetric key algorithms for data encryption are vulnerable to attackers guessing the shared key and encryption algorithm, as they rely on known algorithms and keys, which can be intercepted and brute-forced.
Innovation Solution
A random-key algorithm that maps multiple keys to multiple encryption algorithms randomly, storing these correlations in an index table, and decomposing messages into segments for encryption using randomly selected entries from the table, making it difficult for attackers to determine the used keys and algorithms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a traditional symmetric key algorithm is used for data encryption, then the encryption and decryption process is simple and efficient, but the system becomes vulnerable to brute force attacks where attackers can guess the shared key and decrypt the message
Solution Approach 1:
The patent divides the encryption process into multiple segments by using multiple message segments that are encrypted with different keys and algorithms. The index table is also segmented into multiple entries, each mapping a different key to a different encryption algorithm. This segmentation increases the search space for attackers while maintaining manageable complexity through systematic organization.
Solution Approach 2:
The patent introduces dynamic selection of encryption keys and algorithms by randomly selecting entries from the index table during encryption. This dynamic approach means that the same message can be encrypted with different key-algorithm combinations each time, making it difficult for attackers to predict or brute force the encryption scheme. The random selection process adds entropy and unpredictability to the system.
2Reliability
If multiple keys and encryption algorithms are used randomly, then the security against key guessing is significantly improved, but the complexity of the encryption process and resource requirements increase
Solution Approach 1:
The patent performs preliminary action by pre-creating and storing the index table that maps multiple keys to multiple encryption algorithms before the actual encryption process. This index table is generated in advance and can be reused for multiple encryption operations, eliminating the need to randomly select and manage key-algorithm combinations during each encryption process. This significantly improves efficiency while maintaining security.
Solution Approach 2:
The patent uses the index table as a copy or reference structure that stores pre-computed key-algorithm mappings. Instead of performing complex random selection and key management operations during encryption, the system simply looks up the appropriate key and algorithm from the index table copy, dramatically reducing computational overhead while maintaining the security benefits of multiple keys and algorithms.
Data Source
AI summary
A computer-implemented method is provided for encrypting a message using a plurality of keys and a plurality of encryption algorithms. The method includes mapping, by the computing device, each of the plurality of keys to an encryption algorithm randomly selected from the plurality of encryption algorithms, and storing, by the computing device, in an index table the plurality of keys correlated to their respective encryption algorithms. The method also includes decomposing, by the computing device, the message into one or more message segments and encrypting, by the computing device, each of the one or more message segments using the index table. The method further includes transmitting, by the computing device, at least one of the index table or the one or more encrypted message segments to a receiving computing device over the electronic network.