Abstract: Control Flow Graph flattening of a function of software code comprising a plurality of basic blocks having an address and at least one instruction.

Abstract: It is provided a method for hardening of control flow graph flattening, wherein each Basic Block is stored on a slot and jumps to a single function that computes the address of the next Basic Block, comprising the steps of: each time after executing a Basic Block, copying the Basic Block at a start offset selected in an available slot; inserting at least one junk code at least one of before, after and inside the Basic Block on the basis of a reference image of the Basic Block; and updating a database including a current address and image of each Basic Block.

Abstract: A device stores program code in a plurality of slots in its memory. When a processor of the device receives a call to an encrypted function, it uses a slot table to find the location of the cipher function and the cipher module and the key to decrypt the encrypted module. The encrypted module is decrypted, executed, re-encrypted and moved to a new memory slot. The cipher function used is moved to a further new slot and the slot table is updated. Also provided is a method and a computer program support. The invention can make it more difficult to analyse execution traces of the program code.

Abstract: A function of a software program is stored in a memory during execution in a device of the software program. A processor relocates the function in a region of the memory comprising dummy code, transforms the dummy code in a predictable manner, generates a predicted checksum for the region based on a previous checksum, generates a calculated checksum over the region, and verifies the integrity of the function by comparing the predicted checksum and the calculated checksum. Also provided are a device and a computer program product.

Abstract: Self-modifying software code comprising a number of modules that each may be modified to be in a plurality of states during execution. In order to verify the integrity of such code, the different states of the code are calculated. For each state a checksum, e.g. a hash value, is generated for at least part of the code. During execution the state of the code is changed, modifying a module, and an integrity check is performed using the checksum for the state of the code. The checksum may be stored in a look-up table or it may be embedded in the integrity verification function. A state variable indicating the state of the modules may be used to look-up the checksum in the table. Possible states of a module is encrypted and decrypted. Also provided is an apparatus for generating protected software code.

Abstract: A method for detecting a version of a client software in a network. A server receives a first request from the client software, sends a first response comprising a first challenge to the client software, receives a second request comprising an answer to the first challenge from the client software, and detects the version of the client software from at least the second request. The answer to the challenge is dependent on the version of the client software and is expressed as a modification to a communication protocol used for the first and the second request. Also provided are a server, a client and a computer program product.

Abstract: The present invention relates to IP networks and, more particularly, local area networks, for example home networks. It concerns the manner in which devices connected to such networks obtain and update knowledge of the other compatible devices connected to the network. To do this, the invention is based on a finite-state machine, comprising connected, disconnected and standby states. The changes of state take place on receipt of messages, requests or replies from the other devices, or on expiry of timers in the absence of receipt of messages.

Abstract: The present invention relates to IP networks and, more particularly, local area networks, for example home networks. It concerns the manner in which devices connected to such networks obtain and update knowledge of the other compatible devices connected to the network. This method is based on the regular transmission of signalling messages by all the compatible devices. Thus, by monitoring the network, a device is able to detect the other devices in the network.

Abstract: The present invention relates to IP networks and, more particularly, local area networks, for example home networks. It concerns the manner in which devices connected to such networks obtain and update knowledge of the other compatible devices connected to the network. To do this, the invention is based on a finite-state machine, comprising connected, disconnected and standby states. The changes of state take place on receipt of messages, requests or replies from the other devices, or on expiry of timers in the absence of receipt of messages.