Abstract: A calculating device (100) arranged to perform calculations on elements of a ring (R), a ring addition and a ring multiplication being defined on the ring The calculating device comprises an operator module (120) comprising multiple operator units, and a calculation manager (130) arranged to perform a ring multiplication by applying a sequence of the multiple operator units, and perform a ring addition be applying a sequence of the multiple operator units, wherein the sequence for the ring multiplication is the same as the sequence for the ring addition.

Abstract: A system for hiding a change to a set of variables of a program is provided. A value representing means (902) represents a value wi of a variable vi of the variables v1, v2, . . . , vn, wherein w is an element of a set W, by means of a representation ri wherein ri=E(Wi, ?i), and ri is an element of a set of representations ?(wi)={E(vvi,s)|s??}, wherein ?i is a state variable that is an element of a set ? and that provides a redundancy to the representation ri of wi and E is a one-to-one cryptographic mapping from W×? to a predetermined set. An action representing means (903) represents an action on values of variables in a subset V? of V by means of an action on V? and an action on V\V?, to obtain updated representations. The action on V? changes the representation rj of each variable Vj in the set of variables.

Abstract: A secure calculation is performed on at least one input value. The calculation includes a number of operations, with a first operation performed on the input value, and subsequent operations performed on results produced by previous operations. An initial encryption rank is set, based on the number of operations to be performed in the calculation. The input value is encoded, together with the initial encryption rank. The calculation is then performed, such that the first operation is performed on the encoded input value to produce an encoded result, and subsequent operations are performed on respective encoded results produced by previous operations to produce further encoded results. A new encryption rank is set when an operation in the calculation is performed on the encoded input value or on an encoded result produced by a previous operation, such that the encoded result of said operation in the calculation has the new encryption rank.

Abstract: A system for cryptographic processing comprises message unit (1, 7, 12) for providing a first message representation (3, 6, 11), wherein the first message representation is a representation of a message. The system comprises key unit (2) for providing a key representation (4, 9, 14), wherein the key representation is an encrypted representation of a first key of a first cryptographic algorithm and a second key of a second cryptographic algorithm, wherein the first cryptographic algorithm is different from the second cryptographic algorithm. The system comprises step unit (5, 10, 15) for performing a step of the first cryptographic algorithm and a step of the second cryptographic algorithm based on the first message representation (3, 6, 11) and the key representation, to obtain a second message representation (6, 11, 16).

Abstract: A calculating device (100) arranged to perform calculations on elements of a field (F), a field addition and a field multiplication being defined on the field. Encoded field elements are encoded according to one of at least two different encodings. A calculation manager (130) is arranged to selectively add or multiply a first encoded field element ((a, b)) and a second encoded field element (c, d), by for adding: apply the second translation operator unit to any encoded field element encoded according to the second encoding, and apply the set of addition operator units, and for multiplication: apply the first translation operator unit to any encoded field element encoded according to the first encoding, and apply the set of multiplication operator units.

Abstract: A physical uncloneable function (PUF) pattern is used for verifying a physical condition of an item. The PUF pattern is arranged to be damaged in the event that said item is exposed to a predetermined environmental condition. Verification of the physical condition of the item, is carried out by obtaining a measured response from the PUF pattern, and comparing the measured response with a stored response in respect of the PUF.

Abstract: A system for hiding a change to a set of variables of a program is provided. A value representing means (902) represents a value wi of a variable vi of the variables v1, v2, . . . , vn, wherein w is an element of a set W, by means of a representation ri wherein ri=E(Wi, ?i), and ri is an element of a set of representations ?(wi)={E(vvi,s)|s??}, wherein ?i is a state variable that is an element of a set ? and that provides a redundancy to the representation ri of wi and E is a one-to-one cryptographic mapping from W×? to a predetermined set. An action representing means (903) represents an action on values of variables in a subset V? of V by means of an action on V? and an action on V\V?, to obtain updated representations. The action on V? changes the representation rj of each variable Vj in the set of variables.

Abstract: A secure calculation is performed on at least one input value. The calculation includes a number of operations, with a first operation performed on the input value, and subsequent operations performed on results produced by previous operations. An initial encryption rank is set, based on the number of operations to be performed in the calculation. The input value is encoded, together with the initial encryption rank. The calculation is then performed, such that the first operation is performed on the encoded input value to produce an encoded result, and subsequent operations are performed on respective encoded results produced by previous operations to produce further encoded results. A new encryption rank is set when an operation in the calculation is performed on the encoded input value or on an encoded result produced by a previous operation, such that the encoded result of said operation in the calculation has the new encryption rank.

Abstract: A system for cryptographic processing comprises message unit (1, 7, 12) for providing a first message representation (3, 6, 11), wherein the first message representation is a representation of a message. The system comprises key unit (2) for providing a key representation (4, 9, 14), wherein the key representation is an encrypted representation of a first key of a first cryptographic algorithm and a second key of a second cryptographic algorithm, wherein the first cryptographic algorithm is different from the second cryptographic algorithm. The system comprises step unit (5, 10, 15) for performing a step of the first cryptographic algorithm and a step of the second cryptographic algorithm based on the first message representation (3, 6, 11) and the key representation, to obtain a second message representation (6, 11, 16).

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A computing device (500) comprising an electronic storage (510) and an electronic processor (550) coupled to the storage, the storage storing a series of table networks (110, T1, T2), the processor being configured to compute an iterated function on a global data-input (121, w0) and a global state-input (121, s0) by applying table networks of the series of table networks, —a table network (112, 114, Ti) of the series being configured for a corresponding data-function (ƒi) and state-function (gi) and is configured to map a data-input (121, 122, si) to a data-output (122, 123, wi) according to the corresponding data-function (ƒi), and to simultaneously map a state-input (121, 122, si-1) to a state-output (122, 123, si) according to a state-function (gi), —the electronic processor being configured to iterate applying the series of table networks (T1, T2, T1, T2), a table network (T1) of the iteratively applied table networks to the global data-input (w0) and global state-input (s0), and a successive table networ

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A wireless network system (30, 60) and a method for commissioning a wireless network system (30, 60) is described. The network system (30, 60) comprises at least a network device (1, 1?, 1?) and a joining device (21, 81, 91, 101, 111). In a commissioning mode, the network device (1, 1?, 1?) broadcasts network identification information. The joining device (21, 81, 91, 101, 111) sends, upon reception of the network identification information, a request to said network device (1, 1?, 1?) to join the network, comprising a predefined address of said joining device (21, 81, 91, 101, 111). The network device (1, 1?, 1?) assigns said joining device (21, 81, 91, 101, 111) a network address and stores corresponding data.

Abstract: A physical uncloneable function (PUF) pattern is used for verifying a physical condition of an item. The PUF pattern is arranged to be damaged in the event that said item is exposed to a predetermined environmental condition. Verification of the physical condition of the item, is carried out by obtaining a measured response from the PUF pattern, and comparing the measured response with a stored response in respect of the PUF.