This paper proposes the Turing stream cipher. Turing offers up to 256-bit key strength, and is designed for extremely efficient software implementation. It combines an LFSR generator based on that of SOBER[27] with a keyed mixing function reminiscent of a block cipher round. Aspects of the block mixer round have been derived from Rijndael[20], Twofish[21], tc24[23] and SAFER[22].

this document. (Note: the SOBER-128 f yields the same output as the SOBER-t32 f, but does not require a masking operation. The SBox[] table differs only in the high byte of each word.) Thus, the eight most significant bits of the output of f is the output of the Skipjack S-box, while the 24 LSBs are obtained by XORing the 24 bits of the output of the ISRC S-box with the 24 LSBs of the input (see Figure 2). The function f is defined this way to ensure that it is one-to-one and highly non- 10 linear, while using only a single, small S-box. The function f also serves to transfer the non-linearity from the high bits of its input to the low bits of its output

QUALCOMM has developed SOBER-128, a new primitive incorporating a stream cipher and MAC, which we believe is eminently suitable for use as a UMTS security primitive. It is free for any use and reference source code is available. It has been communicated directly to ETSI SAGE, so this

This note presents a slightly improved guess and determine attack on unstuttered Sober-t32 reducing the complexity of recovering the internal state from 2 320 to 2 .

Abstract not found