A white-box cryptography system for performing a secure sequence of n transformations T i, wherein i = 1,..., n, of a data value w 0, using encrypted representations of the data value, the system comprising first transformation means for applying a transformation to an input data value w 0 to obtain an obfuscated representation ( X 0, Y 0) of w 0, wherein the obfuscated representation ( X 0, Y 0) contains a redundancy that depends on an input variable r; second transformation means for, for each of i = 1,..., n - 1, applying a transformation u i to compute ( X i, Y i) from ( X i -1, Y i -1), such that ( X i, Y i) = u i ( X i -1, Y i -1); third transformation means for applying a transformation G that depends on X n -1, Y n -1, and r, by computing w n = G ( X n-1, Y n -1, r), to obtain an outcome of the sequence of transformations, wherein w n = T n ° ··· ° T 1 ( w 0); wherein ( X i, Y i) = Ψ i ( w i, σ i), for i = 0,1,..., n, wherein Ψ i is a predefined obfuscation function that defines a one-to-one relation between ( X i, Y i) and ( w i, ( σ i), and wherein Ψ i satisfies a condition that there is a one-to-one mapping that maps any value of ( X i, σ i) to a value of ( w i, Y i) in such a way that ( X i, Y i) = Ψ i ( w i, σ i); σ 0 depends on r; and wherein w i = T i ( w i -1) and σ i = g i ( σ i -1) for i = 1,..., n, for predetermined functions T i and g i, wherein the first transformation means, the second transformation means, and the third transformation means are configured to obfuscate the values of w 1,..., w n -1 and σ 0,... σ n, wherein the third transformation means comprises fourth transformation means for applying a transformation u n such that X n = u n ( X n -1, Y n -1); and fifth transformation means for applying a transformation F that depends on X n and r, by computing w n = F ( X n, r), to obtain the value of w n. first transformation means for applying a transformation to an input data value w 0 to obtain an obfuscated representation ( X 0, Y 0) of w 0, wherein the obfuscated representation ( X 0, Y 0) contains a redundancy that depends on an input variable r; second transformation means for, for each of i = 1,..., n - 1, applying a transformation u i to compute ( X i, Y i) from ( X i -1, Y i -1), such that ( X i, Y i) = u i ( X i -1, Y i -1); third transformation means for applying a transformation G that depends on X n -1, Y n -1, and r, by computing w n = G ( X n-1, Y n -1, r), to obtain an outcome of the sequence of transformations, wherein w n = T n ° ··· ° T 1 ( w 0); wherein ( X i, Y i) = Ψ i ( w i, σ i), for i = 0,1,..., n, wherein Ψ i is a predefined obfuscation function that defines a one-to-one relation between ( X i, Y i) and ( w i, ( σ i), and wherein Ψ i satisfies a condition that there is a one-to-one mapping that maps any value of ( X i, σ i) to a value of ( w i, Y i) in such a way that ( X i, Y i) = Ψ i ( w i, σ i); σ 0 depends on r; and wherein w i = T i ( w i -1) and σ i = g i ( σ i -1) for i = 1,..., n, for predetermined functions T i and g i, wherein the first transformation means, the second transformation means, and the third transformation means are configured to obfuscate the values of w 1,..., w n -1 and σ 0,... σ n, wherein the third transformation means comprises fourth transformation means for applying a transformation u n such that X n = u n ( X n -1, Y n -1); and fifth transformation means for applying a transformation F that depends on X n and r, by computing w n = F ( X n, r), to obtain the value of w n.