Telefonaktiebolaget Lm Ericsson (publ)

Elena Dubrova

Mats Näslund

Göran Selander

Karl Norrman

Fredrik Lindqvist

Bernard Smeets

Vesa Torvinen

Gunnar Mildh

Jari Arkko

Vlasios Tsiatsis

John Fornehed

Martin Hell

Jari Arrko

Gunnar Carlsson

A method of verifying that a first device and a second device are physically interconnected is disclosed. The method is performed by a verifier and includes sending a challenge Rto the first device, for use as basis for input to a first physical unclonable function, PUF, &#x2014;part of the first device, receiving, a response, RES, from the second device, the response RESbeing based on an output of a second PUF part of the second device, and verifying that the first device and the second device are interconnected for the case that the received response, RES, and an expected response fulfills a matching criterion. A method in a first device and a method in a second device and corresponding devices, computer programs and computer program products are also disclosed.

Methods of verifying that a first device and a second device are physically interconnected

A method () is provided for performing a trustworthiness test on a random number generator, RNG, () comprising a physical unclonable function, PUF-module (). The trustworthiness test is implemented as a known answer test, KAT, and the method () comprises: receiving (), in the PUF-module (), an input based on test data, T, received from a verifier () provided with at least one test data-test result pair, (T, R), providing () an output from the PUF-module (), determining () a test result, R', based on the output from the PUF-module (), and providing () the test result, R&#x2032;, to the verifier (). A random number generator (), computer program and computer program products and a method performed by or in a verifier are also provided.

Method for performing a trustworthiness test on a random number generator

A method performed by a device for protecting data is provided. The method comprises inputting, to a Physically Unclonable Function, PUF, of the device, a challenge; obtaining, from the PUF, a response; and protecting the data by using the response. A device, a method in an encryption unit, computer program and computer program product are also provided.

Methods and devices for protecting data

A method () of generating a pseudonym associated with a communication device () is disclosed. The method () is performed in a network node () of a communications system () and comprises generating () a pseudonym embryo based on one or more elements of a sequence (S, S, . . . , S), obtaining () the pseudonym as output of a masking operation applied to the pseudonym embryo, wherein the masking operation comprises a one-to-one mapping, and transmitting () the pseudonym to the communication device (). A corresponding network node (), computer program and computer program product are also disclosed.

Method of generating a pseudonym associated with a communication device, a network node, computer program and computer program product

