Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:02
Greg Rose (ggr@qualcomm.com)
Sat, 09 Jan 1999 06:16:26 +1000
At 11:25 8/01/99 -0800, bram wrote:
>On Fri, 8 Jan 1999, Greg Rose wrote:
>
>> I'm looking for any existing block ciphers with short (2 and 4 byte) block
>> sizes. ISTR something going past me a few months ago on this subject, but
>> can't remember where it was.
>
>At that point, why not just use a dictionary?
Thank you for this keen and insighful comment. My first reaction was "I've
thought about dictionary attacks" (which I had and they are inapplicable to
my intended application (which I can't say more about)), but my worldview
was shifted by this comment. Of course! For 256K bytes of memory, I can
create a 16-bit key dependent permutation table.
(For 16 gigabytes I could do a 32-bit one, but I don't think that would be
useful. It isn't clear that we could afford the 256K for this application
either... but maybe.)
So I'm still interested in other solutions, but thanks!
Greg.
Greg Rose INTERNET: ggr@Qualcomm.com
Qualcomm Australia VOICE: +61-2-9181-4851 FAX: +61-2-9181-5470
Suite 410, Birkenhead Point, http://people.qualcomm.com/ggr/
Drummoyne NSW 2047 232B EC8F 44C6 C853 D68F E107 E6BF CD2F 1081 A37C
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:02