Turing is a new, fast, stream cipher. It is
experimental, and may or may not be secure.
Version 1.7 (of TuringRef.c) should be considered
to define the cipher.
Basically, Turing is a large word-oriented LFSR,
which feeds into a keyed nonlinear filter that
looks somewhat like a round of a block cipher.
There's no competition or prize to break it, we
don't think it's as secure as a one-time-pad, and
the keys top out at 256 bits. It's about 6 times
as fast as AES in counter mode on the machines
we've tested it on. What else? Oh, yes, we like to
think the source code is written in readable C.
And it's documented.
The following files are available on our web site
http://people.qualcomm.com/ggr/QC :
Turing.tgz is a gzipped tar archive of the
various implementations. Note that I use
8-character tabs but a 4-character indent.
Included are a generic test harness, a reference
implementation, a faster implementation using
table lookups, a very fast implementation using
all inline code, and an intermediate version that
uses lazy evaluation to fill the Sbox tables
(both key agile and reasonably fast).
TuringPres.pdf (240k) is the full presentation
prepared for the rump session of Crypto2002 (27
slides, only 1 of which was shown). It's been
updated to be consistent with the source code.
TuringPaper.pdf is a full paper about the final
design. (Submitted to Fast Software Encryption.)
Comments are, of course, welcome.
Greg.
--
Greg Rose INTERNET: ggr@qualcomm.com
Qualcomm Australia VOICE: +61-2-9817 4188 FAX: +61-2-9817 5199
Level 3, 230 Victoria Road, http://people.qualcomm.com/ggr/
Gladesville NSW 2111 232B EC8F 44C6 C853 D68F E107 E6BF CD2F 1081 A37C
--
DaleBrayden - 04 Dec 2002
Books RSS
