Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbatt!ihnp4!inuxc!pur-ee!j.cc.purdue.edu!k.cc.purdue.edu!l.cc.purdue.edu!cik
From: cik@l.cc.purdue.edu (Herman Rubin)
Newsgroups: sci.crypt
Subject: Re: Need multiprecision arithmetic package..
Message-ID: <440@l.cc.purdue.edu>
Date: Wed, 15-Oct-86 09:44:31 EST
Article-I.D.: l.440
Posted: Wed Oct 15 09:44:31 1986
Date-Received: Sun, 26-Oct-86 01:12:11 EST
References: <465@zen.BERKELEY.EDU>
Distribution: net.crypt
Organization: Purdue University Computing Center
Lines: 13
Keywords: **, modular
Summary: Good multiprecision arithmetic


Clearly efficiency is needed in cryptographic computations.  There is
no possibility of 10 percent efficiency in C or any higher level language
with which I am acquainted, and 1 percent or less would not surprise me.
The actual machine architecture may even affect the algorithm to use, and
the instructions to use are not available in the higher level languages..
-- 
(Usual disclaimer line.)
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907
Phone: (317)494-6054
(decvax,ihnp4,uiucdcs)!pur-ee!stat-l!cik
(decwrl,hplabs,ucbvax)!purdue!stat-l!cik
hrubin@l.cc.purdue.edu