Fault-Resistant Uniform Random Vector Generation With Unmasking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic methods for generating uniformly random data are vulnerable to single and multiple fault injection attacks, compromising the security and integrity of sensitive data.
Innovation Solution
A method for generating uniformly random vectors using an unmasking function applied to multiple uniformly random vectors and shifted elements, ensuring resistance to fault injection attacks by maintaining independence and randomness of elements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional uniformly random data generation methods are used, then the generation process is simple and fast, but the generated data is vulnerable to single and multiple fault injection attacks
Solution Approach 1:
The patent segments the random data generation process into multiple independent stages: generating a first random vector, generating multiple second random vectors, shuffling elements, and combining results. This segmentation allows each stage to be verified independently and prevents a single fault from compromising the entire generation process, thereby resolving the contradiction between reliability and complexity.
Solution Approach 2:
The patent performs preliminary actions by generating and verifying random vectors before they are used in cryptographic operations. The method pre-generates multiple candidate vectors, verifies their randomness properties, and only proceeds with validated vectors. This preliminary verification ensures fault resistance while maintaining a structured approach to managing complexity.
2Reliability
If multiple uniformly random vectors are generated and processed to ensure fault resistance, then security against fault injection attacks is improved, but the generation time and computational resources increase
Solution Approach 1:
The patent employs periodic action by generating multiple second random vectors in systematic batches and processing them through standardized shuffle and combine operations. This periodic structure allows for efficient resource utilization and predictable timing, reducing the overall generation time while maintaining security against fault injection attacks.
Solution Approach 2:
The patent changes parameters such as the number of vectors generated, the shuffle depth, and the combination method to optimize the balance between security and generation time. By adjusting these parameters based on specific security requirements and performance constraints, the system achieves fault resistance without excessive time loss.
3Manufacturing precision
If elements are shifted and replaced to maintain independence and randomness, then uniformity and randomness of the generated vector are improved, but the processing complexity increases
Solution Approach 1:
The patent uses copying by creating multiple copies of random vectors and their shuffled variants during the generation process. Instead of implementing complex transformations, the method generates copies of vectors with different shuffle depths and combines them. This copying approach simplifies processing while ensuring uniformity and randomness through the aggregation of multiple independent copies.
Data Source
Figure 1~2(B)
Figure 3~4
Figure 5~6
AI summary
The present disclosure relates to a generation method, adapted to be executed by an electronic device, of an first uniformly random vector (Y) comprising n first elements (y0, ..., yn-1), n being an integer equal or greater than two, comprising the following steps: - Generate a second uniformly random vector (A) comprising n second elements (a0, ..., an-1); - Generate m third elements (r), m being an integer equal or greater than one; - Generate m third uniformly random vectors (B) comprising 1 third elements and n-1 second elements, and having third elements (b0, ..., bn-1) different from the second elements at the same position in the second uniformly random vector (A) and the other third uniformly random vectors (B); - Calculate said first elements (y0, ..., yn-1) by applying an unmasking function to said second elements and to said m third elements.