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=3.8 required=5.0 tests=BAYES_00,INVALID_MSGID,
	RATWARE_MS_HASH,RATWARE_OUTLOOK_NONAME autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fb57f,9a441a9594e85d08
X-Google-Attributes: gidfb57f,public
X-Google-Thread: 103376,9a441a9594e85d08
X-Google-Attributes: gid103376,public
From: "Dmitriy Anisimkov" <ts@quadrat.omsk.su>
Subject: Re: Bignum modular types in Ada95
Date: 1998/01/28
Message-ID: <01bd2bed$1bfab2a0$2c04a8c0@sezam>#1/1
X-Deja-AN: 319971928
References: <34CE568C.55D7E23D@cl.cam.ac.uk>
Organization: ������� ltd
Newsgroups: comp.lang.ada,sci.crypt
Date: 1998-01-28T00:00:00+00:00
List-Id: <comp.lang.ada>


Hello.

Markus Kuhn <Markus.Kuhn@cl.cam.ac.uk>
> One of the especially nice things about Ada seem to be the modular
> types. Many of the calculations in asymmetric cryptography are done
> over the integers modulo N, where N is a huge number (typically
> 1024 bits long or more).

The GNAT, Aonix and Intermetrix compiler not support integer/modular
numbers more then 64 bit. But I have implemented the numbers which can
allocate more then 64bit, theoreticaly up to 2_000_000_000 bits. I have
implemented operations "+", "-", "*", "/", ">" ,"<", ">=", "<=", "=",
Shift. I plan to implement "and","or" shortly. I still not strongly test
this library and interesting to do this under the real application. I'm
ready to grant free help of using this library and to listen any
suggestions. I develop it under the GNAT and now porting it to the AONIX
ObjectADA for Windows. If you want to use this library, tell me, and I'm
send it to you.

Dmitriy Anisimkov. ts@quadrat.omsk.su