Abstract: A process and an apparatus for molten slag gasification of solid fuels in a molten slag gasifier with increased output, an increased range of solid fuels that can be used and improved gas quality. The process is conducted such that, by means of a molten slag gasifier comprising a feed of the coarse-grained solid fuels and comprising a gas takeoff, both at the head of the molten slag gasifier, comprising a slag bath and comprising a slag bath takeoff at the bottom of the molten slag gasifier, comprising a feed for first gasifying means by means of gasifying means nozzles above the slag bath, comprising a filling of the fixed bed above the slag bath, in addition to the first gasifying means a second gasifying means are injected by way of at least one gasifying means nozzle that reaches into the upper region of the fixed bed.

Abstract: The invention relates to a device (1) for decrypting data, said device having a number of means (3-5) secured by at least one security device (2). The secured means (3-5) comprise receiving means (3) for receiving calculation data (B) encrypted using a homomorphic encryption function (f) and a decrypting means (4) for decrypting the encrypted calculation data (B) by carrying out the inverse (1) of the homomorphic encryption function (f) on the encrypted calculation data using a private key (k1) assigned to the homomorphic encryption function (f). In this manner, a secured computing environment with a high degree of security is implemented in an inexpensive manner from available standard components. The invention further relates to a method and to a computer program product for decrypting data.

Abstract: An IT system includes at least one first processing unit and one second processing unit The first and second processing units jointly execute an application program and are each associated with an installation routine designed to control updating of a first or second program part of the application program. A first actual state is associated with the first processing unit and a second actual state is associated with the second processing unit. After system reboot, or as soon as the first and second program part have been successfully stored, or an error is detected when storing the first and/or second program part, predefined processing steps are respectively carried out in a predefined order by the first processing unit aid the second processing unit depending on the actual state of the first processing unit and the actual state of the second processing unit.

Abstract: A method for verifying an electronic signature is described including determining a residue class given by the signature; determining an integer having the residue class; determining a field element of a finite field such that the field element corresponds to the integer according to a predetermined mapping of the finite field to the set of integers; determining whether the field element fulfills a predetermined criterion and deciding whether the signature is valid based on whether the field element fulfills the predetermined criterion.

Abstract: Protection program commands are inserted into at least one program command sequence of program commands in a program, to produce and check a monitoring flow marking sequence.

Abstract: A method for verifying an electronic signature is described including determining a residue class given by the signature; determining an integer having the residue class; determining a field element of a finite field such that the field element corresponds to the integer according to a predetermined mapping of the finite field to the set of integers; determining whether the field element fulfills a predetermined criterion and deciding whether the signature is valid based on whether the field element fulfills the predetermined criterion.

Abstract: A system for securely transmitting data includes a control device and at least one security module. The control device is configured for producing a cryptographic key using a physically unclonable function (PUF). The at least one security module is configured for communicating with the control device at least one of confidentially and authentically using the cryptographic key. The control device has no storage for storing the cryptographic key. The control device includes at least one hardware device that is configured for providing a specific feature combination. The control device also includes a calculation unit that is configured for producing the cryptographic key using the specific feature combination and the physically unclonable function (PUF).

Abstract: The method for implementing a characteristic-2-multiplication of at least two input bit strings each having a number N of bits by means of a processor unit suitable for carrying out an integer multiplication, having the following steps: a) generating at least one sequence of a number K of zero bits, using K?{1, . . . , N}, by means of a first transformation of the respective input bit string to at least one predetermined position in the respective input bit string for generating at least one first intermediate bit string; b) linking the at least two first intermediate bit strings by means of the integer multiplication of the processor unit for generating at least one second intermediate bit string; and c) transforming the at least one second intermediate bit string by means of a second transformation for generating a result bit string.

Abstract: Embodiments relate to systems and methods for authenticating devices and securing data. In embodiments, a session key for securing data between two devices can be derived as a byproduct of a challenge-response protocol for authenticating one or both of the devices.

Abstract: Embodiments relate to systems and methods for authenticating devices and securing data. In embodiments, a session key for securing data between two devices can be derived as a byproduct of a challenge-response protocol for authenticating one or both of the devices.

Abstract: The embodiments relate to a method for the encrypted data exchange between subscribers of a communication system using cryptography based on elliptical curves, wherein upon a query by a first subscriber a scalar multiplication is calculated by the second subscriber, wherein merely part of the result of the scalar multiplication is returned to the first subscriber as a response. The invention relates to a communication system.

