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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.107.133.15 with SMTP id h15mr1506068iod.95.1493972928446; Fri, 05 May 2017 01:28:48 -0700 (PDT) X-Received: by 10.157.45.79 with SMTP id v73mr768146ota.20.1493972928411; Fri, 05 May 2017 01:28:48 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!news.glorb.com!c26no675043itd.0!news-out.google.com!v18ni2702ita.0!nntp.google.com!c26no677302itd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Fri, 5 May 2017 01:28:48 -0700 (PDT) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=81.152.68.179; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 81.152.68.179 References: <45c389ad-5b2c-4f6a-9003-8a64d41d9ddc@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <115f320e-84b1-41fa-a416-96f918952534@googlegroups.com> Subject: Re: Large Integer Overflow - Causing a Bottleneck - Any solution. From: Austin Obyrne Injection-Date: Fri, 05 May 2017 08:28:48 +0000 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:46673 Date: 2017-05-05T01:28:48-07:00 List-Id: On Wednesday, May 3, 2017 at 5:18:00 PM UTC+1, Simon Wright wrote: > Austin Obyrne writes: >=20 > > I am using a very old Ada compiler (gnat 311.p) in the Windows_7 > > operating system that has 64-bit architecture to write cryptography. > > > > Everything has gone well thus far but now I find I am being stymied > > from expanding my cipher by the upper bound placed by my Ada compiler > > on positive integers to 2^31 -1 or 2147483647 for positive integers. > > > > Is there any solution to this that won't want me to leave the main > > program in order to do it. >=20 > Even where a GNAT is built for a machine with 64-bit addresses, it uses > 32-bit integers as you have seen. >=20 > You could try, near the top of your program (assuming it's just one > compilation unit), >=20 > subtype Integer is Long_Integer; Hi Simon, I don't think I am going to have a problem after all. I have developed new= mathematics (vector factoring) that has given me a very powerful algorithm= that will only need quite small integers on a typical home computer. A snag if I can call it that is that the linitations of a home computer per= mit only one iteration of the core algotithm because of increasing integer = size. Each iteration would give one alternative variant of the design ciphe= r and that would be useful in serious main stream crytptography but there a= re many alternatives to increasing the scope of my cipher in other ways. This cipher is lookin very good now and I'm pleased it is written in Ada. I hesitate to go for long integer procedures considering the simple portabi= lity of the present version unless it becomes absolutely necessary and I do= n't think now that it will be necessaary today. I am 'mollified' by the knowledge that the large integer a la 32 bit archit= ecture seems to be here to stay and there is no easy way "there for the fin= ding" that I am missing through laziness of pursuit. As always I am hugely grateful to you and your group colleagues for your he= lp - nearing the end of this project now. My past career was running very large oil tankers at sea. adacrypt