Abstract: Some embodiments are directed to a keyed message authentication code (MAC) device (100) for computing a keyed MAC for an input message using encoded representations. The keyed MAC device may be configured to apply a sequence of compressions functions, at least one of which takes a state as input in an encoded representation.

Abstract: Some embodiments are directed to a compiling device (100) configured for selecting of protective transformations to improve security of a computer program. The compiling device is configured to assign protective transformations to parts of the data flow graph, and obtain a compilation of the computer program representation from at least the data flow graph and the assigned protective transformations which satisfy the security and/or the performance target.

Abstract: Some embodiments are directed to a compiler device (400) arranged for obfuscation of a computer program. The compiler device performs a live variable analysis on the computer program representation, and modifies the computer program representation to encode a first variable using at least a second variable as an encoding parameter.

Abstract: Some embodiments are directed to a server device (100) and a client device (200) arranged to authenticating a user of client device (200). The user has access to an authentication string. Server device (100) is configured to encrypt a set of character/position data according to a homomorphic encryption algorithm. The client device allows the user to select a subset from the encrypted set from which a verification number is computed using the homomorphic operation.

Abstract: Some embodiments are directed to a compiler device (400) arranged for obfuscation of a computer program. The compiler device performs a live variable analysis on the computer program representation, and modifies the computer program representation to encode a first variable using at least a second variable as an encoding parameter.

Abstract: Some embodiments are directed to a compiler device (100) configured to identify a sub-graph (210) in a data flow graph having one or more output nodes marked as encoded and one or more output nodes marked as non-encoded, and to replace the sub-graph by an encoded first sub-graph (210.1), and a non-encoded second sub-graph (210.2), wherein the first sub-graph has only encoded output nodes, and the second sub-graph has only non-encoded output nodes.

Abstract: Some embodiments are directed to a server device (100) and a client device (200) arranged to authenticating a user of client device (200). The user has access to an authentication string. Server device (100) is configured to encrypt a set of character/position data according to a homomorphic encryption algorithm. The client device allows the user to select a subset from the encrypted set from which a verification number is computed using the homomorphic operation.

Abstract: Some embodiments are directed to a compiling device (100) configured for selecting of protective transformations to improve security of a computer program. The compiling device is configured to assign protective transformations to parts of the data flow graph, and obtain a compilation of the computer program representation from at least the data flow graph and the assigned protective transformations which satisfy the security and/or the performance target.

Abstract: Some embodiments are directed to a keyed message authentication code (MAC) device (100) for computing a keyed MAC for an input message using encoded representations. The keyed MAC device may be configured to apply a sequence of compressions functions, at least one of which takes a state as input in an encoded representation.

Abstract: Some embodiments are directed to a compiler device (100) configured to identify a sub-graph (210) in a data flow graph having one or more output nodes marked as encoded and one or more output nodes marked as non-encoded, and to replace the sub-graph by an encoded first sub-graph (210.1), and a non-encoded second sub-graph (210.2), wherein the first sub-graph has only encoded output nodes, and the second sub-graph has only non-encoded output nodes.

Abstract: The invention relates to a flying device (701) arranged to fly in a space and to present an image in that space, a system comprising multiple flying devices (701) for presenting an image in a space and a method for presenting an image in a space using a flying device (701), wherein the flying device (701) is arranged to fly in the space under control of a control signal, the flying device (701) comprising one or more light units (731) arranged to emit multiple light beams (711, 712, 713) a communication unit arranged to receive the control signal and a processing unit arranged to control, based on the received control signal a position of the flying device and a light output of each of the multiple beams (711, 712, 713).

Abstract: The invention relates to a flying device (701) arranged to fly in a space and to present an image in that space, a system comprising multiple flying devices (701) for presenting an image in a space and a method for presenting an image in a space using a flying device (701), wherein the flying device (701) is arranged to fly in the space under control of a control signal, the flying device (701) comprising one or more light units (731) arranged to emit multiple light beams (711, 712, 713) a communication unit arranged to receive the control signal and a processing unit arranged to control, based on the received control signal a position of the flying device and a light output of each of the multiple beams (711, 712, 713).

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