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:a05:660c:205:: with SMTP id y5mr3175337itj.30.1541336267506; Sun, 04 Nov 2018 04:57:47 -0800 (PST) X-Received: by 2002:a9d:3d06:: with SMTP id a6mr391526otc.0.1541336267415; Sun, 04 Nov 2018 04:57:47 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!border1.nntp.ams1.giganews.com!border2.nntp.ams1.giganews.com!nntp.giganews.com!feeder1.cambriumusenet.nl!feed.tweak.nl!209.85.166.215.MISMATCH!z5-v6no2784362ite.0!news-out.google.com!n199-v6ni2807itn.0!nntp.google.com!g188-v6no1447494itg.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Sun, 4 Nov 2018 04:57:47 -0800 (PST) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2a00:23c0:8889:5d00:7805:dddb:7548:8f37; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 2a00:23c0:8889:5d00:7805:dddb:7548:8f37 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <514a0be1-2445-4450-91ad-3ddd38e84032@googlegroups.com> Subject: Problem Cross - Posted fron Sci Crypt Crypto Group From: Austin Obyrne Injection-Date: Sun, 04 Nov 2018 12:57:47 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader02.eternal-september.org comp.lang.ada:54758 Date: 2018-11-04T04:57:47-08:00 List-Id: My invention of scrambling of the cipher text as an invincible way of secur= ing it against cryptanalysis has stalled at file sizes of 30000 plaintext i= tems. This isn't bad but I want to go further. I post here some scrambling extracts from my development work that show tha= t my current programs will work on files up to 30000 items but not on a fil= e of 50000 characters. I cannot find any reason for this happening and I t= hink there may be something in the Ada language that perhaps sets a latent = bound on what I am trying to do.=20 1) File size : 30000 items SliceNum_26 : CONSTANT Integer :=3D 0; --Start point in slice of a cipher= text string in hand =20 StepNum_26 : CONSTANT Integer :=3D 45; -- Upstream placemoves from A to = B in this string =20 RepeatsNum_26: CONSTANT Integer :=3D 2099; -- make repeats of placemoves in= struction =20 -- scrambling device in ''Load_n_Scramble_CipherTexts'' procedure=20 -- (SliceNum_26 + stepNum_26*RepeatsNum_26 <=3D Current number of ciphert= ext items. There are 94491 items of ciphertext in the largest string in hand on this o= ccasion i.e. 31497 vectors that have 31497 x 3 =3D 94491 coefficients My program handles this quite OK - no problem in transposing the elements o= f ciphertext When I try to scramble a larger program as follows however I get a " CONSTR= AINT ERROR " annunciation. 2) File size : 50000 items. SliceNum_26 : CONSTANT Integer :=3D 0; --Start point in slice of the cip= hertext string in hand - StepNum_26 : CONSTANT Integer :=3D 29; --Upstream placemoves from A to B= in this string =20 RepeatsNum_26: CONSTANT Integer :=3D 5179; --repeats of placemoves instruc= tion =20 -- scrambling device in ''Load_n_Scramble_CipherTexts'' procedure=20 -- (SliceNum_26 + stepNum_26*RepeatsNum_26 <=3D Current number of ciphert= ext items. The second program is comprised of 527 repeats of the ASCII set of 95 chara= cters i.e. 50065 characters. Each character is transformed into a displace= ment vector that has 3 coefficients so that there are 50065 x 3 =3D 150195 = coefficients that comprise the ciphertext string for scrambling this second= time. The program will not run and I repeat, I get an error message "CONSTRAINT E= RROR" My problem:- This encryption of what might be a fairly large general office program runs= perfectly in another (different) program where it is not required to scram= ble the ciphertext but crashes when it is asked to do so according to the n= ew scrambling parameters in my desired development(different)scrambling pro= gram i.e. the parameters 29 x 5159 that were OK earlier for scrambling seem= to be too much for it to scramble now when the parameters are 45 x 2099. Question:- What is causing this. I have gone over all of the other coincident possibilities that might cause= a constraint error in the scrambling of this larger program and I cannot s= ee anything that might do it. I am slowly coming to the conclusion that it= must be to do with the number of I_O ( IN - OUT) operations that the scram= bling operation requires. Am I exceeding some latent upper bound in the Ad= a language - alternatively it is unlikely to be computer-related I think ?. My CS knowledge doesn't go far enough to do any analysis or solution and I = would be grateful for more informed help from anybody. *I am using a very old compiler - Gnat 311.p - and a typical home computer = that has Windows 7 operating system, It has a fairly good processor howeve= r. =20 Any help would be appreciated Comment: This does not affect the future of scrambling the ciphertext as a future pl= oy in general cryptography. It just means that in my present case I seem t= o be limited to encrypting plaintext files of 30000 in extent only *i.e. if= I decide to scramble the ciphertext string after encrypting it. Austin O'Byrne