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.66.173.75 with SMTP id bi11mr2223854pac.4.1402318209716; Mon, 09 Jun 2014 05:50:09 -0700 (PDT) X-Received: by 10.140.109.71 with SMTP id k65mr6864qgf.30.1402318209645; Mon, 09 Jun 2014 05:50:09 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!feeds.phibee-telecom.net!zen.net.uk!dedekind.zen.co.uk!news.glorb.com!a13no134566igq.0!news-out.google.com!q9ni356qaj.0!nntp.google.com!j5no2727821qaq.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Mon, 9 Jun 2014 05:50:09 -0700 (PDT) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=86.176.53.90; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 86.176.53.90 References: User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Technical Question. From: Austin Obyrne Injection-Date: Mon, 09 Jun 2014 12:50:09 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:20188 Date: 2014-06-09T05:50:09-07:00 List-Id: On Monday, June 9, 2014 1:15:46 PM UTC+1, Austin Obyrne wrote: > A cryptographic cipher I have written is demonstrable by mathematical pro= of to be the ultimate in cryptographic strength i.e. it is of "Theoreticall= y Unbreakable Class" in official crypto terminology. Although the algorithm= is written in stone by analogy I always avail of any extra entanglement (u= sually considerable) that may up for grabs at the programming stage when I = write any cipher programs. This is often a property of the Ada language alo= ne quite part from the general cipher mathematical algorithm. Demonstration= . This is an array below that loads the 'I' coefficients of a vector (the J= and K coefficients are elsewhere also in other arrays not shown here). *Th= e elements of the array reside in off-page (In the folder) reservoirs calle= d 'packages' (Case Statements) when not required and are loaded into the re= ady-use array called 'E' initially at boot-up time of the computer. The pro= cedure below scrambles the elements of the array called 'E' by positional r= eshuffling them from their original assigned position and repositioning the= m by controlled means in another array called 'EE'. That procedure is safel= y invertible at decryption time and so far this ploy has never let me down.= The elements of 'E' are scrambled while being loaded into the array 'EE' a= nd are later called *sequentially from 'EE' for use by the main program at = run-time as key material. Question. Is this ploy of scrambling key material= by this means legit in Ada - i.e. is it sanctioned by the Ada reference ma= nual ? i.e. is it acceptable to you guys as *proper Ada orogramming practic= e?. I intend to go on using it but I would like to know what you think. Thi= s ploy is my own invention. I would be grateful for your replies. ---------= ----------------------------------------------------------------------- PRO= CEDURE Load_n_Scramble_Normal_Vector_I_Coefficients IS -- Pre: Normal_Vecto= r_I_Coefficients_ Package is defined. -- Post: These coefficients are store= d in ready use arrays at runtime. BEGIN -- Load_Normal_Vector_I_Coefficient= s FOR I IN 1 .. 1000 LOOP E(I) :=3D Normal_Vector_I_Coefficients.NumberExch= ange(Numin =3D> I); EE(I) :=3D Normal_Vector_I_Coefficients.NumberExchange(= Numin =3D> I); -- Q :=3D E(I); -- statistical data collection -- I_Num(Q):= =3D I_Num(Q)+1; -- these numbers tested ok for randomness END LOOP; X :=3D = 0; FOR J IN 1 .. iterances LOOP FOR I IN REVERSE X+1 .. X+increment LOOP X:= =3DX+1; EE(X) :=3D E(I); -- Ada.Text_IO.New_Line;-- -- Ada.Integer_Text_IO.= Put(Item =3D> E(X), Width =3D> 8);-- -- Ada.Integer_Text_IO.Put(Item =3D> E= E(X), Width =3D> 8);-- END LOOP; -- Ada.Text_IO.New_Line;-- END LOOP; -- Ad= a.Integer_Text_IO.Get(Item =3D> View); -- halts program to allow view.-- EN= D Load_n_Scramble_Normal_Vector_I_Coefficients; ---------------------------= --------- ------------------------------------------ Thanks in anticipation= of your help, Austin O'Byrne - adacrypr Forgot to include these scrambling parameters, Increment : CONSTANT Integer :=3D 20; Iterances : CONSTANT Integer :=3D 50; -- Normals scrambling -- Increment * Iterances <=3D 1000. -- specifies the scope of the scrambl= ing=20 data. Austin