Shared Random Bit Masking for AES Side Channel Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current hardware implementations of cryptosystems, such as the Advanced Encryption Standard (AES) algorithm, require a large number of random bits for second or higher-order masking to counter side channel attacks, leading to high computational expense, power consumption, and long run times.
Innovation Solution
Strategically reusing the same random bit to mask different non-linear operations within the AES algorithm, reducing the total number of random bits needed without compromising security, by sharing random bits among multiple operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If second or higher-order masking is used to counter side channel attacks, then security against side channel attacks is improved, but computational expense and power consumption increase
Solution Approach 1:
The patent applies universality by making random bits serve multiple functions - each random bit is shared across multiple non-linear operations rather than being dedicated to a single operation. This multi-functional use of random bits maintains the security benefits of higher-order masking while significantly reducing the total number of random bits required, thereby lowering power consumption and computational expense
2Reliability
If second or higher-order masking is used to counter side channel attacks, then security against side channel attacks is improved, but computational expense increases
Solution Approach 1:
The patent reduces computational expense by implementing multi-functionality of random bits. Instead of allocating separate random bits to each non-linear operation, the same random bits are reused across multiple operations. This sharing approach maintains the security level of second or higher-order masking while reducing the total computational overhead associated with generating and managing numerous random bits
3Reliability
If second or higher-order masking is used to counter side channel attacks, then security against side channel attacks is improved, but run time increases
Solution Approach 1:
The patent improves productivity by reducing the total number of random bit operations through multi-functionality. By sharing random bits across multiple non-linear operations, the system performs fewer discrete masking operations, which directly reduces execution time while maintaining the security benefits of higher-order masking
4Reliability
If a large number of random bits are used for masking, then security against side channel attacks is improved, but the number of random bits required increases
Solution Approach 1:
The patent directly addresses the quantity issue by implementing multi-functionality of random bits. Each random bit is designed to serve multiple non-linear operations simultaneously, dramatically reducing the total number of random bits needed from the traditional large quantities required for second or higher-order masking while preserving security levels
Data Source
AI summary
A non-linear transformation including a plurality of non-linear logical operations is masked to a second or higher order. The masking includes receiving a set of random bits, and machine-masking two or more of the plurality of non-linear logical operations with a same random bit from the set of random bits.