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: 103376,9a441a9594e85d08 X-Google-Attributes: gid103376,public X-Google-Thread: fb57f,9a441a9594e85d08 X-Google-Attributes: gidfb57f,public From: "Nick Roberts" Subject: Re: Bignum modular types in Ada95 Date: 1998/01/28 Message-ID: <01bd2b92$b639c1e0$64fc82c1@xhv46.dial.pipex.com>#1/1 X-Deja-AN: 319851248 Content-Transfer-Encoding: 7bit References: <34CE568C.55D7E23D@cl.cam.ac.uk> Content-Type: text/plain; charset=ISO-8859-1 Organization: UUNet UK server (post doesn't reflect views of UUNet UK) Mime-Version: 1.0 Newsgroups: comp.lang.ada,sci.crypt Date: 1998-01-28T00:00:00+00:00 List-Id: The message from this post for compiler writers is crystal clear! -- Nick Roberts ================================================ Croydon, UK ================= ========== Proprietor, ThoughtWing Software ====== Independent Software Development Consultant ==== Nick.Roberts@dial.pipex.com === Voicemail & Fax +44 181-405 1124 === I live not in myself, but I become Portion of that around me; and to me High mountains are a feeling, but the hum Of human cities torture. -- Byron [Childe Harold] Markus Kuhn wrote in article <34CE568C.55D7E23D@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). [...] > Which Ada95 compilers do support 1024-bit integers today and can > do an efficient modular exponentiation over them? > Markus G. Kuhn, Security Group, Computer Lab, Cambridge University, UK > email: mkuhn at acm.org, home page: