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:f587:: with SMTP id
 k129mr21235211ith.77.1560280715639;
        Tue, 11 Jun 2019 12:18:35 -0700 (PDT)
X-Received: by 2002:aca:3c0a:: with SMTP id j10mr16325673oia.44.1560280715425;
 Tue, 11 Jun 2019 12:18:35 -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!s188no1139itb.0!news-out.google.com!l135ni468itc.0!nntp.google.com!g15no1035itd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Tue, 11 Jun 2019 12:18:35 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=2a00:23c0:8889:5d00:55e5:b8df:c12f:e833;
 posting-account=vqTx3goAAAB5xfJBeSPSeAJsd6lAhA_p
NNTP-Posting-Host: 2a00:23c0:8889:5d00:55e5:b8df:c12f:e833
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <872c1b02-30c4-432a-89b0-a5001763df1e@googlegroups.com>
Subject: There Is A Pressing Need For a Scrambling Prodcedure as a standard
 Packlage in the Ada Langauge.
From: ao402468@gmail.com
Injection-Date: Tue, 11 Jun 2019 19:18:35 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Xref: reader01.eternal-september.org comp.lang.ada:56620
Date: 2019-06-11T12:18:35-07:00
List-Id: <comp.lang.ada>

I can demonstrate a scrambling procedure that I have developed over the yea=
rs in Ada-95 using my ancient Gnat 311.p compiler.  The procedure is my per=
sonal invention and is designed to *positionally change the order of intege=
rs in a string of decimal integers such that a whole new permutation is rea=
lized if the set of integers in question is *non-repeating* (mandatory)to b=
egin with.

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 m=
ethod to be recognized by the custodians of the Ada language and to be incl=
uded in the Ada library for the use of cryptographers alone if not for all =
round ubiquitous use.

I do not know how to go about this task nor do I have the clout to be liste=
ned to by the establishment but I think it should be considered by the elde=
rs of Ada so to speak.

I have posted some work recently to sci.crypt that describes the applicatio=
n of this procedure to a new key transport system that I have invented.

https://groups.google.com/forum/#!topic/sci.crypt/5076HKc7vPY

I appeal to readers in your group to do something to have this procedure re=
cognized and incorporated in the Ada language for the general good of the l=
anguage and especially for the particular good of cryptography.

Perhaps it has already been done as a package that I do not know of?

Your help would be appreciated.

Austin O'Byrne