Dynamic Feistel Cryptographic Algorithm for Memory-Constrained White-Box Environments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional white-box cryptographic algorithms face challenges in implementing dynamic input and output size adjustments based on available memory, limiting their flexibility and applicability in various environments.
Innovation Solution
A method and apparatus for generating a cryptographic algorithm using a Feistel structure, which includes generating key tables, transformation functions, and a round function that dynamically determines bit string lengths based on available memory, allowing for flexible input and output sizes by using a seed value and applying these functions within a computing device.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional white-box cryptographic algorithms are used, then key protection is provided, but input size and output size cannot be dynamically adjusted based on available memory
Solution Approach 1:
The cryptographic algorithm dynamically adjusts its input and output bit string lengths based on available memory resources. The system determines optimal lengths L and M by evaluating memory capacity, allowing the algorithm to adapt its operational parameters rather than being fixed to predetermined sizes. This dynamic adjustment enables the algorithm to function efficiently across diverse deployment environments with varying memory constraints.
Solution Approach 2:
The algorithm changes its structural parameters (input length, output length, number of rounds) based on available memory. By modifying these parameters dynamically, the system achieves versatility across different application scenarios while maintaining security. The parameter changes allow the same algorithm to be optimized for both resource-constrained and resource-abundant environments without requiring multiple separate implementations.
2Adaptability or versatility
If fixed-size cryptographic algorithms are used, then implementation is simpler, but they cannot accommodate various memory usage criteria and application environments
Solution Approach 1:
The algorithm automatically determines its operational characteristics based on the runtime memory environment. This dynamic behavior enables seamless adaptation to different application environments without requiring manual configuration or separate algorithm selections. The system evaluates available memory and adjusts its parameters accordingly, providing universal compatibility across diverse deployment scenarios.
Solution Approach 2:
The cryptographic algorithm serves multiple functions across different environments by dynamically adjusting its parameters. A single algorithm implementation can operate in resource-constrained mobile devices, servers with abundant memory, or intermediate environments, making it universally applicable. The algorithm's ability to function across varied contexts eliminates the need for environment-specific implementations.
3Adaptability or versatility
If dynamic memory allocation is implemented, then flexibility is improved, but additional key protection processes become necessary
Solution Approach 1:
The algorithm merges the dynamic memory allocation mechanism with the key protection process into a unified operational framework. By integrating these functions, the system achieves memory flexibility without requiring separate, additional protection layers. The key protection is inherently incorporated into the dynamic operation, eliminating the need for redundant processes while maintaining security.
Data Source
AI summary
A method of generating a cryptographic algorithm according to one embodiment of the present disclosure includes generating one or more key tables on the basis of a seed value; generating a first transformation function that converts an input bit string, which is input to one of input branches of a Feistel structure, into a first random bit string having a length that extends beyond a length of the input bit string; generating a second transformation function that converts a second random bit string generated by referencing the one or more key tables into a third random bit string having a length that is the same as the length of the input bit string; and generating a block cryptographic algorithm of a Feistel structure which includes a round function to which the one or more key tables, the first transformation function, and the second transformation function are applied.