E0 is a stream cipher used in the Bluetooth protocol. It generates a sequence of pseudorandom numbers and combines it with the data using the XOR operator. The key length may vary, but is generally 128 bits.
Description[]
At each iteration, E0 generates a bit using four shift registers of differing lengths (25, 31, 33, 39 bits) and two internal states, each 2 bits long. At each clock tick, the registers are shifted and the two states are updated with the current state, the previous state and the values in the shift registers. Four bits are then extracted from the shift registers and added together. The algorithm XORs that sum with the value in the 2bit register. The first bit of the result is output for the encoding.
E0 is divided in three parts:
 Payload key generation
 Keystream generation
 Encoding
The setup of the initial state in Bluetooth uses the same structure as the random bit stream generator. We are thus dealing with two combined E0 algorithms. An initial 132bit state is produced at the first stage using four inputs (the 128bit key, the Bluetooth address on 48 bits and the 26bit master counter). The output is then processed by a polynomial operation and the resulting key goes through the second stage, which generates the stream used for encoding. The key has a variable length, but is always a multiple of 2 (between 8 and 128 bits). 128 bit keys are generally used. These are stored into the second stage's shift registers. 200 pseudorandom bits are then produced by 200 clock ticks, and the last 128 bits are inserted into the shift registers. It is the stream generator's initial state.
Cryptanalysis[]
Several attacks and attempts at cryptanalysis of E0 and the Bluetooth protocol have been made, and a number of vulnerabilities have been found. In 1999, Miia Hermelin and Kaisa Nyberg showed that E0 could be broken in 2^{64} operations (instead of 2^{128}), if 2^{64} bits of output are known.^{[1]} This type of attack was subsequently improved by Kishan Chand Gupta and Palash Sarkar. Scott Fluhrer, a Cisco Systems employee, found a theoretical attack with a 2^{80} operations precalculation and a key search complexity of about 2^{65} operations.^{[2]} He deduced that the maximal security of E0 is equivalent to that provided by 65bit keys, and that longer keys do not improve security. Fluhrer's attack is an improvement upon earlier work by Golic, Bagini and Morgani, who devised a 2^{70} operations attack on E0.
In 2000, the Finn Juha Vainio showed problems related to misuse of E0 and more generally, possible vulnerabilities in Bluetooth.^{[3]}
In 2004, Yi Lu and Serge Vaudenay published a statistical attack requiring the 24 first bits of 2^{35} Bluetooth frames (a frame is 2745 bits long). The final complexity to retrieve the key is about 2^{40} operations. The attack was improved to 2^{37} operations for precomputation and 2^{39} for the actual key search.^{[4]}^{[5]}
In 2005, Lu, Meier and Vaudenay published a cryptanalysis of E0 based on a conditional correlation attack. Their best result required the first 24 bits of 2^{23.8} frames and 2^{38} computations to recover the key. The authors assert that "this is clearly the fastest and only practical knownplaintext attack on Bluetooth encrytion compare with all existing attacks".^{[6]}
See also[]
References[]
External links[]
 Template:Cite web Slides.

fr:E0 (algorithme)