Masked Uniform Random Vector Generation Against Fault Injection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods for generating uniformly random data are vulnerable to single and multiple fault injection attacks, necessitating improved security in their generation process.

Innovation Solution

A method involving the generation of multiple uniformly random vectors and applying an unmasking function to secure the production of a final uniformly random vector, resistant to fault injection attacks by ensuring independence and randomness of elements through masking and unmasking processes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If simple random number generation is used, then generation speed is high, but security against fault injection attacks is poor

Engineering Contradiction:
Improvesecurity against fault injection attacksVSAvoidgeneration process complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent divides the random vector generation into multiple independent components: generating a base random vector, generating error vectors, and combining them through masking. This segmentation allows each component to be generated and verified independently, improving security while maintaining manageable complexity through modular structure.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary actions by generating multiple random vectors and error vectors before the final combination step. These preliminary-generated components are then used to construct the final secure random vector through masking, ensuring that even if faults are injected during combination, the preliminary random components maintain security.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If multiple random vectors are generated through masking process, then security robustness is improved, but computational cost increases

Engineering Contradiction:
Improvesecurity robustnessVSAvoidcomputational cost
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent generates more random vectors than strictly necessary for the final output. By generating multiple error vectors and base vectors and using masking to combine them, the system creates redundancy that provides security against fault injection attacks. This excessive generation of random components ensures that even if some vectors are compromised, the final secure vector remains safe.

Inventive Principle:
Principle #16Partial or excessive action

3Reliability

If fault injection attacks are prevented through masking, then data integrity is protected, but process complexity increases

Engineering Contradiction:
Improvedata integrityVSAvoidprocess complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces masking as an intermediary mechanism between the random vector generation and the final output. The masking process acts as a mediator that combines multiple random vectors in a way that protects against fault injection attacks. This intermediary step adds complexity but enables secure data integrity protection.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS20250284771A1Generation of a uniformly random vector
Publication Date: 2025.09.11 STMICROELECTRONICS BELGIUM
  • US20250284771A1 patent drawing
  • US20250284771A1 patent drawing
  • US20250284771A1 patent drawing

AI summary

The present disclosure relates to a generation method, adapted to be executed by an electronic device, of an first uniformly random vector comprising n first elements, n being an integer equal or greater than two, comprising generating a second uniformly random vector comprising n second elements; generating m third elements, m being an integer equal or greater than one; generating a third uniformly random vectors 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 and the other third uniformly random vectors; and calculating the first elements by applying an unmasking function to the second elements and to the m third elements.