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.68.202.69 with SMTP id kg5mr14173841pbc.2.1387342651251; Tue, 17 Dec 2013 20:57:31 -0800 (PST) X-Received: by 10.182.183.74 with SMTP id ek10mr61349obc.21.1387342651035; Tue, 17 Dec 2013 20:57:31 -0800 (PST) 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!news.linkpendium.com!news.linkpendium.com!news.snarked.org!newsfeed.news.ucla.edu!usenet.stanford.edu!y3no9278430pbx.0!news-out.google.com!l9ni1346qay.0!nntp.google.com!ie8no21468546qab.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Tue, 17 Dec 2013 20:57:30 -0800 (PST) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=86.171.156.104; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 86.171.156.104 References: <1d445f04-b670-444f-9858-55da271fe17a@googlegroups.com> <6d347aed-dce2-4b55-9e35-603f18f06fcb@googlegroups.com> <4f214ca7-871b-4529-b404-caebd1655051@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <54ab4426-40bb-418f-9b5a-bbc2a5499c88@googlegroups.com> Subject: Re: Will Ada-95 Programs Written in MS Windows Run in MacOS and Linux Without Some Tweaking. From: Austin Obyrne Injection-Date: Wed, 18 Dec 2013 04:57:31 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:18054 Date: 2013-12-17T20:57:30-08:00 List-Id: On Monday, December 16, 2013 9:19:15 PM UTC, Simon Wright wrote: > Austin Obyrne writes: > I am the first to adm= it that this cryptography has very high > ciphertext expansion but I cannot= understand it being 870 Megabytes > for the example you gave. I have no do= ubt you are right. Each character is written as 3 integers, each occupying = 11 characters. I've put a new line between every group of 3 integers, where= as you put a new line where there's a new line in the original (I think; an= yway, not a good idea when the input isn't text), =3D> 34 characters per by= te (35 on Windows). 34 * 27_014_786 =3D 918_502_724 (875 MB). > Most of wha= t you say is technically beyond my ken also but its is very > encouraging t= hat you have not decided to condemn it out of hand as a > lost cause like f= or instance the current complexity-theoretic crypto > that is headed for th= e scrap heap. My interest is in helping people to get code working right, n= ot in cryptography; I'd probably use GPG if I needed to. It seems to me tha= t yours is a symmetric-key scheme (I can't read the documentation on your s= ite because you've packaged up multiple PDF files in one, which is a featur= e that's not supported by Mac Preview, and I'm not going to install Acrobat= ). < Each character is written as 3 integers, each occupying 11 characters An integer occupying 11 characters like say 21474836470 would not be possib= le on a 32-bit Windows computer where the largest positive integer is 21474= 83647 and it would cause a "Constraint Error" to appear due to integer ove= rflow. Am I reading you right? Austin.