The disclosure relates to a method () for a serving device () of establishing a computational puzzle for use in communication between a client device () and the serving device (). The method () comprises establishing (), in the serving device (), the computational puzzle (p) based on a key shared by the client device () and the serving device () and on a solution (s', s&#x2033;) to the computational puzzle (p). Further method () in a serving device is provided, methods () for client devices (), serving devices (), client devices (), computer programs and computer program products.

Method and device for establishing a computational puzzle for use in communication between a client and a server

A method () of generating a cryptographic checksum for a message M(x) is provided. The method is performed by a communication device, such as a sender or a receiver, and comprises calculating () the cryptographic checksum as a first function g of a division of a second function of M(x), &#x192;(M(x)), modulo a generator polynomial p(x) of degree n, g(&#x192;(M(x))mod p(x)). The generator polynomial is calculated () as p(x)=(1&#x2212;x)&#xb7;P(x), and P1(x) is a primitive polynomial of degree n&#x2212;1. The primitive polynomial is selected (), based on a first cryptographic key, from the set of primitive polynomials of degree n&#x2212;1 over a Galois Field. By replacing a standard checksum with a cryptographic checksum, an efficient message authentication is provided. The proposed cryptographic checksum may be used for providing integrity assurance on the message, i.e., for detecting random and intentional message changes, with a known level of security. The proposed checksum is capable of detecting double-bit errors which may be introduced by a Turbo code decoder.

Generating cryptographic checksums

The disclosure relates to a method () for a network node () of a wireless network () of providing a device () access to the wireless network (). The method () comprises receiving (), from a device (), an access request comprising a preamble; establishing (), in response to the access request, a computational puzzle based on the received preamble; and sending () the computational puzzle to the device (). A corresponding method in a device is also disclosed, as are a network node (), device (), computer programs and computer program products.

Method in a network node for providing a device access to a network

A technique for generating a keystream () for ciphering or deciphering a data stream () is provided. As to a method aspect of the technique, a nonlinear feedback shift register, NLFSR (), including n register stages implemented in a Galois configuration is operated. At least one register stage of the implemented n register stages is representable by at least one register stage of a linear feedback shift register, LFSR. A first subset of the implemented n register stages is representable by a second subset of a second NLFSR. A number of register stages receiving a nonlinear feedback in the second NLFSR is greater than one and less than a number of register stages receiving a nonlinear feedback in the implemented NLFSR. The keystream () is outputted from a nonlinear output function (). An input of the nonlinear output function () is coupled to at least two of the implemented n register stages of the NLFSR ().

Stream ciphering technique

A method and arrangements for enabling authentication of a communication device is suggested, where a network node, capable of operating as an authentication server does not have to store all state related information relevant for a roundtrip of an authentication session. Instead of storing all this information, at least a part of it is provided to the authenticator or the communication unit, for later retrieval in a subsequent response. Based on the state related information provided in the response, the network node is capable of reproducing a state associated with a respective roundtrip. By repeating the mentioned process for a required number of roundtrips, an authentication session can be executed, where less state related information need to be stored at the mentioned network node.

Methods and arrangements for authenticating a communication device

A method () of generating a cryptographic checksum for a message M(x) is provided. The method comprises pseudo-randomly selecting () at least two irreducible polynomials p(x). Each irreducible polynomial p(x) is selected based on a first cryptographic key from the set of irreducible polynomials of degree nover a Galois Field. The method further comprises calculating () a generator polynomial p(x) of degree n=formula (I) as a product of the N irreducible polynomials formula (II), and calculating () the cryptographic checksum as a first function g of a division of a second function of M(x), &#x192;(M(x)), modulo p(x), i.e., g(&#x192;(M(x)) mod p(x)). By replacing a standard checksum, such as a Cyclic Redundancy Check (CRC), with a cryptographic checksum, an efficient message authentication is provided. The proposed cryptographic checksum may be used for providing integrity assurance on the message, i.e., for detecting random and intentional message changes, with a known level of security. Further, a corresponding computer program, a corresponding computer program product, and a checksum generator for generating a cryptographic checksum, are provided. 

A method () of generating a cryptographic checksum for a message M(x) is provided. The method comprises pseudo-randomly selecting () a generator polynomial p(x) from the set of polynomials of degree n over a Galois Field and calculating () the cryptographic checksum as a first function g of a division of a second function of M(x), &#x192;(M(x)), modulo p(x), g(&#x192;(M(x))mod p(x)). The generator polynomial p(x) is pseudo-randomly selected based on a first cryptographic key. By replacing a standard checksum, such as a Cyclic Redundancy Check (CRC), with a cryptographic checksum, an efficient message authentication is provided. The proposed cryptographic checksum may be used for providing integrity assurance on the message, i.e., for detecting random and intentional message changes, with a known level of security. Further, a corresponding computer program, a corresponding computer program product, and a checksum generator for generating a cryptographic checksum, are provided.

A method of authorizing a message received at a node in a wireless network is disclosed. The message from a sender device is formed by a plurality of symbols and includes a first message integrity indicator located at a predetermined distance from the start of the message such that further symbols of the message are included after the first message integrity indicator. The position of the first message integrity indicator in the message is determined, and a cryptographic operation is performed on at least some of the symbols of the message before the first message integrity indicator so as to generate a second message integrity indicator before the first message integrity indicator is received. The first and second message integrity indicators are compared, and an indication that the message is not authorized is provided if the second message integrity indicator does not match the first message integrity indicator.

Energy saving in wireless devices

Electronic devices () are provided which comprise a digital logic circuit () and a test module () adapted to receive test parameters from a remote test management device (), generate test patterns based on the test parameters, apply the test patterns to the digital logic circuit, receive test responses from the digital logic circuit, compact the test responses into a test signature, and either transmit the test signature to the remote test management device or determine a test result based on a comparison of an expected signature received from the remote test management device with the test signature. Further provided are remote test management devices comprising means adapted to acquire test parameters suitable for generating test patterns for a digital logic circuit, acquire an expected signature corresponding to the test patterns, transmit the test parameters to at least one electronic device comprising the digital logic circuit, and either receive a test signature from the at least one electronic device and determine a test result based on a comparison of the expected signature with the test signature, or transmit the expected signature to the at least one electronic device.

Remote test management of digital logic circuits

A Feedback Shift-Register (FSR) enabling improved testing, e.g., Built-In Self-Tests (BIST), is provided. Each cell of the FSR may either be an observable cell, associated with a non-trivial feedback function implemented by a combinational logic circuit, or a controllable cell, having an associated state variable which belongs to the dependence set of exactly one of the non-trivial feedback functions. Each controllable cell is provided with a multiplexer for selecting either a predecessor cell of the controllable cell or a test value as input. Thus, the sequential circuit of the FSR in an embodiment is tested using tests for combinational logic. The disclosed test procedures utilize a minimal set of test vectors and allow detection of all single stuck-at faults in the FSR. The resulting dynamic power dissipation during test can be considerably less than known BIST designs.

Growing community of inventors

Sollentuna, Sweden

Elena Dubrova