Decomposition of masked values
AssigneeNXP B.V.
InventorsBjörn Fay, Joost Roland Renes, Tobias Schneider, Olivier Bronchain
Life of this patent
Estimating the term…
Loading patent…
AssigneeNXP B.V.
InventorsBjörn Fay, Joost Roland Renes, Tobias Schneider, Olivier Bronchain
Estimating the term…
The disclosure relates to decomposition of masked values in a cryptographically secure digital signing system. Example embodiments include a method of decomposing mod 44 an N bit Boolean share input (b′B,k), where N>12, the method comprising: i) reducing (302-305) a number of bits in the Boolean share input (b′B,k) by adding a lower 11:0 bits of the input (b′B,k) to an upper portion of the input left shifted by 2 bits to provide a first intermediate result ( t 1 B , 13 ) having M bits; ii) reducing (306-309) a number of bits of the first intermediate result ( t 1 B , 13 ) by adding a lower 6:0 portion of the intermediate result to an upper portion left shifted by 2 bits and subtracted from a multiple of 44 to provide a second intermediate result ( t 3 B , 8 ) and iii) adjusting (310-316) the second intermediate result ( t 3 B , 8 ) by adding and/or subtracting 44 to provide an output ( w 1 B , k ′ ) having a value within an interval of 0:43, the output ( w 1 B , k ′ ) being a mod 44 representation of the input (b′B,k).
A hardware converter configured to decompose, using a mod 44 operation, an N bit Boolean share input, where N>12, the hardware converter further configured to:
A method of decomposing, using a mod 44 operation, an N bit Boolean share input, where N>12, the method comprising:
A non-transitory computer readable medium storing processor-readable instructions that, when executed, cause a processor to decompose, using mod 44 operation, an N bit Boolean share input, where N>12, the non-transitory computer readable medium storing comprising the processor-readable instructions that cause the processor to:
Dependencies are inferred from the claim text.