Patents by Inventor Stefan Heiss

Stefan Heiss 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: 11495144
    Abstract: A cryptographical apparatus for converting input bit sequences, whose overflow-free arithmetic addition results in a secret, into output bit sequences whose logic XORing results in the secret. The apparatus comprises a data interface for providing a first input bit sequence and a second input bit sequence and a processing circuit configured to a) gate the first input bit sequence and the second input bit sequence to obtain a logic result indicating overflow bit positions at which both the first input bit sequence and the second input bit sequence have a value of one; and to b) change the first and/or second input bit sequence at at least one overflow bit position. The processing circuit is configured to repeatedly perform steps a) and b) by using the respectively changed input bit sequences, until the logic result indicates no further overflow bit position and the output bit sequences are obtained.
    Type: Grant
    Filed: May 29, 2019
    Date of Patent: November 8, 2022
    Assignee: Infineon Technologies AG
    Inventors: Markus Rau, Stefan Heiss
  • Patent number: 11388002
    Abstract: A method is provided for conducting an operation, the method including: determining a first result based on combining a first input with a first mask; determining a second result based on combining a second input with a second mask, the first mask and the second mask fulfilling a precondition; and conducting the operation based on the first result and the second result. A corresponding device is also provided.
    Type: Grant
    Filed: March 25, 2019
    Date of Patent: July 12, 2022
    Assignee: Infineon Technologies AG
    Inventors: Markus Rau, Stefan Heiss
  • Patent number: 10678707
    Abstract: According to an embodiment, a data processing device is described comprising a deformer configured to deform a first data block in accordance with a first seed, a seed generator configured to generate a sequence of second seeds, wherein the sequence of second seeds comprises the first seed, a cryptographic processor configured to receive the deformed first data block and, for each second seed, to deform the deformed first data block in accordance with the second seed, to generate a sequence of second data blocks and to cryptographically process each second data block of the sequence of second data blocks to generate a sequence of processed data blocks and an extractor configured to extract a result of the cryptographic processing of the first data block from the sequence of processed data blocks.
    Type: Grant
    Filed: October 25, 2017
    Date of Patent: June 9, 2020
    Assignee: INFINEON TECHNOLOGIES AG
    Inventors: Thomas Poeppelmann, Stefan Hackenberg, Stefan Heiss, Markus Rau, Stephan Wassmann
  • Publication number: 20190371210
    Abstract: A cryptographical apparatus for converting input bit sequences, whose overflow-free arithmetic addition results in a secret, into output bit sequences whose logic XORing results in the secret. The apparatus comprises a data interface for providing a first input bit sequence and a second input bit sequence and a processing circuit configured to a) gate the first input bit sequence and the second input bit sequence to obtain a logic result indicating overflow bit positions at which both the first input bit sequence and the second input bit sequence have a value of one; and to b) change the first and/or second input bit sequence at at least one overflow bit position. The processing circuit is configured to repeatedly perform steps a) and b) by using the respectively changed input bit sequences, until the logic result indicates no further overflow bit position and the output bit sequences are obtained.
    Type: Application
    Filed: May 29, 2019
    Publication date: December 5, 2019
    Inventors: Markus Rau, Stefan Heiss
  • Publication number: 20190296908
    Abstract: A method is provided for conducting an operation, the method including: determining a first result based on combining a first input with a first mask; determining a second result based on combining a second input with a second mask, the first mask and the second mask fulfilling a precondition; and conducting the operation based on the first result and the second result. A corresponding device is also provided.
    Type: Application
    Filed: March 25, 2019
    Publication date: September 26, 2019
    Inventors: Markus Rau, Stefan Heiss
  • Patent number: 10354065
    Abstract: According to one embodiment, a method for protecting data is provided comprising receiving a plurality of data symbols, determining a sequence of checksum symbols wherein the checksum symbols are determined to be equal to the checksum symbols of the last iteration of an iterative checksum symbol generation process, wherein the determining of the checksum symbols includes at least one of randomly generating the initial values, randomly determining an order of the data symbols in which the contributions of the data symbols to the checksum symbols are incorporated into the checksum symbols and masking each data symbol and using the masked data symbols as data symbols for determining the checksum symbols and which includes storing at least some of the checksum values as checksum for the data symbols.
    Type: Grant
    Filed: October 25, 2016
    Date of Patent: July 16, 2019
    Assignee: Infineon Technologies AG
    Inventors: Berndt Gammel, Stefan Heiss, Markus Rau
  • Patent number: 10055194
    Abstract: A method for performing an operation based on at least two operands is proposed, in which steps of the operation are performed in time-randomized fashion. In addition, an apparatus, a computer program product and a computer-readable storage medium are accordingly specified.
    Type: Grant
    Filed: February 5, 2015
    Date of Patent: August 21, 2018
    Assignee: Infineon Technologies AG
    Inventors: Stefan Heiss, Markus Rau
  • Publication number: 20180121369
    Abstract: According to an embodiment, a data processing device is described comprising a deformer configured to deform a first data block in accordance with a first seed, a seed generator configured to generate a sequence of second seeds, wherein the sequence of second seeds comprises the first seed, a cryptographic processor configured to receive the deformed first data block and, for each second seed, to deform the deformed first data block in accordance with the second seed, to generate a sequence of second data blocks and to cryptographically process each second data block of the sequence of second data blocks to generate a sequence of processed data blocks and an extractor configured to extract a result of the cryptographic processing of the first data block from the sequence of processed data blocks.
    Type: Application
    Filed: October 25, 2017
    Publication date: May 3, 2018
    Inventors: Thomas Poeppelmann, Stefan Hackenberg, Stefan Heiss, Markus Rau, Stephan Wassmann
  • Publication number: 20170116437
    Abstract: According to one embodiment, a method for protecting data is provided comprising receiving a plurality of data symbols, determining a sequence of checksum symbols wherein the checksum symbols are determined to be equal to the checksum symbols of the last iteration of an iterative checksum symbol generation process, wherein the determining of the checksum symbols includes at least one of randomly generating the initial values, randomly determining an order of the data symbols in which the contributions of the data symbols to the checksum symbols are incorporated into the checksum symbols and masking each data symbol and using the masked data symbols as data symbols for determining the checksum symbols and which includes storing at least some of the checksum values as checksum for the data symbols.
    Type: Application
    Filed: October 25, 2016
    Publication date: April 27, 2017
    Inventors: Berndt GAMMEL, Stefan HEISS, Markus RAU
  • Publication number: 20150220307
    Abstract: A method for performing an operation based on at least two operands is proposed, in which steps of the operation are performed in time-randomized fashion. In addition, an apparatus, a computer program product and a computer-readable storage medium are accordingly specified.
    Type: Application
    Filed: February 5, 2015
    Publication date: August 6, 2015
    Inventors: Stefan Heiss, Markus Rau