Deutschetelekom Ag

Matthias Baumgart

Klaus Huber

Ralf Schaffelhofer

Peter Windirsch

Hans Joachim Einsiedler

Tim Schneider

Tillmann Bach

Jens Zimmermann

Klaus University Of Illinois Huber

Michael Maruschke

Kay Hänsge

The present invention relates to an asymmetrical encryption method. The public key is made up of a large composite number n; the private key is made up of the factors of the composite number. The encryption is made up of a number of iterations of individual encryption steps that are successively reversed during the decryption. In this context, the reversal of an individual encryption step requires the solving of a quadratic equation modulo m [sic]. The private key is preferably made up of the large prime numbers p and q. The public key is the product n of these two prime numbers, as well as a comparatively small integer L which is greater than one. The message m is made up of two integral values mand m, thus=(, m),both values being in the set Z={0, 1, 2, . . . , n&#x2212;1}. The encryption is accomplished via the equation().

Encryption method based on factorization

In a method for compressing data, in which, in a data stream composed of characters, character strings are checked for correlation with other character strings that are present at a given distance in the data stream, and in which, in each case, the number of correlating characters and the position of the correlating characters within the respective other character string constitute the compressed data, at least one character is allowed to differ in the correlation check and data for correcting the at least one differing character is inserted into the compressed data.

Method for compressing data

Growing community of inventors

Gieβen, Germany

Matthias Baumgart