Abstract: An elliptic curve multiplication method comprises three stages. In the first stage, randomly selected point representations are stored in variables. In the second stage, a right-to-left loop is executed that modifies the variable values in dependency of a multiplier. In the last stage, the result is calculated from the modified variable values.

Abstract: Method for the encryption of data as well as a corresponding decryption method are set forth. In order to guarantee a secure transmission of data with relatively little effort, an encryption method is provided in which a key vector with a second length is generated from a secret key information vector with a short length and a public matrix with a size corresponding to the first length times a second length, which is greater than the first size, and in which an encryption vector is formed by means of a first encryption method from a data vector with a third length, which is less than or equal to the second length, and the key vector.

Abstract: A phase controller device according to the invention comprises a hardware core that is formed by a signal detector, a voltage-controlled oscillator, a phase comparator, and an integration unit, where the hardware core, by controlling the working clock pulse frequency of the microcontroller, brings an output clock pulse signal that is generated by a microcontroller into phase with the input clock pulse information that is received from the input data stream, and does so in such a manner that the jitter is low. The microcontroller executes a program with this working clock pulse, where with that program the microcontroller generates the output clock pulse signal with an output clock pulse frequency that is in a predetermined division ratio to the control clock pulse frequency that is generated by the voltage-controlled oscillator and is given to the microcontroller as a working clock pulse frequency.

Abstract: The invention relates to a circuit for comparing two n-digit binary data words x[1](t), . . . , x[n](t) and x?[1](t), . . . , x?[n](t), which in the error-free case are either identical or inverted bit-by-bit with respect to each other, with a series connection of a combinatorial circuit for implementing a first combinatorial function, a controllable register and a combinatorial circuit for implementing another combinatorial function.

Abstract: An elliptic curve multiplication method comprises three stages. In the first stage, randomly selected point representations are stored in variables. In the second stage, a right-to-left loop is executed that modifies the variable values in dependency of a multiplier. In the last stage, the result is calculated from the modified variable values.