From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: 103376,56250291936154a0
X-Google-Attributes: gid103376,public
From: gisle@apal.ii.uib.no (Gisle S�lensminde)
Subject: Re: OS Bindings (was: Where is the elusive jump command?)
Date: 2000/04/13
Message-ID: <slrn8fbb3h.svk.gisle@apal.ii.uib.no>#1/1
X-Deja-AN: 610618071
Content-Transfer-Encoding: 8bit
References: <38D771CA.D41AF9B5@port.ac.uk>
 <wcczorkm4tl.fsf@world.std.com><wyVD4.17218$624.1463963@news.flash.net>
 <8bq7ku$mc8$1@nnrp1.deja.com><mp2E4.17360$624.1487865@news.flash.net><38E0E723.C39C392@quadruscorp.com>
 <8brfm4$4uc$1@nnrp1.deja.com><8brn4k$p6i$1@slb0.atl.mindspring.net>
 <8brrpj$i04$1@nnrp1.deja.com><38E312F8.78883ACB@icn.siemens.de>
 <8c4rvf$d9k$1@nnrp1.deja.com><umqvh1wnaad.fsf@gong2.clustra.com>
 <2000Apr5.070127.1@eisner><umq8zyrmzgp.fsf@gong2.clustra.com>
 <2000Apr6.081305.1@eisner><8ci6vf$r5a$1@nnrp1.deja.com>
 <8ck638$krs3@ftp.kvaerner.com><8cp23c$4gp$1@nnrp1.deja.com>
 <8csjs8$o2p3@ftp.kvaerner.com><8d0su8$bqt$1@nnrp1.deja.com>
 <wccitxnbfak.fsf@world.std.com> <8d20bq$o2p4@ftp.kvaerner.com>
 <wccg0srbbc4.fsf@world.std.com> <8d2dq9$2le$1@nnrp1.deja.com>
 <8d3s9o$6621@ftp.kvaerner.com>
Organization: University of Bergen, Norway
Content-Type: text/plain; charset=iso-8859-1
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 2000-04-13T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <8d3s9o$6621@ftp.kvaerner.com>, Tarjei T. Jensen wrote:
>
>Robert Dewar wrote
>>That may be OK, multiple precision integers can be useful,
>>so long as you do not go berserk and require that I be
>>able to use them for case indexes, subscripts, entryu
>>family indexes, loop variables, etc.
>
>
>Agree. I think Ada could do well in encryption applications if there were
>general support for this. E.g. arithmetic, and, or, xor,  conversion to
>integer, simple math functions. Most other uses could be done by converting to
>integer.

Ada is in fact quite good for implementing at least symetric crypto
algorithms. For these algorithms the important is the availability
of operation like bitwise and, or, xor, not, shift and rotate, which
these algorithms use. Ada have all these operations, which is more 
than even C has. (C miss rotate, but it is often implemened through
a idiom). The only problem is that you can't use userdefined types,
but must use unsigned_X from interfaces if you want to use shift
or rotate. 

For public key cryptography, Ada miss multiprecision numbers,
but so do C/C++ which is the commonly used language in the area.

--
Gisle S�lensminde ( gisle@ii.uib.no )   

ln -s /dev/null ~/.netscape/cookies