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: A method and system for confidentially providing a software component which is encrypted using a secret cryptographic key of a software component manufacturer, and the key is then encrypted using a first cryptographic system key, wherein the encrypted software component and the encrypted key are transported by the software component manufacturer to a destination system device. After decrypting the transported encrypted key using a second cryptographic system key, the transported encrypted software component is decrypted using the decrypted key, wherein the decrypted software component is provided for execution on the destination system device. The method can be used to protect source codes or object codes of a developed software component from access by a third party and still allows for processing using standard tools.

Abstract: A method and system for accelerated decryption of a cryptographically protected user data unit, wherein a transmitter initially generates a cryptographic key that is provided with a related key identification. The transmitter then performs asymmetrical encryption of the generated cryptographic key using a public cryptographic key and encryption of at least one user data unit using the generated cryptographic key. The encrypted user data unit, the asymmetrically encrypted cryptographic key and the related key identification of the cryptographic key are transported to a receiver that decrypts the received asymmetrically encrypted key using a private key, if verification of the received related key identification of the cryptographic key indicates the cryptographic key is not present in a decrypted state in the receiver. The receiver then decrypts the received cryptographically encrypted user data unit using the cryptographic key in the receiver or with the cryptographic key decrypted using the private key.

Abstract: A method and a system for naming-conflict-free integration of software components originating from software component manufacturers (OEM), comprising software development devices from different software component manufacturers (OEM) that manufacture and encrypt software components with the respective cryptographic key, wherein when a naming conflict occurs during the integration of encrypted software components, at least one of the encrypted software components in which the naming conflict occurred is expanded by a naming conflict resolution rule to thereby allows for the resolution of naming conflicts in encrypted software components that can originate from different software component manufacturers without the source code of the software components becoming visible to third parties.

Abstract: A method for securely encrypting or decrypting a message or for generating or verifying a digital signature in a message, in which the message is subjected, with the aid of a processor, to a mathematical operation using a key (k) which can be represented in the form of a binary number with a sequence of bits, and computational operations are sequentially carried out on auxiliary variables for each bit. The dependence of the computational result on the values of individual bits is taken into account by reading the memory addresses from the auxiliary variables and assigning them to address variables. The difference between the addresses is calculated and, depending on the respective current bit, is added to, or subtracted from, the computer addresses. The assignment of the auxiliary variables to the address variables can thus be interchanged. As a result, the order and selection of the computational operations is controlled on the basis of bits without the program sequence having to contain jump instructions.

Abstract: The embodiments provides a method for processing data. According to the invention, an elliptic curve with an order m which corresponds to a product of a first cofactor c and a prime number q is provided, wherein the order (q?1) of the multiplicative group of the prime number q corresponds to a product of a second cofactor I and at least two prime divisors s1, . . . , sk, wherein the at least two prime divisors s1, . . . , sk are each greater than a predetermined bound of 2n; and a chosen method is applied to provided data using the provided elliptic curve for providing cryptographically transformed data. The invention enables cryptographically transformed data to be provided while simultaneously minimizing the probability of a successful attack.

Abstract: The invention relates to a method for providing postal items with postal prepayment impressions, characterized in that data are generated in the customer system that are encrypted in such a manner that the value transfer center is able to decrypt them. To this end, the data are transmitted from the customer system to the value transfer center. The value transfer center then decrypts the data and re-encrypts them with a code not known to the customer system and transmits the encrypted data to the customer system.

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: An apparatus for calculating a result of a scalar multiplication of a reference number with a reference point on an elliptic curve includes a random number generator and processor. The random number generator generates a random bit. The processor calculates the result of the scalar multiplication based on a calculation algorithm using a first auxiliary variable storing a first interim result representing an integer multiple of the reference point or a coordinate of an integer multiple of the reference point and a second auxiliary variable storing a second interim result representing another integer multiple of the reference point or a coordinate of another integer multiple of the reference point. The processor swaps a value stored by the first auxiliary variable and a value stored by the second auxiliary variable during calculation of the result of the scalar multiplication, if a swap condition depending on the generated random bit is fulfilled.

Abstract: A drawer configured to be extended from and retracted into a furniture body. The drawer includes a bottom part; a front panel; two lateral frames; and a back wall connected via a corner joint to an end region formed with one of the lateral frames. Each corner joint including a first connecting part and a second connecting part pivotably connected to the first connecting part. The second connecting part includes detent means for connecting the second connecting part to either the first connecting part or the back wall. The first connecting part is connected to an adapter associated with the end region formed by the back wall with one of the lateral frames.

Abstract: The invention concerns a process for the production of carbonaceous adsorption agents doped with elementary sulfur, in which sulfur is mixed with the adsorption agent, the mixture is heated to a temperature of between 120° C. and 150° C. and the temperature is maintained over a period of about an hour. The process is distinguished in that heating of the mixture is effected under a controlled oxygen-bearing atmosphere. The invention further concerns a process for waste gas cleaning using carbonaceous absorption agents doped with elementary sulfur. Preferably brown coal coke is used as the adsorption agent.

Abstract: A method and device for franking mailpieces. An operating unit, which is separated from a franking unit, transmits a transaction request to an authorization unit. The authorization unit ascertains an authorization of a user of the operating unit on the basis of an authorization profile. The transmitted transaction request is authenticated by the authorization unit according to the ascertained authorization. The authorization unit converts the authenticated transaction request into a transaction job. The transaction job is transmitted to the franking unit. The authorization unit is authenticated in the area of the franking unit. The transaction job is processed in the franking unit and the result of the execution of the transaction job is sent out by the franking unit.

Abstract: An encryption part or a decryption part of an encryption/decryption apparatus or a part common to both parts is used both for encryption and decryption of a datum to be stored and the encrypted memory content and for the generation of the address-individual key and the address-dependent key, respectively.

Abstract: The invention concerns a carbonaceous sorbent in powder or grain form for the dry cleaning of waste gases from thermal processes. The sorbent includes carbon adsorbents from the group of activated carbon and/or brown coal cokes which are modified with sulfur and/or sulfur compounds. The sorbent is distinguished in that the specific surface area of the carbon adsorbents in m2/g in relation to the pore volume of the micropores in cm3/g is between 2400 and 2700.

Abstract: There is provided a method for detecting a machine-readable code that has been applied onto a mailpiece. An exemplary method comprises checking in at least one area of a surface of the mailpiece whether at least two parallel lines are present in the at least one area of the surface, at least two of the parallel lines being at a distance from each other that corresponds to a module width, at least one of the lines having a width that equals the module width. The exemplary method also comprises detecting modules of a data matrix code, in at least one partial area of the surface that is adjacent to one of the lines, taking into account the detection of the at least two parallel lines, the data matrix code having modules of the module width.

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: 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 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?{l, . . . , 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: In a system and method for encrypted data exchange between entities (users) of a communication system using cryptography based on elliptic curves, in response to a challenge of a first user a scalar multiplication is calculated by the second user, wherein only part of the result of the scalar multiplication is sent back as response to the first user.

Abstract: Sorbent for the dry cleaning of waste gases charged with mercury and process for the production thereof. The sorbent includes as an adsorptively acting constituent for example activated carbons or activated cokes which are mixed with sulfur in powder form at ambient temperature, under the action of atmospheric oxygen. The sorbent is distinguished by a given ratio in respect of the median values of the grain size of the adsorptively operative constituent to the sulfur.