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 2002:a24:90c4:: with SMTP id x187mr14903627itd.172.1560320458948; Tue, 11 Jun 2019 23:20:58 -0700 (PDT) X-Received: by 2002:a9d:69c2:: with SMTP id v2mr3275266oto.22.1560320458778; Tue, 11 Jun 2019 23:20:58 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!g15no84582itd.0!news-out.google.com!l135ni112itc.0!nntp.google.com!g15no84580itd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Tue, 11 Jun 2019 23:20:58 -0700 (PDT) In-Reply-To: <872c1b02-30c4-432a-89b0-a5001763df1e@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2a00:23c0:8889:5d00:b505:b11c:9fe8:fe34; posting-account=vqTx3goAAAB5xfJBeSPSeAJsd6lAhA_p NNTP-Posting-Host: 2a00:23c0:8889:5d00:b505:b11c:9fe8:fe34 References: <872c1b02-30c4-432a-89b0-a5001763df1e@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: There Is A Pressing Need For a Scrambling Prodcedure as a standard Packlage in the Ada Langauge. From: ao402468@gmail.com Injection-Date: Wed, 12 Jun 2019 06:20:58 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader01.eternal-september.org comp.lang.ada:56623 Date: 2019-06-11T23:20:58-07:00 List-Id: On Tuesday, 11 June 2019 20:18:37 UTC+1, ao40...@gmail.com wrote: > I can demonstrate a scrambling procedure that I have developed over the y= ears in Ada-95 using my ancient Gnat 311.p compiler. The procedure is my p= ersonal invention and is designed to *positionally change the order of inte= gers in a string of decimal integers such that a whole new permutation is r= ealized if the set of integers in question is *non-repeating* (mandatory)to= begin with. >=20 > This procedure is the basis of a very important key transport system that= I have developed in cryptography. There is a very important need for this= method to be recognized by the custodians of the Ada language and to be in= cluded in the Ada library for the use of cryptographers alone if not for al= l round ubiquitous use. >=20 > I do not know how to go about this task nor do I have the clout to be lis= tened to by the establishment but I think it should be considered by the el= ders of Ada so to speak. >=20 > I have posted some work recently to sci.crypt that describes the applicat= ion of this procedure to a new key transport system that I have invented. >=20 > https://groups.google.com/forum/#!topic/sci.crypt/5076HKc7vPY >=20 > I appeal to readers in your group to do something to have this procedure = recognized and incorporated in the Ada language for the general good of the= language and especially for the particular good of cryptography. >=20 > Perhaps it has already been done as a package that I do not know of? >=20 > Your help would be appreciated. >=20 > Austin O'Byrne Please visit: https://groups.google.com/forum/#!topic/sci.crypt/paOsOVFkDHI