Article View: sci.crypt
Article #459Re: Does Lucifer have weaknesses?
From: Andrew Haley
Date: Sun, 09 Aug 1992 18:08
Date: Sun, 09 Aug 1992 18:08
17 lines
789 bytes
789 bytes
ian@bvsd.co.edu (Ian Nelson) writes: : Does the Lucifer algorithm have any weaknesses? Yes. Lucifer with eight rounds and 128-bit blocks is breakable within 2**21 steps using 24 chosen ciphertext pairs. DES is a great improvement over this. Reference: Biham & Shamir, _Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer_, Proceedings of CRYPTO '91. : thanks, : Ian Nelson : -- Andrew.
Technical Details
Message-ID:
<1357@eouk9.eoe.co.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!acorn!eoe!ahaleyReferences:
<1992Aug6.215610.10235@bvsd.co.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!acorn!eoe!ahaley From: ahaley@eoe.co.uk (Andrew Haley) Newsgroups: sci.crypt Subject: Re: Does Lucifer have weaknesses? Message-ID: <1357@eouk9.eoe.co.uk> Date: 9 Aug 92 18:08:29 GMT References: <1992Aug6.215610.10235@bvsd.co.edu> Organization: EO Europe Limited, Cambridge, UK Lines: 17 X-Newsreader: Tin 1.1 PL3