Abstract: A random source for generating a random number r with a bit length k, r=r0, . . . , rk-1, a memory for storing a threshold value state variable s, which is represented by a number with a bit length n?k, s=s0, . . . , sn-1, and a comparator to compare two numbers with a bit length k, i.e. from r with a subset of the bits from s are provided. Two calculation rules R1 and R2, which are able to change the content of the memory for the threshold value state variable s (i.e. functions from s to s), are defined for a method of generating random wait states.

Abstract: Embodiments relate to systems and methods for authenticating devices and securing data. In embodiments, a session key for securing data between two devices can be derived as a byproduct of a challenge-response protocol for authenticating one or both of the devices.

Abstract: A method determines an elliptical curve, suitable for a cryptographic method. An elliptical curve to be tested is prepared. The order of a twisted elliptical curve associated with the elliptical curve to be tested is determined. It is automatically checked whether the order of the twisted elliptical curve is a strong prime number. If the order of the twisted elliptical curve is a strong prime number, the elliptical curve to be tested is selected as an elliptical curve suitable for cryptographical methods.

Abstract: Cryptographic products for mass applications, such as RFIDs or special ICs for the protection from plagiarism, always require that the price per unit costs are reduced as low as possible. This is achieved, for example, in that in such methods the required storage space is further reduced for system parameters to be permanently stored. Accordingly, in a method for coding and decoding the cryptographic system parameters of an elliptical curve, when storing the system parameters, storage cells are each completely occupied, and therefore no storage space is wasted.

Abstract: The invention relates to a gasification reactor (1) and associated method for the entrained-flow gasification of solid fuels under pressure. The reactor essentially consists of a pressure vessel (4) that can be cooled and an inner jacket (7) that is equipped with a heat shield. At least one crude gas outflow (8) is located at the upper end of the cylindrical pressure vessel and at least one bottoms withdrawal outlet (30) is located at the lower end, the pressure vessel having at least enough space for a moving bed (13), an entrained flow (11) that circulates internally above the surface of the moving bed and a buffer zone (3) situated above said entrained bed.

Abstract: In a data transmission method for a tachograph system, digital messages are transmitted between a speed transmitter (MS) and a recording unit (RU). The digital messages contain a pair of keys including a public key (KMP, KRP) and a private key (KMS, KRS), as well as a certificate (ZM, ZR) derived from the respective pair of keys. The public keys (KMP, KRP) and the certificates (ZM, ZR) are mutually verified between the recording unit (RU) and the speed transmitter (MS). If the verification is positive, the speed transmitter (MS) detects sensor data, and a digital message is generated therefrom. In addition, the speed transmitter (MS) generates authentication data for the message in accordance with the pair of keys (KMP, KMS) thereof. The message and the authentication data are transmitted to the recording unit and are processed there in accordance with a validity of the authentication data verified by the recording unit (RU).

Abstract: An authentication method authenticates between subscribers of a communications system using an asymmetric elliptic curve encryption algorithm. The method involves providing a first and at least one second subscriber having a first or second secret key known only to the respective subscriber and a public key; authenticating an inquiry transmitted by the first subscriber with respect to the validity of the first certificate contained therein and associated with the first subscriber; calculating the response of the second subscriber associated with the inquiry; randomized encryption of the calculated response and a second certificate associated with the second subscriber using the public key; decryption and authentication of the response transmitted by the second subscriber with respect to the validity of the second certificate contained therein.

Abstract: An apparatus for generating a random bit sequence has a ring oscillator which includes inverting digital devices and on which an oscillator signal can be tapped. An intermediate storage element monitors and stores fluctuating levels of the oscillator signal. At least two controllable switch devices for simultaneously exciting at least two harmonic wave edges of the ring oscillator are provided in a signal path of the ring oscillator. The phasing of the two harmonic wave edges and a potential convergence thereof are subject to statistical fluctuations, which are used as a basis for the random bit generation. A corresponding random number generator can be used in particular as an FPGA for security applications, such as cryptographic methods. The apparatus has substantially digital components, which are easy to produce in a standardized manner. A dedicated regulating circuit is not necessary. The apparatus is also robust toward exterior influences.

Abstract: The aim of the embodiments is to provide a method for the secure processing of data, in which security is increased in relation to side channel attacks. To achieve this, operation codes for commanding co-processors are determined, for example for the bit-dependent transposition of register contents. The solution exploits the fact that as a result of the technical configuration for the co-processor, a shift of register contents, for example from register A to register B cannot be differentiated from the exterior from a shift from register A to register C.