<s>
Turing	B-Algorithm
is	O
a	O
stream	B-Algorithm
cipher	I-Algorithm
developed	O
by	O
Gregory	O
G	O
.	O
Rose	O
and	O
Philip	O
Hawkes	O
at	O
Qualcomm	O
for	O
CDMA	B-Protocol
.	O
</s>
<s>
Turing	B-Algorithm
generates	O
160	O
bits	O
of	O
output	O
in	O
each	O
round	O
by	O
applying	O
a	O
non-linear	O
filter	O
to	O
the	O
internal	O
state	O
of	O
an	O
LFSR	B-Architecture
.	O
</s>
<s>
It	O
is	O
named	O
after	O
Alan	O
Turing	B-Algorithm
.	O
</s>
<s>
This	O
is	O
evident	O
in	O
its	O
major	O
component	O
,	O
the	O
Linear	B-Architecture
Feedback	I-Architecture
Shift	I-Architecture
Register	I-Architecture
(	O
LFSR	B-Architecture
)	O
,	O
which	O
is	O
the	O
same	O
technology	O
found	O
in	O
the	O
family	O
of	O
SOBER	O
machines	O
.	O
</s>
<s>
Turing	B-Algorithm
,	O
however	O
,	O
is	O
distinguished	O
from	O
its	O
predecessors	O
by	O
the	O
way	O
it	O
produces	O
five	O
words	O
(	O
five	O
times	O
more	O
)	O
of	O
output	O
for	O
every	O
internal	O
update	O
.	O
</s>
<s>
It	O
also	O
provides	O
up	O
to	O
256-bit	O
key	O
strength	O
and	O
is	O
designed	O
to	O
be	O
fast	O
in	O
software	O
,	O
achieving	O
around	O
5.5	O
cycles/byte	O
on	O
some	O
x86	B-Operating_System
processors	O
.	O
</s>
<s>
There	O
are	O
experts	O
who	O
found	O
that	O
the	O
Turing	B-Algorithm
stream	B-Algorithm
cipher	I-Algorithm
has	O
a	O
number	O
of	O
weaknesses	O
when	O
faced	O
with	O
chosen	O
IV	O
attacks	O
.	O
</s>
