Method for Testing and Hardening Software Applications
AssigneeGiesecke & Devrient GmbH
InventorsHermann DREXLER, Sven BAUER
Life of this patent
Estimating the term…
Loading patent…
AssigneeGiesecke & Devrient GmbH
InventorsHermann DREXLER, Sven BAUER
Estimating the term…
Methods are provided for testing and hardening software applications for the carrying out digital transactions which comprise a white-box implementation of a cryptographic algorithm. The method comprises the following steps: (a) feeding one plaintext of a plurality of plaintexts to the white-box implementation; (b) reading out and storing the contents of the at least one register of the processor stepwise while processing the machine commands of the white-box implementation stepwise; (c) repeating the steps (a) and (b) with a further plaintext of the plurality of plaintexts N-times; and (d) statistically evaluating the contents of the registers and the plaintexts, the intermediate results and/or the ciphertexts generated from the plaintexts by searching for correlations between the contents of the registers and the plaintexts, the intermediate results and/or the ciphertexts generated from the plaintexts to establish the secret key.
1-15. (canceled)
A method for testing a white-box implementation of a cryptographic algorithm, said implementation being executable on a processor, generating a ciphertext from a plaintext by means of a secret key and being present in the processor in the form of machine commands, wherein the processor comprises at least one register and the method comprises the following steps:
The method for hardening a white-box implementation of a cryptographic algorithm, said implementation being executable on a processor and able to generate a ciphertext from a plaintext using a secret key, wherein the white-box implementation is configured such that when generating the ciphertext at least one lookup table comes into use to statically map input values of the lookup table to output values of the lookup table, wherein the method comprises the step of statistically permutating the lookup table in such a way that the individual bits of the permutated lookup table substantially do not correlate with the bits of the lookup table.
The method for hardening a white-box implementation of a cryptographic algorithm, said implementation being executable on a processor and able to generate a ciphertext from a plaintext using a secret key, wherein the white-box implementation is configured such that when generating the ciphertext at least one lookup table comes into use to statically map input values of the lookup table to output values of the lookup table, wherein the method comprises the step of randomizing the white-box implementation.
Dependencies are inferred from the claim text.