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: 9490970Abstract: 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: GrantFiled: December 8, 2015Date of Patent: November 8, 2016Assignee: GIESECKE & DEVRIENT GMBHInventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
-
Publication number: 20160094341Abstract: 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: ApplicationFiled: December 8, 2015Publication date: March 31, 2016Inventors: Walter HINZ, Klaus FINKENZELLER, Martin SEYSEN
-
Patent number: 9277406Abstract: 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: GrantFiled: February 13, 2013Date of Patent: March 1, 2016Assignee: GIESECKE & DEVRIENT GMBHInventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
-
Publication number: 20150071441Abstract: 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: ApplicationFiled: February 13, 2013Publication date: March 12, 2015Applicant: GIESECKE & DEVRIENT GMBHInventors: Walter Hinz, Klaus Finkenzeller, Martin Seysen
-
Patent number: 7849993Abstract: 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: GrantFiled: December 19, 2002Date of Patent: December 14, 2010Assignee: Giesecke & Devrient GmbHInventors: 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: 7227947Abstract: 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: GrantFiled: May 15, 2001Date of Patent: June 5, 2007Assignee: Giesecke & Devrient GmbHInventor: Martin Seysen
-
Publication number: 20050150740Abstract: 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: ApplicationFiled: December 19, 2002Publication date: July 14, 2005Inventors: 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: 20040028221Abstract: 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: ApplicationFiled: June 3, 2003Publication date: February 12, 2004Inventor: Martin Seysen
-
Patent number: 6405923Abstract: 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: GrantFiled: February 26, 2001Date of Patent: June 18, 2002Assignee: Giesecke & Devrient GmbHInventor: Martin Seysen
-
Patent number: 5887064Abstract: 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: GrantFiled: September 8, 1988Date of Patent: March 23, 1999Assignee: Siemens AktiengesellschaftInventor: Martin Seysen