Patents by Inventor Martin Seysen

Martin Seysen 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: 9490970
    Abstract: Methods and a system involve secure communication between an RFID tag and a reader via the over-the-air interface, and to corresponding RFID tags and corresponding readers. A modification of the Rabin method is employed wherein within the framework of the encryption of a plaintext M into which an identification element of the RFID tag or of an object furnished therewith is incorporated, there is computed by the RFID tag, the Montgomery residue (Montgomery reduction) of the square of the plaintext M modulo n with respect to a Montgomery base R, i.e. C*=M2R?1 mod n, and the resultant ciphertext C* is employed for authenticating the RFID tag. The modulus n=p·q is the public key of the reader, the prime numbers p, q are the private key of the reader, and the Montgomery base R is an integer that is larger than the modulus n.
    Type: Grant
    Filed: December 8, 2015
    Date of Patent: November 8, 2016
    Assignee: GIESECKE & DEVRIENT GMBH
    Inventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
  • Publication number: 20160094341
    Abstract: Methods and a system involve secure communication between an RFID tag and a reader via the over-the-air interface, and to corresponding RFID tags and corresponding readers. A modification of the Rabin method is employed wherein within the framework of the encryption of a plaintext M into which an identification element of the RFID tag or of an object furnished therewith is incorporated, there is computed by the RFID tag, the Montgomery residue (Montgomery reduction) of the square of the plaintext M modulo n with respect to a Montgomery base R, i.e. C*=M2R?1 mod n, and the resultant ciphertext C* is employed for authenticating the RFID tag. The modulus n=p·q is the public key of the reader, the prime numbers p, q are the private key of the reader, and the Montgomery base R is an integer that is larger than the modulus n.
    Type: Application
    Filed: December 8, 2015
    Publication date: March 31, 2016
    Inventors: Walter HINZ, Klaus FINKENZELLER, Martin SEYSEN
  • Patent number: 9277406
    Abstract: Methods and a system involve secure communication between an RFID tag and a reader via the over-the-air interface, and to corresponding RFID tags and corresponding readers. A modification of the Rabin method is employed wherein within the framework of the encryption of a plaintext M into which an identification element of the RFID tag or of an object furnished therewith is incorporated, there is computed by the RFID tag, the Montgomery residue (Montgomery reduction) of the square of the plaintext M modulo n with respect to a Montgomery base R, i.e. C*=M2R?1 mod n, and the resultant ciphertext C* is employed for authenticating the RFID tag. The modulus n=p·q is the public key of the reader, the prime numbers p, q are the private key of the reader, and the Montgomery base R is an integer that is larger than the modulus n.
    Type: Grant
    Filed: February 13, 2013
    Date of Patent: March 1, 2016
    Assignee: GIESECKE & DEVRIENT GMBH
    Inventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
  • Publication number: 20150071441
    Abstract: Methods and a system involve secure communication between an RFID tag and a reader via the over-the-air interface, and to corresponding RFID tags and corresponding readers. A modification of the Rabin method is employed wherein within the framework of the encryption of a plaintext M into which an identification element of the RFID tag or of an object furnished therewith is incorporated, there is computed by the RFID tag, the Montgomery residue (Montgomery reduction) of the square of the plaintext M modulo n with respect to a Montgomery base R, i.e. C*=M2R?1 mod n, and the resultant ciphertext C* is employed for authenticating the RFID tag. The modulus n=p·q is the public key of the reader, the prime numbers p, q are the private key of the reader, and the Montgomery base R is an integer that is larger than the modulus n.
    Type: Application
    Filed: February 13, 2013
    Publication date: March 12, 2015
    Applicant: GIESECKE & DEVRIENT GMBH
    Inventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
  • Patent number: 7849993
    Abstract: The invention relates to sheet material having an electrical circuit and to apparatuses and methods for processing said sheet material. The present invention describes sheet material having an electrical circuit as well as apparatuses and methods for processing same, which reduce the effort required for processing the sheet material and/or facilitate processing and/or improve it and/or make it more reliable. For this purpose, the sheet material has at least one electrical circuit, with energy and/or data being transmitted from the apparatus to the electrical circuit and/or from the electrical circuit to the apparatus and at least part of the transmitted data being used for processing.
    Type: Grant
    Filed: December 19, 2002
    Date of Patent: December 14, 2010
    Assignee: Giesecke & Devrient GmbH
    Inventors: Klaus Finkenzeller, Thomas Giering, Manfred Heim, Thomas Hildebrandt, Ralf Hobmeier, Lars Hoffmann, Norbert Holl, Wittich Kaule, Friedrich Kretschmar, Markus Krombholz, Ralf Liebler, Thorsten Pillo, Harald Reiner, Walter Schneider, Eckart Schroeder-Bergen, Martin Seysen, Dieter Stein, Alexander Steinkogler, Christian Voellmer, Bernd Wunderer, Fabiola Bellersheim, Marius Dichtl, Juergen Schuetzmann
  • Patent number: 7227947
    Abstract: The invention relates to a cryptographic method with at least one computing step containing a modular exponentiation E according to E=xd(mod p·q), with a first prime factor p, a second prime factor q, an exponent d and a number x, whereby the modular exponentiation E is calculated according to the Chinese Remainder Theorem.
    Type: Grant
    Filed: May 15, 2001
    Date of Patent: June 5, 2007
    Assignee: Giesecke & Devrient GmbH
    Inventor: Martin Seysen
  • Publication number: 20050150740
    Abstract: The invention relates to sheet material having an electrical circuit and to apparatuses and methods for processing said sheet material. The present invention describes sheet material having an electrical circuit as well as apparatuses and methods for processing same, which reduce the effort required for processing the sheet material and/or facilitate processing and/or improve it and/or make it more reliable. For this purpose, the sheet material has at least one electrical circuit, with energy and/or data being transmitted from the apparatus to the electrical circuit and/or from the electrical circuit to the apparatus and at least part of the transmitted data being used for processing.
    Type: Application
    Filed: December 19, 2002
    Publication date: July 14, 2005
    Inventors: Klaus Finkenzeller, Thomas Giering, Manfred Heim, Thomas Hildebrandt, Ralf Hobmeier, Lars Hoffmann, Norbert Holl, Wittich Kaule, Friedrich Kretschmar, Markus Krombholz, Ralf Liebler, Thorsten Pillo, Harald Reiner, Walter Schneider, Eckart Schroeder-Bergen, Martin Seysen, Dieter Stein, Alexander Steinkogler, Christian Voellmer, Bernd Wunderer, Fabiola Bellersheim, Marius Dichtl, Juergen Schuetzmann
  • Publication number: 20040028221
    Abstract: The invention relates to a cryptographic method with at least one computing step containing a modular exponentiation E according to E=xd (mod p·q), with a first prime factor p, a second prime factor q, an exponent d and a number x, whereby the modular exponentiation E is calculated according to the Chinese Remainder Theorem.
    Type: Application
    Filed: June 3, 2003
    Publication date: February 12, 2004
    Inventor: Martin Seysen
  • Patent number: 6405923
    Abstract: A method for secure distribution of data or programs, the transmitted data being provided with an electronic signature. The unit receiving the data or programs checks the electronic signature by executing a modular multiplication, thereby necessitating a multiplication and a division thereof. According to the invention, the unit receiving the data or program checks the signature by performing a modular multiplication according to the Montgomery method wherein an additional multiplication by a factor on the basis of base 2 and even exponents is performed.
    Type: Grant
    Filed: February 26, 2001
    Date of Patent: June 18, 2002
    Assignee: Giesecke & Devrient GmbH
    Inventor: Martin Seysen
  • Patent number: 5887064
    Abstract: Cryptographic equipment is used with a number of user identification cards which are distributed to various authorized users, each user identification card being a non-volatile memory which can be overwritten in which a user-associated external crypto-ignition key is stored. Insertion of the user identification card in the cryptographic equipment releases the cryptovariable code by cooperation with an internal crypto-ignition key stored internal in a sub-memory of the cryptographic equipment for every authorized user. The cryptovariable required for setting and controlling the cryptosequence generator is stored in encoded form in another sub-memory of the variable memory, and is capable of being decoded with the cryptovariable code.
    Type: Grant
    Filed: September 8, 1988
    Date of Patent: March 23, 1999
    Assignee: Siemens Aktiengesellschaft
    Inventor: Martin Seysen