Encryption algorithm with key-dependent mask computation step (sbox call)
A technology related to computing and keys, which is applied to encryption devices with shift registers/memory, usage of multiple keys/algorithms, countermeasures for attacking encryption mechanisms, etc., can solve the problem of increasing the running time and memory requirements of implementation methods, and attacking And other issues
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0052] Example 1: The key values k, f and g-1 derived for the input distribution of the calculation step S are linear functions.
[0053] Sk: Calculation step where derived key value = k
[0054] x: input value
[0055] k: the key value included in the calculation step S
[0056] SBOX: SBOX table call in table SBOX
[0057] Sk(x)=SBOX(k XOR x)
[0058] Linearly obfuscate the input and output of the table SBOX using the linear maps g-1 and f.
[0059] Tab S SubK (x)=f SBOX(k XOR g-1(x))
[0060] The key change data: SWD=g(kneu XOR k) is XORed on input.
[0061] This outputs:
[0062] Tab S SubKneu (x)=f SBOX(kneu XOR g-1(x))=f SBOX(k XOR g-1(g(k XOR kneu))XOR g-1(x))=f SBOX(k XOR g-1( g(k XOR kneu)XOR x)=f SBOX(k XOR g-1(SWDXOR x))
example 2
[0063] Example 2: Assignment of the derived key values k, f and g-1 to the output of the computation step S are linear functions.
[0064] Sk: Calculation step, if key value = k
[0065] x: input value
[0066] k: the key value included in the calculation step S
[0067] SBOX: SBOX table call
[0068] Sk(x)=k XOR SBOX(x)
[0069] Linearly obfuscate the input and output using the linear maps g-1 and f.
[0070] Tab S SubK (x)=S'k(y)=f(k XOR SBOX(g-1x)), where y=g-1x
[0071] Key change data: SWD = f(kneu XOR k), XORed on output.
[0072] This outputs:
[0073] Tab S SubKneu (x)=S'kneu(y)=SWD XOR f(k XOR SBOX(g-1x))=
[0074] f(kneu XOR k)XOR f(k XOR SBOX(g-1x))=
[0075] f(kneu XOR k XOR k XOR SBOX(g-1x))=
[0076] f(kneu XOR SBOX(g-1x)).
[0077] In example 1 and example 2, initially from the simplest case, ie g-1 and f are linear maps. If g-1 and f are non-linear, additional auxiliary data are required for computing S'kneu(y). In other constructions of Sk(x), ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


