Memory Address Encryption via Bijective Multiplication Modulo
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory and address encryption methods in smartcards face severe timing constraints and require improved concepts to enhance security and performance without significant hardware costs or performance degradation.
Innovation Solution
An apparatus and method that encrypts memory addresses using a bijective map achieved through multiplication and modulo operations with cryptographic keys and divisors, allowing for efficient address scrambling with minimal gate delays and reduced power consumption, while maintaining cryptographic strength.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If complex encryption algorithms are used to enhance security, then cryptographic strength is improved, but timing constraints and power consumption worsen
Solution Approach 1:
The patent transforms the address encryption problem by changing the mathematical parameters from complex cryptographic operations to simple multiplication and modulo operations. This parameter transformation maintains cryptographic strength through the bijective mapping property while dramatically reducing computational complexity and timing requirements.
Solution Approach 2:
The patent replaces complex cryptographic mechanical operations with simpler arithmetic operations (multiplication and modulo). This substitution achieves the same encryption effect with significantly reduced computational overhead, meeting the timing constraints of smartcard controllers.
2Reliability
If complex encryption algorithms are used to enhance security, then cryptographic strength is improved, but power consumption increases
Solution Approach 1:
The patent changes the operational parameters from energy-intensive cryptographic functions to low-power arithmetic operations. The multiplication and modulo operations require significantly less power while maintaining the bijective mapping property that ensures cryptographic strength.
Solution Approach 2:
The patent substitutes power-consuming cryptographic mechanisms with energy-efficient arithmetic operations. This substitution reduces power consumption while preserving the essential security property of bijective mapping through careful selection of multiplication factors and modulo divisors.
3Reliability
If traditional address encryption methods are used, then security is improved, but hardware costs and device complexity increase
Solution Approach 1:
The patent transforms the hardware implementation by changing the operational parameters to simple arithmetic operations that can be executed with minimal hardware resources. This parameter change reduces device complexity and hardware costs while maintaining security through the mathematical properties of bijective mapping.
4Reliability
If address encryption is implemented to protect memory access, then security is improved, but performance degradation occurs
Solution Approach 1:
The patent changes the computational parameters from complex cryptographic operations to simple arithmetic operations, thereby reducing the performance overhead. The multiplication and modulo operations can be executed rapidly with minimal impact on memory access performance while maintaining security.
Data Source
AI summary
An apparatus for encrypting an input memory address to obtain an encrypted memory address comprises an input interface for receiving the input memory address being an address of a memory. Moreover, the apparatus comprises an encryption module for encrypting the input memory address depending on a cryptographic key to obtain the encrypted memory address. The encryption module is configured to encrypt the input memory address by applying a map mapping the input memory address to the encrypted memory address, wherein the encryption module is configured to apply the map by conducting a multiplication and a modulo operation using the cryptographic key and a divisor of the modulo operation, such that the map is bijective.


