Polynomial Security Operations With Shared Shuffling Indices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing polynomial-based security algorithms, such as Dilithium, are vulnerable to side-channel attacks like differential power analysis (DPA) and profiling attacks, despite ensuring safety from simple power analysis (SPA), and suffer from overload due to random indices used in key and signature generation processes.
Innovation Solution
A method and apparatus that apply shuffling techniques to randomly process the operation order of operations in polynomial-based security algorithms, using common or different random indices based on operation length and secret information, and group operations to randomize execution order, thereby increasing attack complexity and reducing overload.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a shuffling technique with different random indices is used for each operation, then safety from simple power analysis is improved, but computational overload increases during key generation and signature generation processes
Solution Approach 1:
The patent merges multiple random indices into a single shared random index that is reused across different operations. This combining approach maintains the security benefit of randomization while significantly reducing the computational overhead of generating and managing multiple separate random indices for each operation.
Solution Approach 2:
The single random index serves multiple functions by being applied to different operations (e.g., polynomial multiplication, addition, scalar multiplication) in sequence. This universal random index provides the necessary shuffling for security across all operations without requiring separate random indices for each, thereby improving computational efficiency.
2Reliability
If different random indices are used for each operation, then security against side-channel attacks is improved, but the complexity of managing random indices increases
Solution Approach 1:
The patent consolidates multiple random index management tasks into a single random index that is reused across operations. This merging simplifies the management complexity while maintaining security, as the single random index is applied in a standardized manner across different cryptographic operations without requiring complex tracking or coordination of multiple indices.
3Reliability
If shuffling is applied to all operations, then safety from side-channel attacks is improved, but computational overhead increases
Solution Approach 1:
The patent applies shuffling selectively to only those operations that are necessary for security, rather than uniformly applying it to all operations. By identifying and shuffling only the critical operations (such as those involving secret keys and private components), the patent achieves adequate security protection while minimizing the computational time overhead associated with unnecessary shuffling operations.
Data Source
Figure 1
Figure 2(a)~2(c)
Figure 3
AI summary
The present disclosure according to at least one embodiment provides a method of processing operations of a polynomial-based security algorithm, the method being performed by a computing system. The method comprises identifying a plurality of operations using secret information in the polynomial-based security algorithm, generating a random index to be applied to the identified operations, and performing the operations using the random index.