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.97.39 with SMTP id dx7mr10106746pab.29.1417710695044; Thu, 04 Dec 2014 08:31:35 -0800 (PST) X-Received: by 10.140.49.35 with SMTP id p32mr15420qga.38.1417710694990; Thu, 04 Dec 2014 08:31:34 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!peer03.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!h15no4449978igd.0!news-out.google.com!n9ni15qai.0!nntp.google.com!s7no4101133qap.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Thu, 4 Dec 2014 08:31:34 -0800 (PST) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=86.191.168.97; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 86.191.168.97 References: <16bc91a8-7d25-4b39-a88c-3423e5bdecf4@googlegroups.com> <587e236f-123f-4897-b73e-264082a62806@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <6df6f1d7-2cac-491f-8515-7c7241519f51@googlegroups.com> Subject: Re: The enormous potential that programming LaTeX in Ada presents. From: Austin Obyrne Injection-Date: Thu, 04 Dec 2014 16:31:35 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Received-Bytes: 7734 X-Received-Body-CRC: 1993680676 Xref: news.eternal-september.org comp.lang.ada:23864 Date: 2014-12-04T08:31:34-08:00 List-Id: On Thursday, December 4, 2014 3:25:46 PM UTC, Simon Wright wrote: > Austin Obyrne writes: >=20 > > Current cryptography is capable of encrypting ASCII and at most the > > entire Latin-1 set. >=20 > Looking back on Google I see that on 16 December 2013 I posted=20 > https://groups.google.com/d/msg/comp.lang.ada/qJ5vpRQarSQ/QNvyYgYVjewJ > which I've copied below. >=20 > So a year ago I demonstrated that >=20 > - minor tweaks will enable your code to: >=20 > - deal with data on Windows and Unix systems and to transfer data > between them, and >=20 > - deal with binary data, >=20 > - but the cipertext is >30 times the size of the original (because you > encode each byte of the input as 3 integers, represented as text). >=20 > These are practical matters and have nothing to do with the validity of > the encryption technology. >=20 > =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D > Austin Obyrne writes:=20 >=20 > > The transition of this crypto from Windows to Mac is quite something=20 > > and to my limited experience is a formidable task.=20 >=20 > No.=20 >=20 > I've put extensions at [1]; the README.txt says=20 >=20 > ------------------------------------------------------------------------= =20 > The files here are intended to work with the SureCrypt software from=20 > http://www.adacryptpages.com. They are written against version 85610,=20 > and are relatively minor modifications of that software, so the=20 > copyright status remains that of the original (Copyright =A9 2003 Austin= =20 > O'Byrne).=20 >=20 > There are two new programs: encrypt and decrypt.=20 >=20 > Encrypt usage:=20 >=20 > encrypt original-plaintext ciphertext=20 >=20 > Decrypt usage:=20 >=20 > decrypt ciphertext decrypted-plaintext=20 >=20 > Note that in spite of the use of the word "text" above the programs=20 > will work with binary data.=20 >=20 > The programs will work on Unix and Windows systems. Data encrypted on=20 > one can be decrypted on the other if required.=20 >=20 > Using a recent GNAT compiler, the programs can be built using the=20 > supplied cipher.gpr:=20 >=20 > gnatmake -p -P cipher=20 >=20 > Simon Wright=20 > si...@pushface.org=20 > December 2013=20 > ------------------------------------------------------------------------= =20 >=20 > From the software point of view, note that on Linux (which has a=20 > case-sensitive file system) you should use lower case for Ada source=20 > file names, so that, for example, Alices_Digital_Signature.ads becomes=20 > alices_digital_signature.ads.=20 >=20 > From the practical point of view, I think that the size of the encrypted= =20 > files will be a serious issue. With the current code, they come out=20 > *more* *than* *30* *times* the size of the original, so that the=20 > encrypted SureCrypt85610.zip comes out at about 870 megabytes. Even if=20 > you output the encrypted data in binary the multiplier will be 12 (each= =20 > byte of the original is encrypted as 3 integers).=20 >=20 > [1] https://www.dropbox.com/sh/a84i0jb8jv48nev/Q143ubNUWC=20 > =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Hi Simon, Thanks for that really useful feedback. Can I say that everything to date with my cryptography (and there has been = much refinement in the meantime) should be seen as exploratory - My dogma i= s that when the core mathematical algorithm is irreversibly intractable onl= y then will I entertain any studies or listen to any criticism of the manag= ement. I accept that there is much room for criticism and improvement but = that does not bother me - there are millions of people out there who have t= he wherewithal to hone a rough diamond that my ciphers are into a super dup= er one. I contend my forte is in writing (a few) such ciphers that people like your= self will be able to fine tune them when the mathematics irrefutably show t= hat it is complete. I can reduce that ratio i.e. a ciphertext expansion ra= tio of 26 to 1 (a bit less than you say) to as much as about 10 to 1 quite = easily myself just off the top of my head. The same goes for the efficacy of my Ada-95 programming. I do worry what t= hat looks like to anybody - I have written some procedures that are truly e= legant as problem solving methods but I won't deny that to an Ada specialis= t there must be huge room for improvement. Again I leave that to other exp= erts. In passing, I loathe, hate and , despise what I call 'flash Harry programme= rs who thiink it is smart to confuse people with minimalised source code - = That is why I always iuse Ada.Text_IO when a 'Use' would do the same.=20 *Apart from the defunct One-Time pad cipher there is no unbreakable cipher = in the world today - not RSA not AES they are only what is called "Practica= lly unbreakable" and may be blown away if Quantum Computing ever materialis= es - My stuff is a *world first in the ultimate class of "theoretically Unb= reakable" cryptographic strength. I can demonstrate three ciphers in this = highest class class and NB one of them has the optimum ciphertext expansion= ratio of about 6 to 1 - it is not a problem. Much is made of the peripheral management aspect of my crypto by disgruntle= d readers who say it is not coming in the box that are used to but let me p= ut this challenge to anybody out there. Accept that the ultimate strength of any cipher depends on the core algorit= hm and that any management defects can be marked *proved but repairable the= n fast track to the frontier with your operand and ignoring the warts 'n al= l of the cipher management (which cuts no ice really)show how your encrypti= on of a number into another number is done in a way that is selectively rev= ersible by only two people on this planet. Go for it mate - you would eat your computer before you get as far as I hav= e. adacrypt,