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.43.84.198 with SMTP id al6mr6972018icc.34.1418750237764; Tue, 16 Dec 2014 09:17:17 -0800 (PST) X-Received: by 10.140.98.133 with SMTP id o5mr17249qge.39.1418750237715; Tue, 16 Dec 2014 09:17:17 -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!news.glorb.com!h15no23166432igd.0!news-out.google.com!r1ni57qat.1!nntp.google.com!s7no8104702qap.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Tue, 16 Dec 2014 09:17:17 -0800 (PST) In-Reply-To: <87vblc7mwh.fsf@ixod.org> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=5.80.153.30; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 5.80.153.30 References: <1a2fea61-bcc1-43a9-b6e3-edf474308402@googlegroups.com> <5d31987b-b96b-481b-ac4d-f87114257bb4@googlegroups.com> <87vblc7mwh.fsf@ixod.org> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Ada Connections to this Crypto. From: Austin Obyrne Injection-Date: Tue, 16 Dec 2014 17:17:17 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:24050 Date: 2014-12-16T09:17:17-08:00 List-Id: On Monday, December 15, 2014 7:06:56 PM UTC, Mark Carroll wrote: > Austin Obyrne writes: >=20 > > The bottom line has to be "Where are the ciphers that all these clever = readers have written? - there blowing in their own wind can be the only ans= wer - there's pedantry, politics and petulance, vicious personal attacks bu= t no ciphers" > > A bit like the golfer who has a lovely set of clubs, polishes the bag = , cleans and polishes his shoes, buys some snazzy outfits with a white cap,= knows the rules of the game inside out panders to club politics with lots = of 'me too' stuff but never hits a ball. >=20 > Not really. I would have loved to developed worthwhile ciphers. In some > of my master's program work I developed software for generating and > assessing block ciphers; only last year I worked on an idea for > automating differential cryptanalysis to assist in my ideas for creating > ciphers. (It failed miserably.) I am /not/ offering cipher designs > because I have read enough and learned enough and tried enough to have > found that I am simply not good enough at it: that other people in the > field are far more skilled than I am, and that I still don't understand > the theory well enough to devise ciphers and provide credible assurance > of their security. >=20 > I'm not like a golfer who panders to club politics, I'm like a golfer > who likes the game but after a lot of trying and even two rounds of > classes still can't even hit the ball reliably and realizes that his > efforts are best applied elsewhere. I wouldn't have responded to you at > all had you not been persistently filling an Ada group -- something I > /am/ interested in reading about -- with your peculiar assertions and > misapprehensions, which I've made a good-faith constructive effort to > help you move past. >=20 > -- Mark Further to my earlier post - herewith a cipher that was prompted by a chanc= e remark in a popular hand book - it took me three years before I was satis= fied with the mathematics - the cipher algorithm harks back to the famous V= igenere Cipher of some 500 years ago - a more expanded description with cop= ious explanatory pdf diagrams is available on http;//www.adacryptpages.com adacrypt Scalable Key Cipher.=20 Copyright =A9 2009 Austin O'Byrne. Last modified october 2013. The encryption model is,=20 [(Plaintext + X) + (Key +X)] mod N =3D residue >=3D 0 (N divides at least once but must divide once) =3D> [ (Plaintext + X) + (Key +X)] =3D N + residue mod N >=3D 0 All of these variables are keys in his cipher =3D> they must be validated t= herefore for a particular scope according to a table of values. The elements of the table are positive integers. The bounds of this table o= f values are also tertiary key material - the bounds are arbitrarily set by= the entities exchanging two suitable positive integers. Suitable meaning = positive integers that have a differential in excess of say of 100. The en= tities may also stipulate a message length scope. Key-making process. The keys are named: Plaintext (a numerical variable name) Key (a numerical value) X ( a constant value key) N ( a modulus - a variable integer value) Residue (instantaneous fall-out residue mod N) n =3D an arbitrary scalar multiplier The Table (bounds 700 ... 850). PlainText Key --------------------------------- 700 700 701 701 ___ ___ ___ ___=20 849 849 850 850=20 -----------------------------------=20 The table comprises two identical sets of positive integer elements in the = range 700 to 850 (in this demonstration) those numbers being the nominated = bounds of 700 and 850. Every element in the RH column is paired with every = element in the LH column 'Plaintext' is drawn from Alice's encryption alphabet which is a subset of = the table. 'Key' is drawn from the entire table at any moment.=20 Nomenclature: Largest valued element is called HI_NUM. MAX_NUM =3D HI_NUM + 1 Lowest valued element is called LOWEST_NUM=20 N =3D is the instantaneous value of the modulus N M =3D the scope of all anticipated message lengths =3D> max-message-length. n =3D an arbitrary scalar multiplier =20 To enable N to divide every possible pairing of the elements they must each= be incremented by an amount X so the table becomes, Plaintext + X Key + X=20 -------------------------- 700 + X 700 + X 701 + X 701 + X _______ _______ _______ _______=20 849 + X 849 + X 850 + X 850 + X -------------------------- To find X :- One pass of the encryption loop by the loop counter N will lea= d to X. Consider N as the counter of the eventual encryption loop being constrained= to just one pass here. For N in (X + MAX_NUM) ... 2 (X + LOWEST_NUM) Loop -- one only N =3D> 2X + 2.LOWEST_NUM - (X + MAX_NUM) =3D 0 (0 =3D> 1 incl.) X + 2 .LOWEST_NUM - MAX_NUM =3D 0 X =3D MAX_NUM - 2.LOWEST_NUM=20 =3D> X =3D 851 - 2x700 =3D 851 -1400 =3D - 549 This is the 'identity' X (a coined name) for this particular table (<=3D N = =3D 1)=20 To Find the bounds of 'N'. X is incremented by the max message-length. Let M =3D 50000 be the max-message-length Then, the loop program array bounds emanate from N in the counter, For N in (X + 50000 + Max_NUM) ... 2 (LOWEST_NUM + X + M) Loop checking, 2 (LOWEST_NUM + X + M) - (X + 50000 + Max_NUM) =3D 50000 ? 2(700 - 549 +50000) - (-549 +50000 + 851) 1400 - 1098 +100000 + 549 -50000 -851 =3D 50000 (this is correct obviously) Encryption: Ciphertext =3D residue + n. N Decryption: Plaintext =3D Ciphertext - (n-1) . N - Key - 2X The ciphertext is contrived to be a large integer of about 6 to 8 digits - = may be positive or negative but is entirely so in a given case. Cryptanalysis: The ciphertext is secured by the impossibility of an adversary being able t= o correctly partition the integer into the subsets (residue + N) and (n-1.N= ). The partitioning function can only be enabled by the intervention of th= e entities who must supply the keys that enable this to be done. adacrypt