Article View: sci.crypt
Article #1365FEAL and N-Hash
From: Bruce Schneier
Date: Fri, 16 Oct 1992 01:10
Date: Fri, 16 Oct 1992 01:10
20 lines
1299 bytes
1299 bytes
I am looking for a C programmer who is willing to implement FEAL and N-Hash. FEAL is a block algorithm from Japan; N-Hash is a one-way hash function from the same place. Eli Biham and Adi Shamir made mincemeat out of them with differential cryptanalysis, but they still have some interest. Anyway, I have paper copies of C source code that claims to implement the algorithms (a few pages; not very long). I am looking for someone who is willing to get them working, and then let me publish the source code in my book. This looks like a pretty simple operation for an experienced C programmer. Any takers? Bruce **************************************************************************** * Bruce Schneier * Counterpane Systems For a good prime, call 391581 * 2^216193 - 1 * schneier@chinet.chi.il.us ****************************************************************************
Technical Details
Message-ID:
<Bw6wLB.9H3@chinet.chi.il.us>Path:
arc1-ca.pugleaf.net!sparky!uunet!europa.asd.contel.com!darwin.sura.net!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!destroyer!ncar!uchinews!machine!chinet!schneierShow Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!europa.asd.contel.com!darwin.sura.net!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!destroyer!ncar!uchinews!machine!chinet!schneier From: schneier@chinet.chi.il.us (Bruce Schneier) Subject: FEAL and N-Hash Message-ID: <Bw6wLB.9H3@chinet.chi.il.us> Organization: Chinet - Public Access UNIX Date: Fri, 16 Oct 1992 01:10:22 GMT Lines: 20