Koninklijke Philips Corporation N.V.

Nxp B.v.

Irdeto B.v.

Hendrik Dirk Lodewijk Hollmann

Ludovicus Marinus Gerardus Maria Tolhuizen

Ronald Rietman

Sebastiaan Jacobus Antonius De Hoogh

Maarten Peter Bodlaender

Hubertus Gerardus Hendrikus Vermeulen

Paulus Mathias Hubertus Mechtildis Antonius Gorissen

Erik Jan Marinissen

Willem Charles Mallon

Peter Van Den Hamer

Hendrikus Petrus Elisabeth Vranken

Wilhelmus Petrus Adrianus Johannes Michiels

Paulus Mathias Hubertus Merchtildis Antonius Gorissen

Willem Mallon

An electronic calculating device () arranged to convert an input number (y) represented ((y, y, . . . , y)) m a residue number system (RNS) to an output number represented in a radix representation ((e, e, . . . e)), the calculating device comprising an input interface () arranged to receive the input number (y) represented in the residue number system, and a processor circuit () configured to iteratively update an intermediate number (&#x177;) represented in the residue number system, wherein iterations produce the digits (e, e, . . . e) in the radix representation with respect to the bases (b, b, . . . , b), at least one iteration comprises computing the intermediate number modulo a base (b) of the radix representation to obtain a digit (e=(&#x177;)) of the radix representation, updating the intermediate number (&#x177;&#x2190;(&#x177;&#x2212;e+F)/b) by subtracting the digit from the intermediate number, adding an obfuscating number (F; F), and dividing by the base (b).

Secure transformation from a residue number system to a radix representation

A computation device () arranged to evaluate a data function (S) mapping a number (n) of input variables to a number of output variables (m). The computation device comprises selection mechanism () receiving as input selection variables and an evaluation mechanism () arranged to receive the one or more evaluation variables and to evaluate the evaluation functions for the received evaluation variables, an evaluation function receiving as input the evaluation variables.

Computation device and method

A cryptographic device () is provided to compute a key dependent cryptographic function for an input message. The cryptographic device has a data store arranged to store multiple variables (w) on which the cryptographic device acts to compute the cryptographic function, a variable (w) being distributed over multiple shares (w) and represented in the data store as multiple encoded shares (x), an encoded share being an encoding (x=Enc(w, s)) of a share (w) together with a state (s), the multiple states (s) corresponding to the same variable (w) having a relationship with the input message (M) so that there exists an injective mapping (&#x3a3;) from the input message (M) to the multiple states (&#x3a3;(M)=(s, . . . , s)).

Cryptographic device and an encoding device

A data tag containing self-descriptive data, a method for reading such a data tag and a system for interpreting such a data tag are disclosed. Characterizing information about a first data element stored in a memory of the data tag is stored in a first header preceding a first data element. In addition, characterizing information about a second data element stored in the memory of the data tag is stored in a second header preceding a second data element. The application of a multitude of descriptive headers, each characterizing a data element stored in the data tag memory, facilitates flexible data storage on such devices. Furthermore, it also facilitates data compression due to the fact that field lengths can be characterized as well, thus excluding the presence of redundant bits in the data stored in the memory.

Self-descriptive data tag

A method and system is provided facilitating tracing copies of an implementation of a computational method where different versions of a network of look-up tables representing steps of the computational method are generated, and stored in a memory, each version being unique so that output encodings and/or input decodings of the white-box implementations of the computational method are different in the different versions. The network is formed by using an output value of a first look-up table as an input value of a second look-up table. The different versions are generated by changing at least one value in the network, end results of the version corresponding to a relevant domain of input values being substantially the same for each version. A method and system for computation for a user with the corresponding version in the memory, and/or for identifying a copy of an implementation of the computational method is provided.

Method and system for tracking or identifying copy of implementation of computational method, and computation system

A method and apparatus for compressing test vector data for use in testing a logic product, wherein original test vector data is generated in the form of two or more sequences of bits including 'care' bits and 'don't care' bits. The test vector data is then compressed by comparing corresponding bits of two or more subsequent vectors and merging the two or more vectors into a single vector representative thereof if all of the corresponding bits of the two or more vectors are found to be compatible. Compatibility of two bits is achieved if they do not have specifically incompatible or opposite values.

Methods and apparatus for data compression

A method of generating digital test patterns for testing a number of wiring interconnects is described. A first set of test patterns is generated; the number of test patterns in the first set is related to said number of wiring interconnects, and defines a first set of code words. From the first set of code words, a second set of code words is selected. The number of code words in the second set is equal to said number of wiring interconnects, and the selection of the second set of code words is such that the sum of the transition counts for the code words in the second set is minimized.

Growing community of inventors

Eindhoven, Netherlands

Hendrik Dirk Lodewijk Hollmann