Article View: sci.crypt
Article #1102pgp modmult alternatives
From: Rob Stampfli
Date: Wed, 30 Sep 1992 00:35
Date: Wed, 30 Sep 1992 00:35
7 lines
767 bytes
767 bytes
The pgp2.0 Makefile has a section where you can define one of three modulo multiply algorithms. They are called UPTON, which is selected by default, MERRITT, and PEASANT. Has anyone tried either MERRITT or PEASANT and found them faster? -- Rob Stampfli rob@colnet.cmhnet.org The neat thing about standards: 614-864-9377 HAM RADIO: kd8wk@n8jyv.oh There are so many to choose from.
Technical Details
Message-ID:
<1992Sep30.003542.26590@colnet.cmhnet.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!n8emr!colnet!resShow Full Headers
Complete Article Headers
Newsgroups: sci.crypt,alt.security.pgp Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!n8emr!colnet!res From: res@colnet.cmhnet.org (Rob Stampfli) Subject: pgp modmult alternatives Message-ID: <1992Sep30.003542.26590@colnet.cmhnet.org> Keywords: UPTON MERRITT PEASANT Organization: Little to None Date: Wed, 30 Sep 1992 00:35:42 GMT Lines: 7