Encryption Circuit Binary Word Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data encryption methods require more powerful and secure techniques to protect data values, especially as attackers can know the algorithm but lack the encryption key, necessitating stronger electronic circuits.
Innovation Solution
An encryption method involving binary word operations, including bitwise sum and product, complement, and bit shifting, where each second binary word is the sum of the first binary word and the product of its complementary shifted versions, implemented by an electronic circuit to generate a secure second data value.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption methods are used, then data values can be protected with simpler algorithms, but the security strength is insufficient against attackers who know the algorithm
Solution Approach 1:
The data value is segmented into multiple binary words (n words of m bits each), and the encryption process operates on these segmented components individually through bitwise operations, allowing complex security transformations while maintaining manageable circuit implementation for each segment
Solution Approach 2:
The patent introduces a new dimension of complexity by using modular indexing ((i+1)modulo n and (i+2)modulo n) to access different segments of the data value, creating multi-dimensional dependencies between binary words that increase security without requiring proportionally more hardware resources
2Reliability
If more complex encryption algorithms are implemented, then security against attackers is improved, but the electronic circuits become more powerful and complex
Solution Approach 1:
The patent achieves enhanced security by changing operational parameters (using complementary operations, multiple shift amounts p and q, and modular indexing) rather than increasing circuit complexity, allowing strong encryption with efficient bitwise operations that can be implemented in compact electronic circuits
Solution Approach 2:
The patent replaces complex mechanical or logical circuit structures with algebraic and bitwise operations (complement, shift, multiply, add modulo 2^m) that can be implemented more efficiently in modern electronic circuits, achieving high security with streamlined hardware
3Productivity
If simple bitwise operations are used, then the encryption process is faster and more efficient, but the security strength is reduced
Solution Approach 1:
The patent applies preliminary transformations (complement operations and bit shifts) to the binary words before the final multiplication and addition steps, which are all efficient bitwise operations that can be executed in parallel, maintaining high encryption speed while building up security through multiple transformation stages
Solution Approach 2:
The patent merges multiple security-enhancing operations (complement, shift by p positions, shift by q positions, multiplication, and addition modulo 2^m) into a single integrated encryption step for each binary word, achieving strong security without requiring multiple sequential processing stages, thus maintaining high productivity
Data Source
AI summary
A method encrypts, using an encryption circuit, a first data value having a number n of first binary words, each word having a number m of bits. The encrypting includes generating a second data value having a same number n of second binary words of m bits each and outputting a result of the encryption. The number n is an integer greater than or equal to 3, m and n do not have a common integer division, and n or m is even. A second binary word of the second data value having a rank i is equal to a sum of: a first binary word having a same rank i; and a product of: a complement of a first binary word having rank ((i+1)modulo n), shifted by a first number of bit positions; and a first binary word having rank ((i+2)modulo n), shifted by a second number of bit positions.