Patents by Inventor Hendrik Dirk Lodewijk Hollmann
Hendrik Dirk Lodewijk Hollmann has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11755288Abstract: An electronic calculating device (100) arranged to convert an input number (y) represented ((y1, y2, . . . , yk)) m a residue number system (RNS) to an output number represented in a radix representation ((e0, e1, . . . es?1)), the calculating device comprising an input interface (110) arranged to receive the input number (y) represented in the residue number system, and a processor circuit (120) configured to iteratively update an intermediate number (?) represented in the residue number system, wherein iterations produce the digits (e0, e1, . . . es?1) in the radix representation with respect to the bases (b0, b1, . . . , bs?1), at least one iteration comprises computing the intermediate number modulo a base (bt) of the radix representation to obtain a digit (et=(?)bt) of the radix representation, updating the intermediate number (??(??et+F)/bt) by subtracting the digit from the intermediate number, adding an obfuscating number (F; Ft), and dividing by the base (bt).Type: GrantFiled: October 30, 2017Date of Patent: September 12, 2023Assignee: Koninklijke Philips N.V.Inventors: Hendrik Dirk Lodewijk Hollmann, Ronald Rietman, Ludovicus Marinus Gerardus Maria Tolhuizen, Sebastiaan Jacobus Antonius De Hoogh
-
Patent number: 11070358Abstract: A computation device (200) 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 (220) receiving as input selection variables and an evaluation mechanism (210) 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.Type: GrantFiled: December 14, 2016Date of Patent: July 20, 2021Assignee: Koninklijke Philips N.V.Inventors: Sebastiaan Jacobus Antonius De Hoogh, Ronald Rietman, Ludovicus Marinus Gerardus Maria Tolhuizen, Hendrik Dirk Lodewijk Hollmann
-
Publication number: 20200266973Abstract: A computation device (200) 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 (220) receiving as input selection variables and an evaluation mechanism (210) 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.Type: ApplicationFiled: December 14, 2016Publication date: August 20, 2020Inventors: Sebastiaan Jacobus Antonius DE HOOGH, Ronald RIETMAN, Ludovicus Marinus Gerardus Maria TOLHUIZEN, Hendrik Dirk Lodewijk HOLLMANN
-
Publication number: 20200097257Abstract: An electronic calculating device (100; 200) arranged to calculate the product of integers, the device comprising a storage (110) configured to store integers (210, 220) in a multi-layer residue number system (RNS) representation, the multi-layer RNS representation having at least an upper layer RNS and a lower layer RNS, the upper layer RNS being a residue number system for a sequence of multiple upper moduli (Mi), the lower layer RNS being a residue number system for a sequence of multiple lower moduli (mi), an integer (x) being represented in the storage by a sequence of multiple upper residues (xi=(x)Mi; 211, 221) modulo the sequence of upper moduli (Mi), upper residues (xj; 210.2, 220.Type: ApplicationFiled: December 7, 2017Publication date: March 26, 2020Inventors: HENDRIK DIRK LODEWIJK HOLLMANN, SEBASTIAAN JACOBUS ANTONIUS DE HOOGH, PAULUS MATHIAS HUBERTUS MECHTILDIS ANTONIUS GORISSEN, LUDOVICUS MARINUS GERARDUS MARIA TOLHUIZEN, RONALD RIETMAN
-
Patent number: 10567158Abstract: A cryptographic device (200) 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 (wj) and represented in the data store as multiple encoded shares (xj), an encoded share being an encoding (xj=Encj (wj, sj)) of a share (wj) together with a state (sj), the multiple states (sj) corresponding to the same variable (w) having a relationship with the input message (M) so that there exists an injective mapping (?) from the input message (M) to the multiple states (?(M)=(s0, . . . , sn?1)).Type: GrantFiled: October 10, 2016Date of Patent: February 18, 2020Assignee: KONINKLIJKE PHILIPS N.V.Inventors: Ronald Rietman, Sebastiaan Jacobus Antonius De Hoogh, Paulus Mathias Hubertus Mechtildis Antonius Gorissen, Willem Charles Mallon, Ludovicus Marinus Gerardus Maria Tolhuizen, Hendrik Dirk Lodewijk Hollmann
-
Publication number: 20190272153Abstract: An electronic calculating device (100) arranged to convert an input number (y) represented ((y1, y2, . . . , yk)) m a residue number system (RNS) to an output number represented in a radix representation ((e0, e1, . . . es?1)), the calculating device comprising an input interface (110) arranged to receive the input number (y) represented in the residue number system, and a processor circuit (120) configured to iteratively update an intermediate number (?) represented in the residue number system, wherein iterations produce the digits (e0, e1, . . . es?1) in the radix representation with respect to the bases (b0, b1, . . . , bs?1), at least one iteration comprises computing the intermediate number modulo a base (bt) of the radix representation to obtain a digit (et=(?)bt) of the radix representation, updating the intermediate number (??(??et+F)/bt) by subtracting the digit from the intermediate number, adding an obfuscating number (F; Ft), and dividing by the base (bt).Type: ApplicationFiled: October 30, 2017Publication date: September 5, 2019Inventors: HENDRIK DIRK LODEWIJK HOLLMANN, RONALD RIETMAN, LUDOVICUS MARINUS GERARDUS MARIA TOLHUIZEN, SEBASTIAAN JACOBUS ANTONIUS DE HOOGH
-
Publication number: 20190074959Abstract: A cryptographic device (200) 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 (wj) and represented in the data store as multiple encoded shares (xj), an encoded share being an encoding (xj=Encj (wj, sj)) of a share (wj) together with a state (sj), the multiple states (sj) corresponding to the same variable (w) having a relationship with the input message (M) so that there exists an injective mapping (?) from the input message (M) to the multiple states (?(M)=(s0, . . . , sn?1)).Type: ApplicationFiled: October 10, 2016Publication date: March 7, 2019Inventors: RONALD RIETMAN, SEBASTIAAN JACOBUS ANTONIUS DE HOOGH, PAULUS MATHIAS HUBERTUS MECHTILDIS ANTONIUS GORISSEN, WILLEM CHARLES MALLON, LUDOVICUS MARINUS GERARDUS MARIA TOLHUIZEN, HENDRIK DIRK LODEWIJK HOLLMANN
-
Patent number: 9619742Abstract: 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.Type: GrantFiled: May 15, 2002Date of Patent: April 11, 2017Assignee: NXP B.V.Inventors: Peter Van Den Hamer, Hendrik Dirk Lodewijk Hollmann, Maarten Peter Bodlaender
-
Patent number: 8306216Abstract: 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.Type: GrantFiled: January 8, 2008Date of Patent: November 6, 2012Assignee: Irdeto B.V.Inventors: Wilhelmus Petrus Adrianus Johannes Michiels, Paulus Mathias Hubertus Merchtildis Antonius Gorissen, Hendrik Dirk Lodewijk Hollmann
-
Publication number: 20100299515Abstract: A system (600) for facilitating tracing copies (634) of an implementation of a computational method (602). A network generator (604) for generating a network of look-up tables representing steps of the computational method (602), the network being formed by using an output value of a first look-up table as an input value of a different second look-up table. A personalizer (606) for generating a plurality of different versions of the network of look-up tables by changing at least one value in the network of look-up tables, end results of the version corresponding to a relevant domain of input values being substantially the same for each version. An associator (608) for associating individual versions with individual stations (610) or users (632) of stations (610). The computational method (602) includes a 10 cryptographic scheme and a cryptographic key.Type: ApplicationFiled: January 8, 2008Publication date: November 25, 2010Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V.Inventors: Wilhelmus Petrus Adrianus Johannes Michiels, Paulus Mathias Hubertus Merchtildis Antonius Gorissen, Hendrik Dirk Lodewijk Hollmann
-
Patent number: 7558994Abstract: 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.Type: GrantFiled: April 27, 2004Date of Patent: July 7, 2009Assignee: NXP B.V.Inventors: Hendrikus Petrus Elisabeth Vranken, Hendrik Dirk Lodewijk Hollmann
-
Patent number: 7475317Abstract: 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.Type: GrantFiled: May 19, 2004Date of Patent: January 6, 2009Assignee: Koninklijke Philips Electronics N.V.Inventors: Erik Jan Marinissen, Hubertus Gerardus Hendrikus Vermeulen, Hendrik Dirk Lodewijk Hollmann
-
Publication number: 20080266149Abstract: The invention relates to a modulation code system and a corresponding modulation method. Said modulation system comprises an encoder 100 for transforming an original signal s into an encoded signal c satisfying predefined second constraints. Said modulation code system further comprises a decoder 200 for decoding the encoded signal c after restoration back into the original signal s. It is the object of the invention to improve such a known modulation code system and method in the way that the amount of required hardware is reduced. This object is solved according to the invention by designing the encoder 100 such that it comprises a series connection of a modulation code encoder 110 and of a transformer encoder 120 serving for filtering an intermediate signal t output by said modulation code encoder 110 and satisfying predefined first constraints in order to generate said encoder output signal c.Type: ApplicationFiled: April 1, 2005Publication date: October 30, 2008Applicant: KONINKLIJKE PHILIPS ELECTRONICS, N.V.Inventors: Hendrik Dirk Lodewijk Hollmann, Johannes Wilhelmus Maria Bergmans
-
Publication number: 20030033280Abstract: 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 (112) stored in a memory (310) of the data tag (300) is stored in a first header (110) preceding a first data element (112). In addition, characterizing information about a second data element (116) stored in the memory (310) of the data tag (300) is stored in a second header (114) preceding a second data element (318). The application of a multitude of descriptive headers, each characterizing a data element stored in the data tag memory (310), 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 (310).Type: ApplicationFiled: May 15, 2002Publication date: February 13, 2003Inventors: Peter Van Den Hamer, Hendrik Dirk Lodewijk Hollmann, Maarten Peter Bodlaender
-
Publication number: 20020026587Abstract: The invention relates to an apparatus for reading out information from an information carrier, the information including at least a first signal of at least partly encrypted content, to an apparatus for storing such information as well as to corresponding methods. The invention proposes a realisation of the Content Scrambling System (CSS) rule: CSS encrypted content on a recordable disc should be refused. In order to be able to use a wobbled disc for distinguishing ROM-discs from recordable discs, it is required that in the content on “new” discs there will be a “wobble-trigger”. This trigger has the following requirements: —it should be easily detectable from looking just at the content, —it should not be easily removable by a hacker, —it should not affect content preparation.Type: ApplicationFiled: May 10, 2001Publication date: February 28, 2002Inventors: Johan Cornelis Talstra, Maurice Jerome Justin Jean-Baptiste Maes, Hendrik Dirk Lodewijk Hollmann, Marten Erik Van Dijk