Shuffling Operation Execution Order for Post-Quantum Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing post-quantum cryptography algorithms face a trade-off between security and operation speed, where enhancing security through hiding response techniques like Fisher-Yates Shuffling requires high implementation costs and slows down operation speed, compromising performance.
Innovation Solution
A method for shuffling operation execution order in electronic devices using a processor and memory, which determines a maximum number of bits based on the number of operations, generates binary random numbers, and calculates a shuffle position to perform shuffling operations efficiently, thereby enhancing security while maintaining speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Fisher-Yates Shuffling is used to enhance security by changing operation order, then security is improved, but operation speed decreases and implementation cost increases
Solution Approach 1:
The patent extracts the core shuffling function from the complex Fisher-Yates algorithm and implements a simplified version that only performs essential random position selection. By removing unnecessary computational steps while retaining the security-beneficial randomization, the patent achieves security enhancement with reduced computational overhead and maintained operation speed.
Solution Approach 2:
The patent changes the parameter of shuffling complexity by implementing a simplified shuffling mechanism that uses fewer computational resources. Instead of the full Fisher-Yates permutation algorithm, the patent employs a streamlined approach that selects random positions and swaps operations, reducing the computational parameters while preserving the security-beneficial operation order changes.
2Reliability
If Fisher-Yates Shuffling is used to enhance security by changing operation order, then security is improved, but implementation cost increases
Solution Approach 1:
The patent extracts and retains only the essential shuffling functionality needed for security enhancement, removing the complex computational overhead of the full Fisher-Yates algorithm. This selective extraction reduces implementation costs while maintaining the security benefits of operation order randomization.
Solution Approach 2:
The patent employs a lightweight, simplified shuffling mechanism that requires minimal computational resources and can be implemented with basic processor instructions. This approach uses computationally inexpensive operations that provide sufficient security enhancement without the high implementation costs associated with the complete Fisher-Yates algorithm.
Data Source
AI summary
Provided is an apparatus for performing a shuffling operation, the apparatus including a memory, and a processor connected to the memory, the processor configured to determine a maximum number of bits on the basis of a total number of operations to be shuffled, determine a shuffling set including a plurality of operations arranged in an execution order, generate, via a random number generator, binary random numbers, determine a shuffle position on the basis of a value obtained by shifting a binary number obtained by multiplying the binary random numbers by the number of operations included in the shuffling set right by the maximum number of bits, and perform a shuffling operation between a last operation and an operation in the shuffle position respectively included in the shuffling operation.