Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #514991 > unrolled thread
| Started by | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| First post | 2021-03-20 14:22 -0700 |
| Last post | 2021-03-25 00:15 +0000 |
| Articles | 20 on this page of 113 — 8 participants |
Back to article view | Back to sci.math
A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 14:22 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:24 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:25 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 14:33 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:39 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 15:18 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 15:23 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 15:34 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 15:42 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 16:03 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-03-20 19:04 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 15:36 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 15:46 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 16:09 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 16:14 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 16:18 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 16:58 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 17:05 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 17:09 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 17:14 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 17:16 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:54 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 17:39 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 18:49 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 19:07 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 23:08 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-21 08:00 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-21 09:08 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-23 22:14 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-24 12:43 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-29 16:48 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-30 11:36 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-30 12:40 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-30 14:29 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-30 22:06 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-30 15:42 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-30 19:43 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-31 15:09 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-30 15:39 -0700
Re: A cipher derived from a rational number. James Waldby <j-waldby@no.no> - 2021-03-31 20:55 +0000
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-31 15:08 -0700
Re: A cipher derived from a rational number. James Waldby <j-waldby@no.no> - 2021-03-31 23:24 +0000
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-31 16:49 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-31 18:32 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-01 06:21 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-01 07:39 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-01 08:04 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-01 16:45 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-01 16:58 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-01 20:45 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-01 21:55 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-01 22:42 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-02 07:23 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-02 08:00 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-02 08:42 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-03 12:05 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-02 15:01 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-02 15:18 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-02 15:32 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-03 05:44 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-03 11:59 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-03 13:56 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-03 14:09 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-03 14:11 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-03 16:50 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-03 17:09 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-03 20:08 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-04-04 05:30 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-04 10:35 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-04-04 14:10 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-04 13:29 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-05 06:27 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-05 08:15 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-04 14:28 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-04-04 18:43 -0400
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-04 14:14 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-07 17:22 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-07 20:32 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-07 21:02 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-07 21:10 -0700
Re: A cipher derived from a rational number. Lee Aecca <deea2@icc2ccne.jp> - 2021-04-08 10:43 +0000
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-08 15:13 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 19:03 -0400
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-08 19:20 -0700
Re: A cipher derived from a rational number. Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-04-09 02:51 +0100
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-08 19:18 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 22:52 -0400
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-04 14:11 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-04-04 16:54 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-31 15:13 -0700
Re: A cipher derived from a rational number. "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-03-24 13:21 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-24 13:25 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-25 14:07 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-25 15:43 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-25 15:51 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-25 20:58 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-03-25 19:32 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-25 17:50 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-03-26 05:09 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-26 07:46 -0700
Re: A cipher derived from a rational number. FromTheRafters <erratic@nomail.afraid.org> - 2021-03-26 11:37 -0400
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-28 19:02 -0700
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-28 19:09 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-25 20:47 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-25 23:29 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-25 23:41 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:27 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 14:43 -0700
Re: A cipher derived from a rational number. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-20 17:31 -0700
Re: A cipher derived from a rational number. James Waldby <j-waldby@no.no> - 2021-03-21 03:06 +0000
Re: A cipher derived from a rational number. James Waldby <j-waldby@no.no> - 2021-03-21 03:08 +0000
Re: A cipher derived from a rational number. djoyce099 <hlauk.h.bogart@gmail.com> - 2021-03-20 20:33 -0700
RE: Re: A cipher derived from a rational number. earle <earle.jones@comcast.net> - 2021-03-25 00:15 +0000
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-03 11:59 -0700 |
| Message-ID | <s4adu9$1cdp$1@gioia.aioe.org> |
| In reply to | #516463 |
On 4/3/2021 5:44 AM, djoyce099 wrote: > On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: >> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: >>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: >>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson >>>>>>> wrote: >>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: >>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: >>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: >>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. >>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. >>>>>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>> constant in the secret >>>>>>>>>>>>>>>>>>>>> key. You should post it there. >>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are >>>>>>>>>>>>>>>>>>> different digits. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. >>>>>>>>>>>>>>>>>>> Take the >>>>>>>>>>>>>>>>>>> convergents of the original rational and use your >>>>>>>>>>>>>>>>>>> initial mapping of >>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. >>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to >>>>>>>>>>>>>>>> 2.xyz where x >>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide >>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that >>>>>>>>>>>>>>> contains the >>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler >>>>>>>>>>>>>>> alert: >>>>>>>>>>>>>> ... >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>> >>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? >>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the >>>>>>>>>>>>> convergents >>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be >>>>>>>>>>>>> rounding or >>>>>>>>>>>>> something. >>>>>>>>>>>>> >>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>> The >>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my >>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program >>>>>>>>>>>>>> showed as >>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>> >>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 >>>>>>>>>>>>>> 20614211 ...] >>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the >>>>>>>>>>>> target rational >>>>>>>>>>>> you need to compare to the number of terms in the cf. >>>>>>>>>>>> I way overdid it in my first post but it was a longer message >>>>>>>>>>>> that was encrypted but >>>>>>>>>>>> probably could have used a much smaller in length rational to >>>>>>>>>>>> get the desired number of >>>>>>>>>>>> of terms in the cf for the number to letter conversion. >>>>>>>>>>>> >>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in >>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. >>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>> 1,3,5,7,9,11,13.. >>>>>>>>>>>> Think of it as using a slide rule where the private key >>>>>>>>>>>> (a string of random letters along with each group number >>>>>>>>>>>> identifiers) is on the fixed portion of the >>>>>>>>>>>> rule and the slider portion has the cipher encrypted message >>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. >>>>>>>>>>>> These two strings are placed side by side and sliding the >>>>>>>>>>>> ciphertext from left to right and aligning each letter >>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. >>>>>>>>>>>> The examples I have previously posted --- >>>>>>>>>>>> A letter is only used once in the left to right scan like the >>>>>>>>>>>> word little the first T in little is used then the >>>>>>>>>>>> scan continues by the decryptor for the second T because this >>>>>>>>>>>> private key string is made up of 49 alpha >>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters >>>>>>>>>>>> and 1-7 group identifiers placed in the odd >>>>>>>>>>>> count positions. Example below where this is easy to decrypt >>>>>>>>>>>> by just this simple method -- >>>>>>>>>>>> >>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>> Fixed private >>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>> >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key >>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of >>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) >>>>>>>>>>>> and scanning ----> again for the correct letter alignment to >>>>>>>>>>>> be cherry-picked from the private key. >>>>>>>>>>>> This is giving the whole cipher idea away but the order of the >>>>>>>>>>>> characters in the private key can be drastically >>>>>>>>>>>> changed along with the group identifiers then the public key >>>>>>>>>>>> would be useless to the person without the new private string. >>>>>>>>>>>> In a completed scan (end of too the right ------>), there >>>>>>>>>>>> could be several stops for letter alignments. >>>>>>>>>>>> I am just using this analogy of sliding but the right parsing >>>>>>>>>>>> of strings in both algorithms would get the job done. >>>>>>>>>>>> The above decryption of the public key above is easy if you >>>>>>>>>>>> follow the rules. >>>>>>>>>>>> This is just what I can remember from these old algorithms I >>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s >>>>>>>>>>>> that worked great for encrypting and decrypting these numbers >>>>>>>>>>>> only 1-7 ciphers. >>>>>>>>>>>> Just trying to transfer these thoughts into Python but not >>>>>>>>>>>> getting anywhere yet. >>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? >>>>>>>>>>> Or found any flaws in the concept? >>>>>>>>>> Adding a level of security to any public key cipher of the above >>>>>>>>>> nature the group identifiers could be changed >>>>>>>>>> to a different identifier position after each message sent. >>>>>>>>>> This way no patterns of odd position numbers can be detected >>>>>>>>>> even though some >>>>>>>>>> identifiers sometimes are used in succession breaking any >>>>>>>>>> pattern possible with future cipher messages. >>>>>>>>>> >>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>> Then said, solve this cipher, what is the hidden written message >>>>>>>>>> these numbers represent? >>>>>>>>>> Duh, This is more powerful than even the German enigma machine. >>>>>>>>>> This is because the public key encoded numeric message can be >>>>>>>>>> any length but the >>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers >>>>>>>>>> randomly located and the 49 Alpha characters. >>>>>>>>>> In other words, I would die with this secret. ;-) >>>>>>>>> >>>>>>>>> That was stupid of me, The above cipher can be solved by anyone >>>>>>>>> knowing the rules and the private >>>>>>>>> key already revealed. >>>>>>>>> >>>>>>>> Also, if you are going to develop a cipher out of this, you need >>>>>>>> to make >>>>>>>> sure that every encryption generates a radically different >>>>>>>> ciphertext, >>>>>>>> even for the exact same plaintext. So encrypting the same plaintext >>>>>>>> several times in a row would produce very different ciphertexts. >>>>>>> Yes this is true, but because only 7 digits are used to pick an >>>>>>> alpha character of 26 possibilities >>>>>>> only the order of these 7 group identifiers is changed after each >>>>>>> message >>>>>>> The different combinations are 7! . A lot of messages (5048). >>>>>>> Changed randomly. This way no letter connections >>>>>>> other than a few out of 7 letters in a few groups after a few >>>>>>> messages are sent but then complete contradictory results >>>>>>> pointing to a letter involved with one particular identifier group >>>>>>> of 7 letters. >>>>>>> A bunch of test ciphertext would have to be processed to prove this >>>>>>> point. >>>>>>> The order right now of these group identifiers in this one example >>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in >>>>>>> odd positions in the private key alpha string --- >>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) >>>>>>> chosen from a random table of these possibilities. >>>>>>> So only a 7 number change is necessary and once in a while change >>>>>>> the random order (predetermined in a certain >>>>>>> order of vowels and consonance strategically located in all the >>>>>>> private string (groups of 7) should do the trick.. >>>>>>> Did you solve the cipher yet? >>>>>>> I gave plenty of info by using the slide rule method and the actual >>>>>>> private key and ciphertext associated with it. >>>>>> >>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections >>>>>> you are supposed to solve against the private >>>>>> alpha key. >>>>>> When aligning an odd positioned group identifier from the public key >>>>>> it can only draw one letter from that group >>>>>> in the private key string. This is because the left to right >>>>>> movement to align the identifier can't go back to the left >>>>>> or stay in the same position on that identifier to choose the first >>>>>> but not the second letter within the same group. >>>>>> So here is the corrected ciphertext with 4 corrections -- >>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 >>>>>> It will be self-explanatory when you solve the cipher. >>>>>> >>>>> I am busy right now, but please post it over on sci.crypt. >>>>> >>>>> Using the same exact secret key, and encrypting the plaintext several >>>>> times in a row should create different ciphertexts. Here is a crude >>>>> example I made of my highly experimental fractal based encryption >>>>> algorihtm. This funny fractal thing is radically different than my HMAC >>>>> cipher. Anyway... >>>>> >>>>> Here are several ciphertexts that decrypt to the same exact plaintext >>>>> using the default secret key using the following online program of mine: >>>>> >>>>> http://funwithfractals.atspace.cc/ffe >>>>> >>>>> The plaintext is: Hello World. >>>>> >>>>> 12 bytes >>>>> >>>>> >>>>> ciphertext 0 >>>>> ______________________________ >>>>> >>>>> 0.07464055294813914 0.21413369654338263 >>>>> 0.18726842930653814 0.15381457747419044 >>>>> >>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>> >>>>> ______________________________ >>>>> >>>>> >>>>> ciphertext 1 >>>>> ______________________________ >>>>> >>>>> 0.10712703156460045 0.3825663517793289 >>>>> 0.3822450385558595 0.18493372431673 >>>>> >>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>> >>>>> ______________________________ >>>>> >>>>> >>>>> ciphertext 2 >>>>> ______________________________ >>>>> >>>>> 0.4562359936711957 0.21850028449704323 >>>>> 0.3486656373192471 0.3596603216576378 >>>>> >>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>> >>>>> ______________________________ >>>>> >>>>> >>>>> >>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher >>>>> Text box and click the Decrypt button. Better to use a desktop for the >>>>> crude layout. >>>>> >>>>> >>>>> This is using something called an IV. However, my HMAC cipher actually >>>>> encrypts the random iv into the ciphertext itself. So, its not sent in >>>>> the clear. Read all of: >>>>> >>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>> >>>>> Also, read all of: >>>>> >>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>> >>>>> >>>>> Actually, try clicking Encrypt multiple times and take a look at what >>>>> happens to the ciphertext. >>>> >>>> Chris, >>>> It appears to create a few more encrypted 2 character codes than the >>>> actual number of alpha characters >>>> in the plaintext in a one-for-one matchup. >>> >>> My highly experimental FFE cipher creates a ciphertext hexbyte for each >>> plaintext character. Can you show me an example plaintext where it >>> creates more? This is different than my HMAC cipher that can extend the >>> ciphertext and make it larger than the plaintext via using TRNG random >>> bytes in the plaintext before encrypting. read all: >>> http://funwithfractals.atspace.cc/ct_cipher >>> >>> Now, back to my FFE. So, encrypting Hello using the default key can be: >>> _______________________ >>> 0.12934470968540027 0.025161836871791087 >>> 0.03337929216249355 0.11671759502753765 >>> >>> FF 19 E6 62 D5 >>> _______________________ >>> >>> 5 Hexbytes FF 19 E6 62 D5. >>> >>> If you can give me a plaintext that creates more than hexbytes than the >>> number of characters in the plaintext, please show me! >>> >>>> Interesting what is going on there. >>>> Also, what are the number of mathematical possibilities of creating >>>> these 2 unique character codes of a mix >>>> of alpha-numeric or just alpha, or just numeric to give a final >>>> total of possibilities? >>>> Is it 26! *10! ? Probably not that big. >>> >>> I am not sure. It depends on how many different secret keys one can make >>> and how many possibilities of getting the same exact random IV.[...] >> >> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 >> D5, it would be 5 16-bit numbers. So, the probability would be the >> chances of rolling 5 16 sided die and getting a result X. Okay, now how >> many times do we need to roll to get X again? Each roll would be a click >> of the Encrypt button for the same plaintext and secret key. Yes, the >> secret key comes into play. Because FF 19 E6 62 D5 does not work with >> another secret key that was not used to create it. > > One big question? > A possible scenario -- > Joe the encryptor has his own offline encryption algorithm in a computer. > He copies the encrypted message on a thumb drive and loads it into his > online computer and sends the encrypted message to his foreign opertive > Alice. > Is some other info coming along with that encrypted message? > There could be something berried in the encrypted hex code? > My big question is, has this been tried on two separate offline > systems? > If this was all done on one system, I was snookered if not then this is > fantastic. > On the encryption side algorithm --- plaintext read in. > On the decryption side hex coding -- read in. > Two separate systems. > A Huge advantage if both algorithms are on one system to > pull a fast one. > Or a possibility much more data is coming across than just the encrypted message? > > Just my take an opinion. > Not accusing you of anything because you have much more talent than I on fractals > and the whole structure of the two, I hope, separate systems.(encryption,decryption) > The question needs to be asked. > > Whatever just keep producing these great renderings which I find fascinating. > Also what you produced here, even if it was only on one system. It will work on different systems, online or offline. The full code is on the webpage. So, Bob can be using his own system, and browser of choice. Alice can decrypt it using her own system, and browser of choice. The code is all client side.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-03 13:56 -0700 |
| Message-ID | <657dfe3f-5060-4a57-87e5-aa6fa160493en@googlegroups.com> |
| In reply to | #516505 |
On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: > On 4/3/2021 5:44 AM, djoyce099 wrote: > > On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: > >> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > >>> On 4/2/2021 3:01 PM, djoyce099 wrote: > >>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: > >>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > >>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: > >>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson > >>>>>>> wrote: > >>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > >>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: > >>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: > >>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: > >>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > >>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > >>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. > >>>>>>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > >>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: > >>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > >>>>>>>>>>>>>>>>>>>>> constant in the secret > >>>>>>>>>>>>>>>>>>>>> key. You should post it there. > >>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > >>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > >>>>>>>>>>>>>>>>>>> different digits. > >>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. > >>>>>>>>>>>>>>>>>>> Take the > >>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > >>>>>>>>>>>>>>>>>>> initial mapping of > >>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. > >>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > >>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to > >>>>>>>>>>>>>>>> 2.xyz where x > >>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide > >>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that > >>>>>>>>>>>>>>> contains the > >>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler > >>>>>>>>>>>>>>> alert: > >>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> //// > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> [8; 5 12 12 15] > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> The plaintext is: hello > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> ;^) > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? > >>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the > >>>>>>>>>>>>> convergents > >>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > >>>>>>>>>>>>> rounding or > >>>>>>>>>>>>> something. > >>>>>>>>>>>>> > >>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > >>>>>>>>>>>>>> The > >>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my > >>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program > >>>>>>>>>>>>>> showed as > >>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 > >>>>>>>>>>>>>> 20614211 ...] > >>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the > >>>>>>>>>>>> target rational > >>>>>>>>>>>> you need to compare to the number of terms in the cf. > >>>>>>>>>>>> I way overdid it in my first post but it was a longer message > >>>>>>>>>>>> that was encrypted but > >>>>>>>>>>>> probably could have used a much smaller in length rational to > >>>>>>>>>>>> get the desired number of > >>>>>>>>>>>> of terms in the cf for the number to letter conversion. > >>>>>>>>>>>> > >>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in > >>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. > >>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > >>>>>>>>>>>> 1,3,5,7,9,11,13.. > >>>>>>>>>>>> Think of it as using a slide rule where the private key > >>>>>>>>>>>> (a string of random letters along with each group number > >>>>>>>>>>>> identifiers) is on the fixed portion of the > >>>>>>>>>>>> rule and the slider portion has the cipher encrypted message > >>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. > >>>>>>>>>>>> These two strings are placed side by side and sliding the > >>>>>>>>>>>> ciphertext from left to right and aligning each letter > >>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. > >>>>>>>>>>>> The examples I have previously posted --- > >>>>>>>>>>>> A letter is only used once in the left to right scan like the > >>>>>>>>>>>> word little the first T in little is used then the > >>>>>>>>>>>> scan continues by the decryptor for the second T because this > >>>>>>>>>>>> private key string is made up of 49 alpha > >>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters > >>>>>>>>>>>> and 1-7 group identifiers placed in the odd > >>>>>>>>>>>> count positions. Example below where this is easy to decrypt > >>>>>>>>>>>> by just this simple method -- > >>>>>>>>>>>> > >>>>>>>>>>>> ----------------------------------------------------------------------------------------- > >>>>>>>>>>>> Fixed private > >>>>>>>>>>>> key--------------------------------------------------------- > >>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > >>>>>>>>>>>> > >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key > >>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of > >>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) > >>>>>>>>>>>> and scanning ----> again for the correct letter alignment to > >>>>>>>>>>>> be cherry-picked from the private key. > >>>>>>>>>>>> This is giving the whole cipher idea away but the order of the > >>>>>>>>>>>> characters in the private key can be drastically > >>>>>>>>>>>> changed along with the group identifiers then the public key > >>>>>>>>>>>> would be useless to the person without the new private string. > >>>>>>>>>>>> In a completed scan (end of too the right ------>), there > >>>>>>>>>>>> could be several stops for letter alignments. > >>>>>>>>>>>> I am just using this analogy of sliding but the right parsing > >>>>>>>>>>>> of strings in both algorithms would get the job done. > >>>>>>>>>>>> The above decryption of the public key above is easy if you > >>>>>>>>>>>> follow the rules. > >>>>>>>>>>>> This is just what I can remember from these old algorithms I > >>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s > >>>>>>>>>>>> that worked great for encrypting and decrypting these numbers > >>>>>>>>>>>> only 1-7 ciphers. > >>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > >>>>>>>>>>>> getting anywhere yet. > >>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? > >>>>>>>>>>> Or found any flaws in the concept? > >>>>>>>>>> Adding a level of security to any public key cipher of the above > >>>>>>>>>> nature the group identifiers could be changed > >>>>>>>>>> to a different identifier position after each message sent. > >>>>>>>>>> This way no patterns of odd position numbers can be detected > >>>>>>>>>> even though some > >>>>>>>>>> identifiers sometimes are used in succession breaking any > >>>>>>>>>> pattern possible with future cipher messages. > >>>>>>>>>> > >>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > >>>>>>>>>> Okay, Just say I presented the public key --- > >>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>> Then said, solve this cipher, what is the hidden written message > >>>>>>>>>> these numbers represent? > >>>>>>>>>> Duh, This is more powerful than even the German enigma machine. > >>>>>>>>>> This is because the public key encoded numeric message can be > >>>>>>>>>> any length but the > >>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers > >>>>>>>>>> randomly located and the 49 Alpha characters. > >>>>>>>>>> In other words, I would die with this secret. ;-) > >>>>>>>>> > >>>>>>>>> That was stupid of me, The above cipher can be solved by anyone > >>>>>>>>> knowing the rules and the private > >>>>>>>>> key already revealed. > >>>>>>>>> > >>>>>>>> Also, if you are going to develop a cipher out of this, you need > >>>>>>>> to make > >>>>>>>> sure that every encryption generates a radically different > >>>>>>>> ciphertext, > >>>>>>>> even for the exact same plaintext. So encrypting the same plaintext > >>>>>>>> several times in a row would produce very different ciphertexts. > >>>>>>> Yes this is true, but because only 7 digits are used to pick an > >>>>>>> alpha character of 26 possibilities > >>>>>>> only the order of these 7 group identifiers is changed after each > >>>>>>> message > >>>>>>> The different combinations are 7! . A lot of messages (5048). > >>>>>>> Changed randomly. This way no letter connections > >>>>>>> other than a few out of 7 letters in a few groups after a few > >>>>>>> messages are sent but then complete contradictory results > >>>>>>> pointing to a letter involved with one particular identifier group > >>>>>>> of 7 letters. > >>>>>>> A bunch of test ciphertext would have to be processed to prove this > >>>>>>> point. > >>>>>>> The order right now of these group identifiers in this one example > >>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in > >>>>>>> odd positions in the private key alpha string --- > >>>>>>> 1,9,17,25,33,41,49 whose position never changes. > >>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) > >>>>>>> chosen from a random table of these possibilities. > >>>>>>> So only a 7 number change is necessary and once in a while change > >>>>>>> the random order (predetermined in a certain > >>>>>>> order of vowels and consonance strategically located in all the > >>>>>>> private string (groups of 7) should do the trick.. > >>>>>>> Did you solve the cipher yet? > >>>>>>> I gave plenty of info by using the slide rule method and the actual > >>>>>>> private key and ciphertext associated with it. > >>>>>> > >>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections > >>>>>> you are supposed to solve against the private > >>>>>> alpha key. > >>>>>> When aligning an odd positioned group identifier from the public key > >>>>>> it can only draw one letter from that group > >>>>>> in the private key string. This is because the left to right > >>>>>> movement to align the identifier can't go back to the left > >>>>>> or stay in the same position on that identifier to choose the first > >>>>>> but not the second letter within the same group. > >>>>>> So here is the corrected ciphertext with 4 corrections -- > >>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > >>>>>> It will be self-explanatory when you solve the cipher. > >>>>>> > >>>>> I am busy right now, but please post it over on sci.crypt. > >>>>> > >>>>> Using the same exact secret key, and encrypting the plaintext several > >>>>> times in a row should create different ciphertexts. Here is a crude > >>>>> example I made of my highly experimental fractal based encryption > >>>>> algorihtm. This funny fractal thing is radically different than my HMAC > >>>>> cipher. Anyway... > >>>>> > >>>>> Here are several ciphertexts that decrypt to the same exact plaintext > >>>>> using the default secret key using the following online program of mine: > >>>>> > >>>>> http://funwithfractals.atspace.cc/ffe > >>>>> > >>>>> The plaintext is: Hello World. > >>>>> > >>>>> 12 bytes > >>>>> > >>>>> > >>>>> ciphertext 0 > >>>>> ______________________________ > >>>>> > >>>>> 0.07464055294813914 0.21413369654338263 > >>>>> 0.18726842930653814 0.15381457747419044 > >>>>> > >>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > >>>>> > >>>>> ______________________________ > >>>>> > >>>>> > >>>>> ciphertext 1 > >>>>> ______________________________ > >>>>> > >>>>> 0.10712703156460045 0.3825663517793289 > >>>>> 0.3822450385558595 0.18493372431673 > >>>>> > >>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > >>>>> > >>>>> ______________________________ > >>>>> > >>>>> > >>>>> ciphertext 2 > >>>>> ______________________________ > >>>>> > >>>>> 0.4562359936711957 0.21850028449704323 > >>>>> 0.3486656373192471 0.3596603216576378 > >>>>> > >>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > >>>>> > >>>>> ______________________________ > >>>>> > >>>>> > >>>>> > >>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher > >>>>> Text box and click the Decrypt button. Better to use a desktop for the > >>>>> crude layout. > >>>>> > >>>>> > >>>>> This is using something called an IV. However, my HMAC cipher actually > >>>>> encrypts the random iv into the ciphertext itself. So, its not sent in > >>>>> the clear. Read all of: > >>>>> > >>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>> > >>>>> Also, read all of: > >>>>> > >>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > >>>>> > >>>>> > >>>>> Actually, try clicking Encrypt multiple times and take a look at what > >>>>> happens to the ciphertext. > >>>> > >>>> Chris, > >>>> It appears to create a few more encrypted 2 character codes than the > >>>> actual number of alpha characters > >>>> in the plaintext in a one-for-one matchup. > >>> > >>> My highly experimental FFE cipher creates a ciphertext hexbyte for each > >>> plaintext character. Can you show me an example plaintext where it > >>> creates more? This is different than my HMAC cipher that can extend the > >>> ciphertext and make it larger than the plaintext via using TRNG random > >>> bytes in the plaintext before encrypting. read all: > >>> http://funwithfractals.atspace.cc/ct_cipher > >>> > >>> Now, back to my FFE. So, encrypting Hello using the default key can be: > >>> _______________________ > >>> 0.12934470968540027 0.025161836871791087 > >>> 0.03337929216249355 0.11671759502753765 > >>> > >>> FF 19 E6 62 D5 > >>> _______________________ > >>> > >>> 5 Hexbytes FF 19 E6 62 D5. > >>> > >>> If you can give me a plaintext that creates more than hexbytes than the > >>> number of characters in the plaintext, please show me! > >>> > >>>> Interesting what is going on there. > >>>> Also, what are the number of mathematical possibilities of creating > >>>> these 2 unique character codes of a mix > >>>> of alpha-numeric or just alpha, or just numeric to give a final > >>>> total of possibilities? > >>>> Is it 26! *10! ? Probably not that big. > >>> > >>> I am not sure. It depends on how many different secret keys one can make > >>> and how many possibilities of getting the same exact random IV.[...] > >> > >> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 > >> D5, it would be 5 16-bit numbers. So, the probability would be the > >> chances of rolling 5 16 sided die and getting a result X. Okay, now how > >> many times do we need to roll to get X again? Each roll would be a click > >> of the Encrypt button for the same plaintext and secret key. Yes, the > >> secret key comes into play. Because FF 19 E6 62 D5 does not work with > >> another secret key that was not used to create it. > > > > One big question? > > A possible scenario -- > > Joe the encryptor has his own offline encryption algorithm in a computer. > > He copies the encrypted message on a thumb drive and loads it into his > > online computer and sends the encrypted message to his foreign opertive > > Alice. > > Is some other info coming along with that encrypted message? > > There could be something berried in the encrypted hex code? > > My big question is, has this been tried on two separate offline > > systems? > > If this was all done on one system, I was snookered if not then this is > > fantastic. > > On the encryption side algorithm --- plaintext read in. > > On the decryption side hex coding -- read in. > > Two separate systems. > > A Huge advantage if both algorithms are on one system to > > pull a fast one. > > Or a possibility much more data is coming across than just the encrypted message? > > > > Just my take an opinion. > > Not accusing you of anything because you have much more talent than I on fractals > > and the whole structure of the two, I hope, separate systems.(encryption,decryption) > > The question needs to be asked. > > > > Whatever just keep producing these great renderings which I find fascinating. > > Also what you produced here, even if it was only on one system. > It will work on different systems, online or offline. The full code is > on the webpage. So, Bob can be using his own system, and browser of > choice. Alice can decrypt it using her own system, and browser of > choice. The code is all client side. So Alice is the client-side? (decryptor) If so, it makes no sense.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-03 14:09 -0700 |
| Message-ID | <s4alhs$nqu$1@gioia.aioe.org> |
| In reply to | #516519 |
On 4/3/2021 1:56 PM, djoyce099 wrote: > On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: >> On 4/3/2021 5:44 AM, djoyce099 wrote: >>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: >>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: >>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: >>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson >>>>>>>>> wrote: >>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: >>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: >>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: >>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. >>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. >>>>>>>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>>>> constant in the secret >>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are >>>>>>>>>>>>>>>>>>>>> different digits. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. >>>>>>>>>>>>>>>>>>>>> Take the >>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your >>>>>>>>>>>>>>>>>>>>> initial mapping of >>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to >>>>>>>>>>>>>>>>>> 2.xyz where x >>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide >>>>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that >>>>>>>>>>>>>>>>> contains the >>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler >>>>>>>>>>>>>>>>> alert: >>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? >>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the >>>>>>>>>>>>>>> convergents >>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be >>>>>>>>>>>>>>> rounding or >>>>>>>>>>>>>>> something. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>> The >>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my >>>>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program >>>>>>>>>>>>>>>> showed as >>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 >>>>>>>>>>>>>>>> 20614211 ...] >>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the >>>>>>>>>>>>>> target rational >>>>>>>>>>>>>> you need to compare to the number of terms in the cf. >>>>>>>>>>>>>> I way overdid it in my first post but it was a longer message >>>>>>>>>>>>>> that was encrypted but >>>>>>>>>>>>>> probably could have used a much smaller in length rational to >>>>>>>>>>>>>> get the desired number of >>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. >>>>>>>>>>>>>> >>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in >>>>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. >>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>>>> 1,3,5,7,9,11,13.. >>>>>>>>>>>>>> Think of it as using a slide rule where the private key >>>>>>>>>>>>>> (a string of random letters along with each group number >>>>>>>>>>>>>> identifiers) is on the fixed portion of the >>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message >>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. >>>>>>>>>>>>>> These two strings are placed side by side and sliding the >>>>>>>>>>>>>> ciphertext from left to right and aligning each letter >>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. >>>>>>>>>>>>>> The examples I have previously posted --- >>>>>>>>>>>>>> A letter is only used once in the left to right scan like the >>>>>>>>>>>>>> word little the first T in little is used then the >>>>>>>>>>>>>> scan continues by the decryptor for the second T because this >>>>>>>>>>>>>> private key string is made up of 49 alpha >>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters >>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd >>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt >>>>>>>>>>>>>> by just this simple method -- >>>>>>>>>>>>>> >>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>> >>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key >>>>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of >>>>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) >>>>>>>>>>>>>> and scanning ----> again for the correct letter alignment to >>>>>>>>>>>>>> be cherry-picked from the private key. >>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of the >>>>>>>>>>>>>> characters in the private key can be drastically >>>>>>>>>>>>>> changed along with the group identifiers then the public key >>>>>>>>>>>>>> would be useless to the person without the new private string. >>>>>>>>>>>>>> In a completed scan (end of too the right ------>), there >>>>>>>>>>>>>> could be several stops for letter alignments. >>>>>>>>>>>>>> I am just using this analogy of sliding but the right parsing >>>>>>>>>>>>>> of strings in both algorithms would get the job done. >>>>>>>>>>>>>> The above decryption of the public key above is easy if you >>>>>>>>>>>>>> follow the rules. >>>>>>>>>>>>>> This is just what I can remember from these old algorithms I >>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s >>>>>>>>>>>>>> that worked great for encrypting and decrypting these numbers >>>>>>>>>>>>>> only 1-7 ciphers. >>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not >>>>>>>>>>>>>> getting anywhere yet. >>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? >>>>>>>>>>>>> Or found any flaws in the concept? >>>>>>>>>>>> Adding a level of security to any public key cipher of the above >>>>>>>>>>>> nature the group identifiers could be changed >>>>>>>>>>>> to a different identifier position after each message sent. >>>>>>>>>>>> This way no patterns of odd position numbers can be detected >>>>>>>>>>>> even though some >>>>>>>>>>>> identifiers sometimes are used in succession breaking any >>>>>>>>>>>> pattern possible with future cipher messages. >>>>>>>>>>>> >>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>> Then said, solve this cipher, what is the hidden written message >>>>>>>>>>>> these numbers represent? >>>>>>>>>>>> Duh, This is more powerful than even the German enigma machine. >>>>>>>>>>>> This is because the public key encoded numeric message can be >>>>>>>>>>>> any length but the >>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers >>>>>>>>>>>> randomly located and the 49 Alpha characters. >>>>>>>>>>>> In other words, I would die with this secret. ;-) >>>>>>>>>>> >>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone >>>>>>>>>>> knowing the rules and the private >>>>>>>>>>> key already revealed. >>>>>>>>>>> >>>>>>>>>> Also, if you are going to develop a cipher out of this, you need >>>>>>>>>> to make >>>>>>>>>> sure that every encryption generates a radically different >>>>>>>>>> ciphertext, >>>>>>>>>> even for the exact same plaintext. So encrypting the same plaintext >>>>>>>>>> several times in a row would produce very different ciphertexts. >>>>>>>>> Yes this is true, but because only 7 digits are used to pick an >>>>>>>>> alpha character of 26 possibilities >>>>>>>>> only the order of these 7 group identifiers is changed after each >>>>>>>>> message >>>>>>>>> The different combinations are 7! . A lot of messages (5048). >>>>>>>>> Changed randomly. This way no letter connections >>>>>>>>> other than a few out of 7 letters in a few groups after a few >>>>>>>>> messages are sent but then complete contradictory results >>>>>>>>> pointing to a letter involved with one particular identifier group >>>>>>>>> of 7 letters. >>>>>>>>> A bunch of test ciphertext would have to be processed to prove this >>>>>>>>> point. >>>>>>>>> The order right now of these group identifiers in this one example >>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in >>>>>>>>> odd positions in the private key alpha string --- >>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) >>>>>>>>> chosen from a random table of these possibilities. >>>>>>>>> So only a 7 number change is necessary and once in a while change >>>>>>>>> the random order (predetermined in a certain >>>>>>>>> order of vowels and consonance strategically located in all the >>>>>>>>> private string (groups of 7) should do the trick.. >>>>>>>>> Did you solve the cipher yet? >>>>>>>>> I gave plenty of info by using the slide rule method and the actual >>>>>>>>> private key and ciphertext associated with it. >>>>>>>> >>>>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections >>>>>>>> you are supposed to solve against the private >>>>>>>> alpha key. >>>>>>>> When aligning an odd positioned group identifier from the public key >>>>>>>> it can only draw one letter from that group >>>>>>>> in the private key string. This is because the left to right >>>>>>>> movement to align the identifier can't go back to the left >>>>>>>> or stay in the same position on that identifier to choose the first >>>>>>>> but not the second letter within the same group. >>>>>>>> So here is the corrected ciphertext with 4 corrections -- >>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 >>>>>>>> It will be self-explanatory when you solve the cipher. >>>>>>>> >>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>> >>>>>>> Using the same exact secret key, and encrypting the plaintext several >>>>>>> times in a row should create different ciphertexts. Here is a crude >>>>>>> example I made of my highly experimental fractal based encryption >>>>>>> algorihtm. This funny fractal thing is radically different than my HMAC >>>>>>> cipher. Anyway... >>>>>>> >>>>>>> Here are several ciphertexts that decrypt to the same exact plaintext >>>>>>> using the default secret key using the following online program of mine: >>>>>>> >>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>> >>>>>>> The plaintext is: Hello World. >>>>>>> >>>>>>> 12 bytes >>>>>>> >>>>>>> >>>>>>> ciphertext 0 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.07464055294813914 0.21413369654338263 >>>>>>> 0.18726842930653814 0.15381457747419044 >>>>>>> >>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> ciphertext 1 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.10712703156460045 0.3825663517793289 >>>>>>> 0.3822450385558595 0.18493372431673 >>>>>>> >>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> ciphertext 2 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.4562359936711957 0.21850028449704323 >>>>>>> 0.3486656373192471 0.3596603216576378 >>>>>>> >>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> >>>>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher >>>>>>> Text box and click the Decrypt button. Better to use a desktop for the >>>>>>> crude layout. >>>>>>> >>>>>>> >>>>>>> This is using something called an IV. However, my HMAC cipher actually >>>>>>> encrypts the random iv into the ciphertext itself. So, its not sent in >>>>>>> the clear. Read all of: >>>>>>> >>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>> >>>>>>> Also, read all of: >>>>>>> >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>> >>>>>>> >>>>>>> Actually, try clicking Encrypt multiple times and take a look at what >>>>>>> happens to the ciphertext. >>>>>> >>>>>> Chris, >>>>>> It appears to create a few more encrypted 2 character codes than the >>>>>> actual number of alpha characters >>>>>> in the plaintext in a one-for-one matchup. >>>>> >>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for each >>>>> plaintext character. Can you show me an example plaintext where it >>>>> creates more? This is different than my HMAC cipher that can extend the >>>>> ciphertext and make it larger than the plaintext via using TRNG random >>>>> bytes in the plaintext before encrypting. read all: >>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>> >>>>> Now, back to my FFE. So, encrypting Hello using the default key can be: >>>>> _______________________ >>>>> 0.12934470968540027 0.025161836871791087 >>>>> 0.03337929216249355 0.11671759502753765 >>>>> >>>>> FF 19 E6 62 D5 >>>>> _______________________ >>>>> >>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>> >>>>> If you can give me a plaintext that creates more than hexbytes than the >>>>> number of characters in the plaintext, please show me! >>>>> >>>>>> Interesting what is going on there. >>>>>> Also, what are the number of mathematical possibilities of creating >>>>>> these 2 unique character codes of a mix >>>>>> of alpha-numeric or just alpha, or just numeric to give a final >>>>>> total of possibilities? >>>>>> Is it 26! *10! ? Probably not that big. >>>>> >>>>> I am not sure. It depends on how many different secret keys one can make >>>>> and how many possibilities of getting the same exact random IV.[...] >>>> >>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 >>>> D5, it would be 5 16-bit numbers. So, the probability would be the >>>> chances of rolling 5 16 sided die and getting a result X. Okay, now how >>>> many times do we need to roll to get X again? Each roll would be a click >>>> of the Encrypt button for the same plaintext and secret key. Yes, the >>>> secret key comes into play. Because FF 19 E6 62 D5 does not work with >>>> another secret key that was not used to create it. >>> >>> One big question? >>> A possible scenario -- >>> Joe the encryptor has his own offline encryption algorithm in a computer. >>> He copies the encrypted message on a thumb drive and loads it into his >>> online computer and sends the encrypted message to his foreign opertive >>> Alice. >>> Is some other info coming along with that encrypted message? >>> There could be something berried in the encrypted hex code? >>> My big question is, has this been tried on two separate offline >>> systems? >>> If this was all done on one system, I was snookered if not then this is >>> fantastic. >>> On the encryption side algorithm --- plaintext read in. >>> On the decryption side hex coding -- read in. >>> Two separate systems. >>> A Huge advantage if both algorithms are on one system to >>> pull a fast one. >>> Or a possibility much more data is coming across than just the encrypted message? >>> >>> Just my take an opinion. >>> Not accusing you of anything because you have much more talent than I on fractals >>> and the whole structure of the two, I hope, separate systems.(encryption,decryption) >>> The question needs to be asked. >>> >>> Whatever just keep producing these great renderings which I find fascinating. >>> Also what you produced here, even if it was only on one system. >> It will work on different systems, online or offline. The full code is >> on the webpage. So, Bob can be using his own system, and browser of >> choice. Alice can decrypt it using her own system, and browser of >> choice. The code is all client side. > > So Alice is the client-side? (decryptor) > If so, it makes no sense. > > > That does not make sense to me. As long as Alice and Bob are using the same exact secret key, Bob can encrypt a message, print it out on paper and physically mail it to Alice, and she can decrypt it. Using no internet. When I say client side, I simply mean that the code is in JavaScript for all to see. Its 100% client side. There is no server side code like php or anything. You can download the entire page to a computer, turn your internet off, fire up a browser and run it locally. Alice and Bob can use whatever computer they want to. They can use whatever browser they want to. Have you tried to decrypt a ciphertext that I posted yet? Alice and Bob need to have the same secret key. So, Alice can decrypt Bob's messages online and/or offline, and vise versa wrt Bob. You can download the webpage, and use it offline. Try it. Have you taken a look at the code yet?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-03 14:11 -0700 |
| Message-ID | <s4alm7$nqu$2@gioia.aioe.org> |
| In reply to | #516519 |
On 4/3/2021 1:56 PM, djoyce099 wrote: > On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: >> On 4/3/2021 5:44 AM, djoyce099 wrote: >>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: >>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: >>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: >>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson >>>>>>>>> wrote: >>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: >>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: >>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: >>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. >>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. >>>>>>>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>>>> constant in the secret >>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are >>>>>>>>>>>>>>>>>>>>> different digits. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. >>>>>>>>>>>>>>>>>>>>> Take the >>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your >>>>>>>>>>>>>>>>>>>>> initial mapping of >>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. >>>>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to >>>>>>>>>>>>>>>>>> 2.xyz where x >>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide >>>>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that >>>>>>>>>>>>>>>>> contains the >>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler >>>>>>>>>>>>>>>>> alert: >>>>>>>>>>>>>>>> ... >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? >>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the >>>>>>>>>>>>>>> convergents >>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be >>>>>>>>>>>>>>> rounding or >>>>>>>>>>>>>>> something. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>> The >>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my >>>>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program >>>>>>>>>>>>>>>> showed as >>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 >>>>>>>>>>>>>>>> 20614211 ...] >>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the >>>>>>>>>>>>>> target rational >>>>>>>>>>>>>> you need to compare to the number of terms in the cf. >>>>>>>>>>>>>> I way overdid it in my first post but it was a longer message >>>>>>>>>>>>>> that was encrypted but >>>>>>>>>>>>>> probably could have used a much smaller in length rational to >>>>>>>>>>>>>> get the desired number of >>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. >>>>>>>>>>>>>> >>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in >>>>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. >>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>>>> 1,3,5,7,9,11,13.. >>>>>>>>>>>>>> Think of it as using a slide rule where the private key >>>>>>>>>>>>>> (a string of random letters along with each group number >>>>>>>>>>>>>> identifiers) is on the fixed portion of the >>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message >>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. >>>>>>>>>>>>>> These two strings are placed side by side and sliding the >>>>>>>>>>>>>> ciphertext from left to right and aligning each letter >>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. >>>>>>>>>>>>>> The examples I have previously posted --- >>>>>>>>>>>>>> A letter is only used once in the left to right scan like the >>>>>>>>>>>>>> word little the first T in little is used then the >>>>>>>>>>>>>> scan continues by the decryptor for the second T because this >>>>>>>>>>>>>> private key string is made up of 49 alpha >>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters >>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd >>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt >>>>>>>>>>>>>> by just this simple method -- >>>>>>>>>>>>>> >>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>> >>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key >>>>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of >>>>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) >>>>>>>>>>>>>> and scanning ----> again for the correct letter alignment to >>>>>>>>>>>>>> be cherry-picked from the private key. >>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of the >>>>>>>>>>>>>> characters in the private key can be drastically >>>>>>>>>>>>>> changed along with the group identifiers then the public key >>>>>>>>>>>>>> would be useless to the person without the new private string. >>>>>>>>>>>>>> In a completed scan (end of too the right ------>), there >>>>>>>>>>>>>> could be several stops for letter alignments. >>>>>>>>>>>>>> I am just using this analogy of sliding but the right parsing >>>>>>>>>>>>>> of strings in both algorithms would get the job done. >>>>>>>>>>>>>> The above decryption of the public key above is easy if you >>>>>>>>>>>>>> follow the rules. >>>>>>>>>>>>>> This is just what I can remember from these old algorithms I >>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s >>>>>>>>>>>>>> that worked great for encrypting and decrypting these numbers >>>>>>>>>>>>>> only 1-7 ciphers. >>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not >>>>>>>>>>>>>> getting anywhere yet. >>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? >>>>>>>>>>>>> Or found any flaws in the concept? >>>>>>>>>>>> Adding a level of security to any public key cipher of the above >>>>>>>>>>>> nature the group identifiers could be changed >>>>>>>>>>>> to a different identifier position after each message sent. >>>>>>>>>>>> This way no patterns of odd position numbers can be detected >>>>>>>>>>>> even though some >>>>>>>>>>>> identifiers sometimes are used in succession breaking any >>>>>>>>>>>> pattern possible with future cipher messages. >>>>>>>>>>>> >>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>> Then said, solve this cipher, what is the hidden written message >>>>>>>>>>>> these numbers represent? >>>>>>>>>>>> Duh, This is more powerful than even the German enigma machine. >>>>>>>>>>>> This is because the public key encoded numeric message can be >>>>>>>>>>>> any length but the >>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers >>>>>>>>>>>> randomly located and the 49 Alpha characters. >>>>>>>>>>>> In other words, I would die with this secret. ;-) >>>>>>>>>>> >>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone >>>>>>>>>>> knowing the rules and the private >>>>>>>>>>> key already revealed. >>>>>>>>>>> >>>>>>>>>> Also, if you are going to develop a cipher out of this, you need >>>>>>>>>> to make >>>>>>>>>> sure that every encryption generates a radically different >>>>>>>>>> ciphertext, >>>>>>>>>> even for the exact same plaintext. So encrypting the same plaintext >>>>>>>>>> several times in a row would produce very different ciphertexts. >>>>>>>>> Yes this is true, but because only 7 digits are used to pick an >>>>>>>>> alpha character of 26 possibilities >>>>>>>>> only the order of these 7 group identifiers is changed after each >>>>>>>>> message >>>>>>>>> The different combinations are 7! . A lot of messages (5048). >>>>>>>>> Changed randomly. This way no letter connections >>>>>>>>> other than a few out of 7 letters in a few groups after a few >>>>>>>>> messages are sent but then complete contradictory results >>>>>>>>> pointing to a letter involved with one particular identifier group >>>>>>>>> of 7 letters. >>>>>>>>> A bunch of test ciphertext would have to be processed to prove this >>>>>>>>> point. >>>>>>>>> The order right now of these group identifiers in this one example >>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in >>>>>>>>> odd positions in the private key alpha string --- >>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) >>>>>>>>> chosen from a random table of these possibilities. >>>>>>>>> So only a 7 number change is necessary and once in a while change >>>>>>>>> the random order (predetermined in a certain >>>>>>>>> order of vowels and consonance strategically located in all the >>>>>>>>> private string (groups of 7) should do the trick.. >>>>>>>>> Did you solve the cipher yet? >>>>>>>>> I gave plenty of info by using the slide rule method and the actual >>>>>>>>> private key and ciphertext associated with it. >>>>>>>> >>>>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections >>>>>>>> you are supposed to solve against the private >>>>>>>> alpha key. >>>>>>>> When aligning an odd positioned group identifier from the public key >>>>>>>> it can only draw one letter from that group >>>>>>>> in the private key string. This is because the left to right >>>>>>>> movement to align the identifier can't go back to the left >>>>>>>> or stay in the same position on that identifier to choose the first >>>>>>>> but not the second letter within the same group. >>>>>>>> So here is the corrected ciphertext with 4 corrections -- >>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 >>>>>>>> It will be self-explanatory when you solve the cipher. >>>>>>>> >>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>> >>>>>>> Using the same exact secret key, and encrypting the plaintext several >>>>>>> times in a row should create different ciphertexts. Here is a crude >>>>>>> example I made of my highly experimental fractal based encryption >>>>>>> algorihtm. This funny fractal thing is radically different than my HMAC >>>>>>> cipher. Anyway... >>>>>>> >>>>>>> Here are several ciphertexts that decrypt to the same exact plaintext >>>>>>> using the default secret key using the following online program of mine: >>>>>>> >>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>> >>>>>>> The plaintext is: Hello World. >>>>>>> >>>>>>> 12 bytes >>>>>>> >>>>>>> >>>>>>> ciphertext 0 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.07464055294813914 0.21413369654338263 >>>>>>> 0.18726842930653814 0.15381457747419044 >>>>>>> >>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> ciphertext 1 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.10712703156460045 0.3825663517793289 >>>>>>> 0.3822450385558595 0.18493372431673 >>>>>>> >>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> ciphertext 2 >>>>>>> ______________________________ >>>>>>> >>>>>>> 0.4562359936711957 0.21850028449704323 >>>>>>> 0.3486656373192471 0.3596603216576378 >>>>>>> >>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>> >>>>>>> ______________________________ >>>>>>> >>>>>>> >>>>>>> >>>>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher >>>>>>> Text box and click the Decrypt button. Better to use a desktop for the >>>>>>> crude layout. >>>>>>> >>>>>>> >>>>>>> This is using something called an IV. However, my HMAC cipher actually >>>>>>> encrypts the random iv into the ciphertext itself. So, its not sent in >>>>>>> the clear. Read all of: >>>>>>> >>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>> >>>>>>> Also, read all of: >>>>>>> >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>> >>>>>>> >>>>>>> Actually, try clicking Encrypt multiple times and take a look at what >>>>>>> happens to the ciphertext. >>>>>> >>>>>> Chris, >>>>>> It appears to create a few more encrypted 2 character codes than the >>>>>> actual number of alpha characters >>>>>> in the plaintext in a one-for-one matchup. >>>>> >>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for each >>>>> plaintext character. Can you show me an example plaintext where it >>>>> creates more? This is different than my HMAC cipher that can extend the >>>>> ciphertext and make it larger than the plaintext via using TRNG random >>>>> bytes in the plaintext before encrypting. read all: >>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>> >>>>> Now, back to my FFE. So, encrypting Hello using the default key can be: >>>>> _______________________ >>>>> 0.12934470968540027 0.025161836871791087 >>>>> 0.03337929216249355 0.11671759502753765 >>>>> >>>>> FF 19 E6 62 D5 >>>>> _______________________ >>>>> >>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>> >>>>> If you can give me a plaintext that creates more than hexbytes than the >>>>> number of characters in the plaintext, please show me! >>>>> >>>>>> Interesting what is going on there. >>>>>> Also, what are the number of mathematical possibilities of creating >>>>>> these 2 unique character codes of a mix >>>>>> of alpha-numeric or just alpha, or just numeric to give a final >>>>>> total of possibilities? >>>>>> Is it 26! *10! ? Probably not that big. >>>>> >>>>> I am not sure. It depends on how many different secret keys one can make >>>>> and how many possibilities of getting the same exact random IV.[...] >>>> >>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 >>>> D5, it would be 5 16-bit numbers. So, the probability would be the >>>> chances of rolling 5 16 sided die and getting a result X. Okay, now how >>>> many times do we need to roll to get X again? Each roll would be a click >>>> of the Encrypt button for the same plaintext and secret key. Yes, the >>>> secret key comes into play. Because FF 19 E6 62 D5 does not work with >>>> another secret key that was not used to create it. >>> >>> One big question? >>> A possible scenario -- >>> Joe the encryptor has his own offline encryption algorithm in a computer. >>> He copies the encrypted message on a thumb drive and loads it into his >>> online computer and sends the encrypted message to his foreign opertive >>> Alice. >>> Is some other info coming along with that encrypted message? >>> There could be something berried in the encrypted hex code? >>> My big question is, has this been tried on two separate offline >>> systems? >>> If this was all done on one system, I was snookered if not then this is >>> fantastic. >>> On the encryption side algorithm --- plaintext read in. >>> On the decryption side hex coding -- read in. >>> Two separate systems. >>> A Huge advantage if both algorithms are on one system to >>> pull a fast one. >>> Or a possibility much more data is coming across than just the encrypted message? >>> >>> Just my take an opinion. >>> Not accusing you of anything because you have much more talent than I on fractals >>> and the whole structure of the two, I hope, separate systems.(encryption,decryption) >>> The question needs to be asked. >>> >>> Whatever just keep producing these great renderings which I find fascinating. >>> Also what you produced here, even if it was only on one system. >> It will work on different systems, online or offline. The full code is >> on the webpage. So, Bob can be using his own system, and browser of >> choice. Alice can decrypt it using her own system, and browser of >> choice. The code is all client side. > > So Alice is the client-side? (decryptor) > If so, it makes no sense. > > > Try to decrypt this... Just copy-and-paste the ciphertext between the lines into the Cipher Text box in the page, and click the decrypt button. ________________________________ 0.39351870705816516 0.12367086856260284 0.10821656063857987 0.5183020398197964 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C 49 40 AE E2 ________________________________ What does it say?
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-03 16:50 -0700 |
| Message-ID | <201c02f7-86ea-4437-8d77-400d9398b068n@googlegroups.com> |
| In reply to | #516522 |
On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > On 4/3/2021 1:56 PM, djoyce099 wrote: > > On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: > >> On 4/3/2021 5:44 AM, djoyce099 wrote: > >>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: > >>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > >>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > >>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: > >>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > >>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: > >>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson > >>>>>>>>> wrote: > >>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > >>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: > >>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: > >>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: > >>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > >>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > >>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: > >>>>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > >>>>>>>>>>>>>>>>>>>>>>> constant in the secret > >>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. > >>>>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > >>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > >>>>>>>>>>>>>>>>>>>>> different digits. > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. > >>>>>>>>>>>>>>>>>>>>> Take the > >>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > >>>>>>>>>>>>>>>>>>>>> initial mapping of > >>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. > >>>>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > >>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to > >>>>>>>>>>>>>>>>>> 2.xyz where x > >>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide > >>>>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that > >>>>>>>>>>>>>>>>> contains the > >>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler > >>>>>>>>>>>>>>>>> alert: > >>>>>>>>>>>>>>>> ... > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> //// > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> [8; 5 12 12 15] > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> The plaintext is: hello > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> ;^) > >>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? > >>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the > >>>>>>>>>>>>>>> convergents > >>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > >>>>>>>>>>>>>>> rounding or > >>>>>>>>>>>>>>> something. > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > >>>>>>>>>>>>>>>> The > >>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my > >>>>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program > >>>>>>>>>>>>>>>> showed as > >>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > >>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 > >>>>>>>>>>>>>>>> 20614211 ...] > >>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the > >>>>>>>>>>>>>> target rational > >>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > >>>>>>>>>>>>>> I way overdid it in my first post but it was a longer message > >>>>>>>>>>>>>> that was encrypted but > >>>>>>>>>>>>>> probably could have used a much smaller in length rational to > >>>>>>>>>>>>>> get the desired number of > >>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in > >>>>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. > >>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > >>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > >>>>>>>>>>>>>> Think of it as using a slide rule where the private key > >>>>>>>>>>>>>> (a string of random letters along with each group number > >>>>>>>>>>>>>> identifiers) is on the fixed portion of the > >>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message > >>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. > >>>>>>>>>>>>>> These two strings are placed side by side and sliding the > >>>>>>>>>>>>>> ciphertext from left to right and aligning each letter > >>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. > >>>>>>>>>>>>>> The examples I have previously posted --- > >>>>>>>>>>>>>> A letter is only used once in the left to right scan like the > >>>>>>>>>>>>>> word little the first T in little is used then the > >>>>>>>>>>>>>> scan continues by the decryptor for the second T because this > >>>>>>>>>>>>>> private key string is made up of 49 alpha > >>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters > >>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd > >>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt > >>>>>>>>>>>>>> by just this simple method -- > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > >>>>>>>>>>>>>> Fixed private > >>>>>>>>>>>>>> key--------------------------------------------------------- > >>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key > >>>>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of > >>>>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) > >>>>>>>>>>>>>> and scanning ----> again for the correct letter alignment to > >>>>>>>>>>>>>> be cherry-picked from the private key. > >>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of the > >>>>>>>>>>>>>> characters in the private key can be drastically > >>>>>>>>>>>>>> changed along with the group identifiers then the public key > >>>>>>>>>>>>>> would be useless to the person without the new private string. > >>>>>>>>>>>>>> In a completed scan (end of too the right ------>), there > >>>>>>>>>>>>>> could be several stops for letter alignments. > >>>>>>>>>>>>>> I am just using this analogy of sliding but the right parsing > >>>>>>>>>>>>>> of strings in both algorithms would get the job done. > >>>>>>>>>>>>>> The above decryption of the public key above is easy if you > >>>>>>>>>>>>>> follow the rules. > >>>>>>>>>>>>>> This is just what I can remember from these old algorithms I > >>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s > >>>>>>>>>>>>>> that worked great for encrypting and decrypting these numbers > >>>>>>>>>>>>>> only 1-7 ciphers. > >>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > >>>>>>>>>>>>>> getting anywhere yet. > >>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? > >>>>>>>>>>>>> Or found any flaws in the concept? > >>>>>>>>>>>> Adding a level of security to any public key cipher of the above > >>>>>>>>>>>> nature the group identifiers could be changed > >>>>>>>>>>>> to a different identifier position after each message sent. > >>>>>>>>>>>> This way no patterns of odd position numbers can be detected > >>>>>>>>>>>> even though some > >>>>>>>>>>>> identifiers sometimes are used in succession breaking any > >>>>>>>>>>>> pattern possible with future cipher messages. > >>>>>>>>>>>> > >>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > >>>>>>>>>>>> Okay, Just say I presented the public key --- > >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>> Then said, solve this cipher, what is the hidden written message > >>>>>>>>>>>> these numbers represent? > >>>>>>>>>>>> Duh, This is more powerful than even the German enigma machine. > >>>>>>>>>>>> This is because the public key encoded numeric message can be > >>>>>>>>>>>> any length but the > >>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers > >>>>>>>>>>>> randomly located and the 49 Alpha characters. > >>>>>>>>>>>> In other words, I would die with this secret. ;-) > >>>>>>>>>>> > >>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone > >>>>>>>>>>> knowing the rules and the private > >>>>>>>>>>> key already revealed. > >>>>>>>>>>> > >>>>>>>>>> Also, if you are going to develop a cipher out of this, you need > >>>>>>>>>> to make > >>>>>>>>>> sure that every encryption generates a radically different > >>>>>>>>>> ciphertext, > >>>>>>>>>> even for the exact same plaintext. So encrypting the same plaintext > >>>>>>>>>> several times in a row would produce very different ciphertexts. > >>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > >>>>>>>>> alpha character of 26 possibilities > >>>>>>>>> only the order of these 7 group identifiers is changed after each > >>>>>>>>> message > >>>>>>>>> The different combinations are 7! . A lot of messages (5048). > >>>>>>>>> Changed randomly. This way no letter connections > >>>>>>>>> other than a few out of 7 letters in a few groups after a few > >>>>>>>>> messages are sent but then complete contradictory results > >>>>>>>>> pointing to a letter involved with one particular identifier group > >>>>>>>>> of 7 letters. > >>>>>>>>> A bunch of test ciphertext would have to be processed to prove this > >>>>>>>>> point. > >>>>>>>>> The order right now of these group identifiers in this one example > >>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in > >>>>>>>>> odd positions in the private key alpha string --- > >>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > >>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) > >>>>>>>>> chosen from a random table of these possibilities. > >>>>>>>>> So only a 7 number change is necessary and once in a while change > >>>>>>>>> the random order (predetermined in a certain > >>>>>>>>> order of vowels and consonance strategically located in all the > >>>>>>>>> private string (groups of 7) should do the trick.. > >>>>>>>>> Did you solve the cipher yet? > >>>>>>>>> I gave plenty of info by using the slide rule method and the actual > >>>>>>>>> private key and ciphertext associated with it. > >>>>>>>> > >>>>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections > >>>>>>>> you are supposed to solve against the private > >>>>>>>> alpha key. > >>>>>>>> When aligning an odd positioned group identifier from the public key > >>>>>>>> it can only draw one letter from that group > >>>>>>>> in the private key string. This is because the left to right > >>>>>>>> movement to align the identifier can't go back to the left > >>>>>>>> or stay in the same position on that identifier to choose the first > >>>>>>>> but not the second letter within the same group. > >>>>>>>> So here is the corrected ciphertext with 4 corrections -- > >>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > >>>>>>>> It will be self-explanatory when you solve the cipher. > >>>>>>>> > >>>>>>> I am busy right now, but please post it over on sci.crypt. > >>>>>>> > >>>>>>> Using the same exact secret key, and encrypting the plaintext several > >>>>>>> times in a row should create different ciphertexts. Here is a crude > >>>>>>> example I made of my highly experimental fractal based encryption > >>>>>>> algorihtm. This funny fractal thing is radically different than my HMAC > >>>>>>> cipher. Anyway... > >>>>>>> > >>>>>>> Here are several ciphertexts that decrypt to the same exact plaintext > >>>>>>> using the default secret key using the following online program of mine: > >>>>>>> > >>>>>>> http://funwithfractals.atspace.cc/ffe > >>>>>>> > >>>>>>> The plaintext is: Hello World. > >>>>>>> > >>>>>>> 12 bytes > >>>>>>> > >>>>>>> > >>>>>>> ciphertext 0 > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> 0.07464055294813914 0.21413369654338263 > >>>>>>> 0.18726842930653814 0.15381457747419044 > >>>>>>> > >>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > >>>>>>> > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> > >>>>>>> ciphertext 1 > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> 0.10712703156460045 0.3825663517793289 > >>>>>>> 0.3822450385558595 0.18493372431673 > >>>>>>> > >>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > >>>>>>> > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> > >>>>>>> ciphertext 2 > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> 0.4562359936711957 0.21850028449704323 > >>>>>>> 0.3486656373192471 0.3596603216576378 > >>>>>>> > >>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > >>>>>>> > >>>>>>> ______________________________ > >>>>>>> > >>>>>>> > >>>>>>> > >>>>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher > >>>>>>> Text box and click the Decrypt button. Better to use a desktop for the > >>>>>>> crude layout. > >>>>>>> > >>>>>>> > >>>>>>> This is using something called an IV. However, my HMAC cipher actually > >>>>>>> encrypts the random iv into the ciphertext itself. So, its not sent in > >>>>>>> the clear. Read all of: > >>>>>>> > >>>>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>>>> > >>>>>>> Also, read all of: > >>>>>>> > >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > >>>>>>> > >>>>>>> > >>>>>>> Actually, try clicking Encrypt multiple times and take a look at what > >>>>>>> happens to the ciphertext. > >>>>>> > >>>>>> Chris, > >>>>>> It appears to create a few more encrypted 2 character codes than the > >>>>>> actual number of alpha characters > >>>>>> in the plaintext in a one-for-one matchup. > >>>>> > >>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for each > >>>>> plaintext character. Can you show me an example plaintext where it > >>>>> creates more? This is different than my HMAC cipher that can extend the > >>>>> ciphertext and make it larger than the plaintext via using TRNG random > >>>>> bytes in the plaintext before encrypting. read all: > >>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>> > >>>>> Now, back to my FFE. So, encrypting Hello using the default key can be: > >>>>> _______________________ > >>>>> 0.12934470968540027 0.025161836871791087 > >>>>> 0.03337929216249355 0.11671759502753765 > >>>>> > >>>>> FF 19 E6 62 D5 > >>>>> _______________________ > >>>>> > >>>>> 5 Hexbytes FF 19 E6 62 D5. > >>>>> > >>>>> If you can give me a plaintext that creates more than hexbytes than the > >>>>> number of characters in the plaintext, please show me! > >>>>> > >>>>>> Interesting what is going on there. > >>>>>> Also, what are the number of mathematical possibilities of creating > >>>>>> these 2 unique character codes of a mix > >>>>>> of alpha-numeric or just alpha, or just numeric to give a final > >>>>>> total of possibilities? > >>>>>> Is it 26! *10! ? Probably not that big. > >>>>> > >>>>> I am not sure. It depends on how many different secret keys one can make > >>>>> and how many possibilities of getting the same exact random IV.[...] > >>>> > >>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 > >>>> D5, it would be 5 16-bit numbers. So, the probability would be the > >>>> chances of rolling 5 16 sided die and getting a result X. Okay, now how > >>>> many times do we need to roll to get X again? Each roll would be a click > >>>> of the Encrypt button for the same plaintext and secret key. Yes, the > >>>> secret key comes into play. Because FF 19 E6 62 D5 does not work with > >>>> another secret key that was not used to create it. > >>> > >>> One big question? > >>> A possible scenario -- > >>> Joe the encryptor has his own offline encryption algorithm in a computer. > >>> He copies the encrypted message on a thumb drive and loads it into his > >>> online computer and sends the encrypted message to his foreign opertive > >>> Alice. > >>> Is some other info coming along with that encrypted message? > >>> There could be something berried in the encrypted hex code? > >>> My big question is, has this been tried on two separate offline > >>> systems? > >>> If this was all done on one system, I was snookered if not then this is > >>> fantastic. > >>> On the encryption side algorithm --- plaintext read in. > >>> On the decryption side hex coding -- read in. > >>> Two separate systems. > >>> A Huge advantage if both algorithms are on one system to > >>> pull a fast one. > >>> Or a possibility much more data is coming across than just the encrypted message? > >>> > >>> Just my take an opinion. > >>> Not accusing you of anything because you have much more talent than I on fractals > >>> and the whole structure of the two, I hope, separate systems.(encryption,decryption) > >>> The question needs to be asked. > >>> > >>> Whatever just keep producing these great renderings which I find fascinating. > >>> Also what you produced here, even if it was only on one system. > >> It will work on different systems, online or offline. The full code is > >> on the webpage. So, Bob can be using his own system, and browser of > >> choice. Alice can decrypt it using her own system, and browser of > >> choice. The code is all client side. > > > > So Alice is the client-side? (decryptor) > > If so, it makes no sense. > > > > > > > Try to decrypt this... Just copy-and-paste the ciphertext between the > lines into the Cipher Text box in the page, and click the decrypt button. > > ________________________________ > > 0.39351870705816516 0.12367086856260284 > 0.10821656063857987 0.5183020398197964 > > 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > 49 40 AE E2 > > ________________________________ > > > What does it say? It just comes back with the short message "plaintext" I just erased to paste in the hex code above. Do I need to paste the four fractional parts into the lower window also?
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-03 17:09 -0700 |
| Message-ID | <46b5538d-c90e-4de6-8fe3-06cfb175aa3cn@googlegroups.com> |
| In reply to | #516532 |
On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > > On 4/3/2021 1:56 PM, djoyce099 wrote: > > > On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: > > >> On 4/3/2021 5:44 AM, djoyce099 wrote: > > >>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: > > >>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > > >>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > > >>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: > > >>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > > >>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: > > >>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson > > >>>>>>>>> wrote: > > >>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > > >>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: > > >>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: > > >>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: > > >>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > > >>>>>>>>>>>>>> Thomasson wrote: > > >>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > > >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > >>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > > >>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > >>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > > >>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. > > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > > >>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > > >>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: > > >>>>>>>>>>>>>>>>>> ... > > >>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > > >>>>>>>>>>>>>>>>>>>>>>> constant in the secret > > >>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. > > >>>>>>>>>>>>>>>>>> ... > > >>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > > >>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > > >>>>>>>>>>>>>>>>>>>>> different digits. > > >>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. > > >>>>>>>>>>>>>>>>>>>>> Take the > > >>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > > >>>>>>>>>>>>>>>>>>>>> initial mapping of > > >>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. > > >>>>>>>>>>>>>>>>>> ... > > >>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > > >>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to > > >>>>>>>>>>>>>>>>>> 2.xyz where x > > >>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide > > >>>>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that > > >>>>>>>>>>>>>>>>> contains the > > >>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler > > >>>>>>>>>>>>>>>>> alert: > > >>>>>>>>>>>>>>>> ... > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> //// > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> [8; 5 12 12 15] > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> The plaintext is: hello > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> ;^) > > >>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? > > >>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the > > >>>>>>>>>>>>>>> convergents > > >>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > > >>>>>>>>>>>>>>> rounding or > > >>>>>>>>>>>>>>> something. > > >>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > > >>>>>>>>>>>>>>>> The > > >>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my > > >>>>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program > > >>>>>>>>>>>>>>>> showed as > > >>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > > >>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 > > >>>>>>>>>>>>>>>> 20614211 ...] > > >>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the > > >>>>>>>>>>>>>> target rational > > >>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > > >>>>>>>>>>>>>> I way overdid it in my first post but it was a longer message > > >>>>>>>>>>>>>> that was encrypted but > > >>>>>>>>>>>>>> probably could have used a much smaller in length rational to > > >>>>>>>>>>>>>> get the desired number of > > >>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > > >>>>>>>>>>>>>> > > >>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in > > >>>>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. > > >>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > > >>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > > >>>>>>>>>>>>>> Think of it as using a slide rule where the private key > > >>>>>>>>>>>>>> (a string of random letters along with each group number > > >>>>>>>>>>>>>> identifiers) is on the fixed portion of the > > >>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message > > >>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. > > >>>>>>>>>>>>>> These two strings are placed side by side and sliding the > > >>>>>>>>>>>>>> ciphertext from left to right and aligning each letter > > >>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. > > >>>>>>>>>>>>>> The examples I have previously posted --- > > >>>>>>>>>>>>>> A letter is only used once in the left to right scan like the > > >>>>>>>>>>>>>> word little the first T in little is used then the > > >>>>>>>>>>>>>> scan continues by the decryptor for the second T because this > > >>>>>>>>>>>>>> private key string is made up of 49 alpha > > >>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters > > >>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd > > >>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt > > >>>>>>>>>>>>>> by just this simple method -- > > >>>>>>>>>>>>>> > > >>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > > >>>>>>>>>>>>>> Fixed private > > >>>>>>>>>>>>>> key--------------------------------------------------------- > > >>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > > >>>>>>>>>>>>>> > > >>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > >>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key > > >>>>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of > > >>>>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) > > >>>>>>>>>>>>>> and scanning ----> again for the correct letter alignment to > > >>>>>>>>>>>>>> be cherry-picked from the private key. > > >>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of the > > >>>>>>>>>>>>>> characters in the private key can be drastically > > >>>>>>>>>>>>>> changed along with the group identifiers then the public key > > >>>>>>>>>>>>>> would be useless to the person without the new private string. > > >>>>>>>>>>>>>> In a completed scan (end of too the right ------>), there > > >>>>>>>>>>>>>> could be several stops for letter alignments. > > >>>>>>>>>>>>>> I am just using this analogy of sliding but the right parsing > > >>>>>>>>>>>>>> of strings in both algorithms would get the job done. > > >>>>>>>>>>>>>> The above decryption of the public key above is easy if you > > >>>>>>>>>>>>>> follow the rules. > > >>>>>>>>>>>>>> This is just what I can remember from these old algorithms I > > >>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s > > >>>>>>>>>>>>>> that worked great for encrypting and decrypting these numbers > > >>>>>>>>>>>>>> only 1-7 ciphers. > > >>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > > >>>>>>>>>>>>>> getting anywhere yet. > > >>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? > > >>>>>>>>>>>>> Or found any flaws in the concept? > > >>>>>>>>>>>> Adding a level of security to any public key cipher of the above > > >>>>>>>>>>>> nature the group identifiers could be changed > > >>>>>>>>>>>> to a different identifier position after each message sent. > > >>>>>>>>>>>> This way no patterns of odd position numbers can be detected > > >>>>>>>>>>>> even though some > > >>>>>>>>>>>> identifiers sometimes are used in succession breaking any > > >>>>>>>>>>>> pattern possible with future cipher messages. > > >>>>>>>>>>>> > > >>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > > >>>>>>>>>>>> Okay, Just say I presented the public key --- > > >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>> Then said, solve this cipher, what is the hidden written message > > >>>>>>>>>>>> these numbers represent? > > >>>>>>>>>>>> Duh, This is more powerful than even the German enigma machine. > > >>>>>>>>>>>> This is because the public key encoded numeric message can be > > >>>>>>>>>>>> any length but the > > >>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers > > >>>>>>>>>>>> randomly located and the 49 Alpha characters. > > >>>>>>>>>>>> In other words, I would die with this secret. ;-) > > >>>>>>>>>>> > > >>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone > > >>>>>>>>>>> knowing the rules and the private > > >>>>>>>>>>> key already revealed. > > >>>>>>>>>>> > > >>>>>>>>>> Also, if you are going to develop a cipher out of this, you need > > >>>>>>>>>> to make > > >>>>>>>>>> sure that every encryption generates a radically different > > >>>>>>>>>> ciphertext, > > >>>>>>>>>> even for the exact same plaintext. So encrypting the same plaintext > > >>>>>>>>>> several times in a row would produce very different ciphertexts. > > >>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > > >>>>>>>>> alpha character of 26 possibilities > > >>>>>>>>> only the order of these 7 group identifiers is changed after each > > >>>>>>>>> message > > >>>>>>>>> The different combinations are 7! . A lot of messages (5048). > > >>>>>>>>> Changed randomly. This way no letter connections > > >>>>>>>>> other than a few out of 7 letters in a few groups after a few > > >>>>>>>>> messages are sent but then complete contradictory results > > >>>>>>>>> pointing to a letter involved with one particular identifier group > > >>>>>>>>> of 7 letters. > > >>>>>>>>> A bunch of test ciphertext would have to be processed to prove this > > >>>>>>>>> point. > > >>>>>>>>> The order right now of these group identifiers in this one example > > >>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in > > >>>>>>>>> odd positions in the private key alpha string --- > > >>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > > >>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) > > >>>>>>>>> chosen from a random table of these possibilities. > > >>>>>>>>> So only a 7 number change is necessary and once in a while change > > >>>>>>>>> the random order (predetermined in a certain > > >>>>>>>>> order of vowels and consonance strategically located in all the > > >>>>>>>>> private string (groups of 7) should do the trick.. > > >>>>>>>>> Did you solve the cipher yet? > > >>>>>>>>> I gave plenty of info by using the slide rule method and the actual > > >>>>>>>>> private key and ciphertext associated with it. > > >>>>>>>> > > >>>>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections > > >>>>>>>> you are supposed to solve against the private > > >>>>>>>> alpha key. > > >>>>>>>> When aligning an odd positioned group identifier from the public key > > >>>>>>>> it can only draw one letter from that group > > >>>>>>>> in the private key string. This is because the left to right > > >>>>>>>> movement to align the identifier can't go back to the left > > >>>>>>>> or stay in the same position on that identifier to choose the first > > >>>>>>>> but not the second letter within the same group. > > >>>>>>>> So here is the corrected ciphertext with 4 corrections -- > > >>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > > >>>>>>>> It will be self-explanatory when you solve the cipher. > > >>>>>>>> > > >>>>>>> I am busy right now, but please post it over on sci.crypt. > > >>>>>>> > > >>>>>>> Using the same exact secret key, and encrypting the plaintext several > > >>>>>>> times in a row should create different ciphertexts. Here is a crude > > >>>>>>> example I made of my highly experimental fractal based encryption > > >>>>>>> algorihtm. This funny fractal thing is radically different than my HMAC > > >>>>>>> cipher. Anyway... > > >>>>>>> > > >>>>>>> Here are several ciphertexts that decrypt to the same exact plaintext > > >>>>>>> using the default secret key using the following online program of mine: > > >>>>>>> > > >>>>>>> http://funwithfractals.atspace.cc/ffe > > >>>>>>> > > >>>>>>> The plaintext is: Hello World. > > >>>>>>> > > >>>>>>> 12 bytes > > >>>>>>> > > >>>>>>> > > >>>>>>> ciphertext 0 > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> 0.07464055294813914 0.21413369654338263 > > >>>>>>> 0.18726842930653814 0.15381457747419044 > > >>>>>>> > > >>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > > >>>>>>> > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> > > >>>>>>> ciphertext 1 > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> 0.10712703156460045 0.3825663517793289 > > >>>>>>> 0.3822450385558595 0.18493372431673 > > >>>>>>> > > >>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > > >>>>>>> > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> > > >>>>>>> ciphertext 2 > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> 0.4562359936711957 0.21850028449704323 > > >>>>>>> 0.3486656373192471 0.3596603216576378 > > >>>>>>> > > >>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > > >>>>>>> > > >>>>>>> ______________________________ > > >>>>>>> > > >>>>>>> > > >>>>>>> > > >>>>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher > > >>>>>>> Text box and click the Decrypt button. Better to use a desktop for the > > >>>>>>> crude layout. > > >>>>>>> > > >>>>>>> > > >>>>>>> This is using something called an IV. However, my HMAC cipher actually > > >>>>>>> encrypts the random iv into the ciphertext itself. So, its not sent in > > >>>>>>> the clear. Read all of: > > >>>>>>> > > >>>>>>> http://funwithfractals.atspace.cc/ct_cipher > > >>>>>>> > > >>>>>>> Also, read all of: > > >>>>>>> > > >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > > >>>>>>> > > >>>>>>> > > >>>>>>> Actually, try clicking Encrypt multiple times and take a look at what > > >>>>>>> happens to the ciphertext. > > >>>>>> > > >>>>>> Chris, > > >>>>>> It appears to create a few more encrypted 2 character codes than the > > >>>>>> actual number of alpha characters > > >>>>>> in the plaintext in a one-for-one matchup. > > >>>>> > > >>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for each > > >>>>> plaintext character. Can you show me an example plaintext where it > > >>>>> creates more? This is different than my HMAC cipher that can extend the > > >>>>> ciphertext and make it larger than the plaintext via using TRNG random > > >>>>> bytes in the plaintext before encrypting. read all: > > >>>>> http://funwithfractals.atspace.cc/ct_cipher > > >>>>> > > >>>>> Now, back to my FFE. So, encrypting Hello using the default key can be: > > >>>>> _______________________ > > >>>>> 0.12934470968540027 0.025161836871791087 > > >>>>> 0.03337929216249355 0.11671759502753765 > > >>>>> > > >>>>> FF 19 E6 62 D5 > > >>>>> _______________________ > > >>>>> > > >>>>> 5 Hexbytes FF 19 E6 62 D5. > > >>>>> > > >>>>> If you can give me a plaintext that creates more than hexbytes than the > > >>>>> number of characters in the plaintext, please show me! > > >>>>> > > >>>>>> Interesting what is going on there. > > >>>>>> Also, what are the number of mathematical possibilities of creating > > >>>>>> these 2 unique character codes of a mix > > >>>>>> of alpha-numeric or just alpha, or just numeric to give a final > > >>>>>> total of possibilities? > > >>>>>> Is it 26! *10! ? Probably not that big. > > >>>>> > > >>>>> I am not sure. It depends on how many different secret keys one can make > > >>>>> and how many possibilities of getting the same exact random IV.[...] > > >>>> > > >>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 > > >>>> D5, it would be 5 16-bit numbers. So, the probability would be the > > >>>> chances of rolling 5 16 sided die and getting a result X. Okay, now how > > >>>> many times do we need to roll to get X again? Each roll would be a click > > >>>> of the Encrypt button for the same plaintext and secret key. Yes, the > > >>>> secret key comes into play. Because FF 19 E6 62 D5 does not work with > > >>>> another secret key that was not used to create it. > > >>> > > >>> One big question? > > >>> A possible scenario -- > > >>> Joe the encryptor has his own offline encryption algorithm in a computer. > > >>> He copies the encrypted message on a thumb drive and loads it into his > > >>> online computer and sends the encrypted message to his foreign opertive > > >>> Alice. > > >>> Is some other info coming along with that encrypted message? > > >>> There could be something berried in the encrypted hex code? > > >>> My big question is, has this been tried on two separate offline > > >>> systems? > > >>> If this was all done on one system, I was snookered if not then this is > > >>> fantastic. > > >>> On the encryption side algorithm --- plaintext read in. > > >>> On the decryption side hex coding -- read in. > > >>> Two separate systems. > > >>> A Huge advantage if both algorithms are on one system to > > >>> pull a fast one. > > >>> Or a possibility much more data is coming across than just the encrypted message? > > >>> > > >>> Just my take an opinion. > > >>> Not accusing you of anything because you have much more talent than I on fractals > > >>> and the whole structure of the two, I hope, separate systems.(encryption,decryption) > > >>> The question needs to be asked. > > >>> > > >>> Whatever just keep producing these great renderings which I find fascinating. > > >>> Also what you produced here, even if it was only on one system. > > >> It will work on different systems, online or offline. The full code is > > >> on the webpage. So, Bob can be using his own system, and browser of > > >> choice. Alice can decrypt it using her own system, and browser of > > >> choice. The code is all client side. > > > > > > So Alice is the client-side? (decryptor) > > > If so, it makes no sense. > > > > > > > > > > > Try to decrypt this... Just copy-and-paste the ciphertext between the > > lines into the Cipher Text box in the page, and click the decrypt button. > > > > ________________________________ > > > > 0.39351870705816516 0.12367086856260284 > > 0.10821656063857987 0.5183020398197964 > > > > 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > > 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > > 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > > 49 40 AE E2 > > > > ________________________________ > > > > > > What does it say? > It just comes back with the short message "plaintext" I just erased to paste in the hex code above. > Do I need to paste the four fractional parts into the lower window also? Or do I run one of your Python algorithms?
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-03 20:08 -0700 |
| Message-ID | <f825a1ff-38d0-49c7-b88a-add72ff398d1n@googlegroups.com> |
| In reply to | #516539 |
On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: > On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > > On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > > > On 4/3/2021 1:56 PM, djoyce099 wrote: > > > > On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: > > > >> On 4/3/2021 5:44 AM, djoyce099 wrote: > > > >>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: > > > >>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > > > >>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > > > >>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson wrote: > > > >>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > > > >>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: > > > >>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. Thomasson > > > >>>>>>>>> wrote: > > > >>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > > > >>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 wrote: > > > >>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 wrote: > > > >>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 wrote: > > > >>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > > > >>>>>>>>>>>>>> Thomasson wrote: > > > >>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > > > >>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > > >>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > > > >>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > > >>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > > > >>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris M. > > > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > > > >>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > > > >>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > > > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: > > > >>>>>>>>>>>>>>>>>> ... > > > >>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > > > >>>>>>>>>>>>>>>>>>>>>>> constant in the secret > > > >>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. > > > >>>>>>>>>>>>>>>>>> ... > > > >>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > > > >>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > > > >>>>>>>>>>>>>>>>>>>>> different digits. > > > >>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. > > > >>>>>>>>>>>>>>>>>>>>> Take the > > > >>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > > > >>>>>>>>>>>>>>>>>>>>> initial mapping of > > > >>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. > > > >>>>>>>>>>>>>>>>>> ... > > > >>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > > > >>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to > > > >>>>>>>>>>>>>>>>>> 2.xyz where x > > > >>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider 2.269. > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to divide > > > >>>>>>>>>>>>>>>>> 17.4016863080244085 by it to get the original number that > > > >>>>>>>>>>>>>>>>> contains the > > > >>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, spoiler > > > >>>>>>>>>>>>>>>>> alert: > > > >>>>>>>>>>>>>>>> ... > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> //// > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> [8; 5 12 12 15] > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> The plaintext is: hello > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> ;^) > > > >>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate enough? > > > >>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the > > > >>>>>>>>>>>>>>> convergents > > > >>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > > > >>>>>>>>>>>>>>> rounding or > > > >>>>>>>>>>>>>>> something. > > > >>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > > > >>>>>>>>>>>>>>>> The > > > >>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], which my > > > >>>>>>>>>>>>>>>> previously-mentioned continued-fractions-to-letters program > > > >>>>>>>>>>>>>>>> showed as > > > >>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > > > >>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 15 > > > >>>>>>>>>>>>>>>> 20614211 ...] > > > >>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of the > > > >>>>>>>>>>>>>> target rational > > > >>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > > > >>>>>>>>>>>>>> I way overdid it in my first post but it was a longer message > > > >>>>>>>>>>>>>> that was encrypted but > > > >>>>>>>>>>>>>> probably could have used a much smaller in length rational to > > > >>>>>>>>>>>>>> get the desired number of > > > >>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > > > >>>>>>>>>>>>>> > > > >>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 in > > > >>>>>>>>>>>>>> the even positions -- 2,4,6,8,10,12,14.. > > > >>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > > > >>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > > > >>>>>>>>>>>>>> Think of it as using a slide rule where the private key > > > >>>>>>>>>>>>>> (a string of random letters along with each group number > > > >>>>>>>>>>>>>> identifiers) is on the fixed portion of the > > > >>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message > > > >>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. > > > >>>>>>>>>>>>>> These two strings are placed side by side and sliding the > > > >>>>>>>>>>>>>> ciphertext from left to right and aligning each letter > > > >>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the rule. > > > >>>>>>>>>>>>>> The examples I have previously posted --- > > > >>>>>>>>>>>>>> A letter is only used once in the left to right scan like the > > > >>>>>>>>>>>>>> word little the first T in little is used then the > > > >>>>>>>>>>>>>> scan continues by the decryptor for the second T because this > > > >>>>>>>>>>>>>> private key string is made up of 49 alpha > > > >>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters > > > >>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd > > > >>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt > > > >>>>>>>>>>>>>> by just this simple method -- > > > >>>>>>>>>>>>>> > > > >>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > > > >>>>>>>>>>>>>> Fixed private > > > >>>>>>>>>>>>>> key--------------------------------------------------------- > > > >>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > > > >>>>>>>>>>>>>> > > > >>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > > >>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public key > > > >>>>>>>>>>>>>> sent to be decrypted. moving --> then when reaching the end of > > > >>>>>>>>>>>>>> the fixed private key the cipher is brought back <--- (no scan ) > > > >>>>>>>>>>>>>> and scanning ----> again for the correct letter alignment to > > > >>>>>>>>>>>>>> be cherry-picked from the private key. > > > >>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of the > > > >>>>>>>>>>>>>> characters in the private key can be drastically > > > >>>>>>>>>>>>>> changed along with the group identifiers then the public key > > > >>>>>>>>>>>>>> would be useless to the person without the new private string. > > > >>>>>>>>>>>>>> In a completed scan (end of too the right ------>), there > > > >>>>>>>>>>>>>> could be several stops for letter alignments. > > > >>>>>>>>>>>>>> I am just using this analogy of sliding but the right parsing > > > >>>>>>>>>>>>>> of strings in both algorithms would get the job done. > > > >>>>>>>>>>>>>> The above decryption of the public key above is easy if you > > > >>>>>>>>>>>>>> follow the rules. > > > >>>>>>>>>>>>>> This is just what I can remember from these old algorithms I > > > >>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s > > > >>>>>>>>>>>>>> that worked great for encrypting and decrypting these numbers > > > >>>>>>>>>>>>>> only 1-7 ciphers. > > > >>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > > > >>>>>>>>>>>>>> getting anywhere yet. > > > >>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher yet? > > > >>>>>>>>>>>>> Or found any flaws in the concept? > > > >>>>>>>>>>>> Adding a level of security to any public key cipher of the above > > > >>>>>>>>>>>> nature the group identifiers could be changed > > > >>>>>>>>>>>> to a different identifier position after each message sent. > > > >>>>>>>>>>>> This way no patterns of odd position numbers can be detected > > > >>>>>>>>>>>> even though some > > > >>>>>>>>>>>> identifiers sometimes are used in succession breaking any > > > >>>>>>>>>>>> pattern possible with future cipher messages. > > > >>>>>>>>>>>> > > > >>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > > > >>>>>>>>>>>> Okay, Just say I presented the public key --- > > > >>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > >>>>>>>>>>>> Then said, solve this cipher, what is the hidden written message > > > >>>>>>>>>>>> these numbers represent? > > > >>>>>>>>>>>> Duh, This is more powerful than even the German enigma machine. > > > >>>>>>>>>>>> This is because the public key encoded numeric message can be > > > >>>>>>>>>>>> any length but the > > > >>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers > > > >>>>>>>>>>>> randomly located and the 49 Alpha characters. > > > >>>>>>>>>>>> In other words, I would die with this secret. ;-) > > > >>>>>>>>>>> > > > >>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone > > > >>>>>>>>>>> knowing the rules and the private > > > >>>>>>>>>>> key already revealed. > > > >>>>>>>>>>> > > > >>>>>>>>>> Also, if you are going to develop a cipher out of this, you need > > > >>>>>>>>>> to make > > > >>>>>>>>>> sure that every encryption generates a radically different > > > >>>>>>>>>> ciphertext, > > > >>>>>>>>>> even for the exact same plaintext. So encrypting the same plaintext > > > >>>>>>>>>> several times in a row would produce very different ciphertexts. > > > >>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > > > >>>>>>>>> alpha character of 26 possibilities > > > >>>>>>>>> only the order of these 7 group identifiers is changed after each > > > >>>>>>>>> message > > > >>>>>>>>> The different combinations are 7! . A lot of messages (5048). > > > >>>>>>>>> Changed randomly. This way no letter connections > > > >>>>>>>>> other than a few out of 7 letters in a few groups after a few > > > >>>>>>>>> messages are sent but then complete contradictory results > > > >>>>>>>>> pointing to a letter involved with one particular identifier group > > > >>>>>>>>> of 7 letters. > > > >>>>>>>>> A bunch of test ciphertext would have to be processed to prove this > > > >>>>>>>>> point. > > > >>>>>>>>> The order right now of these group identifiers in this one example > > > >>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in > > > >>>>>>>>> odd positions in the private key alpha string --- > > > >>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > > > >>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 possibilities) > > > >>>>>>>>> chosen from a random table of these possibilities. > > > >>>>>>>>> So only a 7 number change is necessary and once in a while change > > > >>>>>>>>> the random order (predetermined in a certain > > > >>>>>>>>> order of vowels and consonance strategically located in all the > > > >>>>>>>>> private string (groups of 7) should do the trick.. > > > >>>>>>>>> Did you solve the cipher yet? > > > >>>>>>>>> I gave plenty of info by using the slide rule method and the actual > > > >>>>>>>>> private key and ciphertext associated with it. > > > >>>>>>>> > > > >>>>>>>> I just ran an actual algorithm and the ciphertext has 2 corrections > > > >>>>>>>> you are supposed to solve against the private > > > >>>>>>>> alpha key. > > > >>>>>>>> When aligning an odd positioned group identifier from the public key > > > >>>>>>>> it can only draw one letter from that group > > > >>>>>>>> in the private key string. This is because the left to right > > > >>>>>>>> movement to align the identifier can't go back to the left > > > >>>>>>>> or stay in the same position on that identifier to choose the first > > > >>>>>>>> but not the second letter within the same group. > > > >>>>>>>> So here is the corrected ciphertext with 4 corrections -- > > > >>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > > > >>>>>>>> It will be self-explanatory when you solve the cipher. > > > >>>>>>>> > > > >>>>>>> I am busy right now, but please post it over on sci.crypt. > > > >>>>>>> > > > >>>>>>> Using the same exact secret key, and encrypting the plaintext several > > > >>>>>>> times in a row should create different ciphertexts. Here is a crude > > > >>>>>>> example I made of my highly experimental fractal based encryption > > > >>>>>>> algorihtm. This funny fractal thing is radically different than my HMAC > > > >>>>>>> cipher. Anyway... > > > >>>>>>> > > > >>>>>>> Here are several ciphertexts that decrypt to the same exact plaintext > > > >>>>>>> using the default secret key using the following online program of mine: > > > >>>>>>> > > > >>>>>>> http://funwithfractals.atspace.cc/ffe > > > >>>>>>> > > > >>>>>>> The plaintext is: Hello World. > > > >>>>>>> > > > >>>>>>> 12 bytes > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> ciphertext 0 > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> 0.07464055294813914 0.21413369654338263 > > > >>>>>>> 0.18726842930653814 0.15381457747419044 > > > >>>>>>> > > > >>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > > > >>>>>>> > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> ciphertext 1 > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> 0.10712703156460045 0.3825663517793289 > > > >>>>>>> 0.3822450385558595 0.18493372431673 > > > >>>>>>> > > > >>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > > > >>>>>>> > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> ciphertext 2 > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> 0.4562359936711957 0.21850028449704323 > > > >>>>>>> 0.3486656373192471 0.3596603216576378 > > > >>>>>>> > > > >>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > > > >>>>>>> > > > >>>>>>> ______________________________ > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> To decrypt, copy-and-paste the text in between the lines into the Cipher > > > >>>>>>> Text box and click the Decrypt button. Better to use a desktop for the > > > >>>>>>> crude layout. > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> This is using something called an IV. However, my HMAC cipher actually > > > >>>>>>> encrypts the random iv into the ciphertext itself. So, its not sent in > > > >>>>>>> the clear. Read all of: > > > >>>>>>> > > > >>>>>>> http://funwithfractals.atspace.cc/ct_cipher > > > >>>>>>> > > > >>>>>>> Also, read all of: > > > >>>>>>> > > > >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> Actually, try clicking Encrypt multiple times and take a look at what > > > >>>>>>> happens to the ciphertext. > > > >>>>>> > > > >>>>>> Chris, > > > >>>>>> It appears to create a few more encrypted 2 character codes than the > > > >>>>>> actual number of alpha characters > > > >>>>>> in the plaintext in a one-for-one matchup. > > > >>>>> > > > >>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for each > > > >>>>> plaintext character. Can you show me an example plaintext where it > > > >>>>> creates more? This is different than my HMAC cipher that can extend the > > > >>>>> ciphertext and make it larger than the plaintext via using TRNG random > > > >>>>> bytes in the plaintext before encrypting. read all: > > > >>>>> http://funwithfractals.atspace.cc/ct_cipher > > > >>>>> > > > >>>>> Now, back to my FFE. So, encrypting Hello using the default key can be: > > > >>>>> _______________________ > > > >>>>> 0.12934470968540027 0.025161836871791087 > > > >>>>> 0.03337929216249355 0.11671759502753765 > > > >>>>> > > > >>>>> FF 19 E6 62 D5 > > > >>>>> _______________________ > > > >>>>> > > > >>>>> 5 Hexbytes FF 19 E6 62 D5. > > > >>>>> > > > >>>>> If you can give me a plaintext that creates more than hexbytes than the > > > >>>>> number of characters in the plaintext, please show me! > > > >>>>> > > > >>>>>> Interesting what is going on there. > > > >>>>>> Also, what are the number of mathematical possibilities of creating > > > >>>>>> these 2 unique character codes of a mix > > > >>>>>> of alpha-numeric or just alpha, or just numeric to give a final > > > >>>>>> total of possibilities? > > > >>>>>> Is it 26! *10! ? Probably not that big. > > > >>>>> > > > >>>>> I am not sure. It depends on how many different secret keys one can make > > > >>>>> and how many possibilities of getting the same exact random IV.[...] > > > >>>> > > > >>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 62 > > > >>>> D5, it would be 5 16-bit numbers. So, the probability would be the > > > >>>> chances of rolling 5 16 sided die and getting a result X. Okay, now how > > > >>>> many times do we need to roll to get X again? Each roll would be a click > > > >>>> of the Encrypt button for the same plaintext and secret key. Yes, the > > > >>>> secret key comes into play. Because FF 19 E6 62 D5 does not work with > > > >>>> another secret key that was not used to create it. > > > >>> > > > >>> One big question? > > > >>> A possible scenario -- > > > >>> Joe the encryptor has his own offline encryption algorithm in a computer. > > > >>> He copies the encrypted message on a thumb drive and loads it into his > > > >>> online computer and sends the encrypted message to his foreign opertive > > > >>> Alice. > > > >>> Is some other info coming along with that encrypted message? > > > >>> There could be something berried in the encrypted hex code? > > > >>> My big question is, has this been tried on two separate offline > > > >>> systems? > > > >>> If this was all done on one system, I was snookered if not then this is > > > >>> fantastic. > > > >>> On the encryption side algorithm --- plaintext read in. > > > >>> On the decryption side hex coding -- read in. > > > >>> Two separate systems. > > > >>> A Huge advantage if both algorithms are on one system to > > > >>> pull a fast one. > > > >>> Or a possibility much more data is coming across than just the encrypted message? > > > >>> > > > >>> Just my take an opinion. > > > >>> Not accusing you of anything because you have much more talent than I on fractals > > > >>> and the whole structure of the two, I hope, separate systems.(encryption,decryption) > > > >>> The question needs to be asked. > > > >>> > > > >>> Whatever just keep producing these great renderings which I find fascinating. > > > >>> Also what you produced here, even if it was only on one system. > > > >> It will work on different systems, online or offline. The full code is > > > >> on the webpage. So, Bob can be using his own system, and browser of > > > >> choice. Alice can decrypt it using her own system, and browser of > > > >> choice. The code is all client side. > > > > > > > > So Alice is the client-side? (decryptor) > > > > If so, it makes no sense. > > > > > > > > > > > > > > > Try to decrypt this... Just copy-and-paste the ciphertext between the > > > lines into the Cipher Text box in the page, and click the decrypt button. > > > > > > ________________________________ > > > > > > 0.39351870705816516 0.12367086856260284 > > > 0.10821656063857987 0.5183020398197964 > > > > > > 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > > > 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > > > 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > > > 49 40 AE E2 > > > > > > ________________________________ > > > > > > > > > What does it say? > > It just comes back with the short message "plaintext" I just erased to paste in the hex code above. > > Do I need to paste the four fractional parts into the lower window also? > Or do I run one of your Python algorithms? I am still trying to wrap my head around your encryption/decryption concept. Examing your Python code and your explanations. Okay Chris, let's draw a crude comparison. The German enigma was employed separately within the different military groups. The navy, army, airforce. etc. Each had a few or more enigma machines at each end of their radio communications networks. Like your system, they could send the encrypted code either way but each had charts that would dictate any changes to the cypher wheels and plugboards with a time and date stamp for that change, even allowing for different time zones if necessary. Drawing a comparison to your system like the charts but only employed as a special hash function in both algorithms that after each message sent and received by either party, Bob or Alice, the new duplicate cypher is updated in each algorithm so they match to each letter/hex. Crudely put but like the German enigma where each combination of the cypher was changed after a period of time instead of after each transmission and receiving of YOUR system. Then it is automatically updated on both systems algorithms to match any alpha to hex conversion on both algorithms to give a new letter/hex cypher. Have I got the comparison right?
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-04-04 05:30 -0400 |
| Message-ID | <s4c10b$11do$1@gioia.aioe.org> |
| In reply to | #516548 |
djoyce099 explained on 4/3/2021 : > On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: >> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: >>>> On 4/3/2021 1:56 PM, djoyce099 wrote: >>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: >>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: >>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: >>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson >>>>>>>>>> wrote: >>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: >>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. >>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 >>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 >>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 >>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. >>>>>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris >>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... >>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret >>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... >>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are >>>>>>>>>>>>>>>>>>>>>>>>> different digits. >>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. >>>>>>>>>>>>>>>>>>>>>>>>> Take the >>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your >>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of >>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... >>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to >>>>>>>>>>>>>>>>>>>>>> 2.xyz where x >>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider >>>>>>>>>>>>>>>>>>>>>> 2.269. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to >>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original >>>>>>>>>>>>>>>>>>>>> number that contains the >>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, >>>>>>>>>>>>>>>>>>>>> spoiler alert: ... >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate >>>>>>>>>>>>>>>>>>>> enough? >>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the >>>>>>>>>>>>>>>>>>> convergents >>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be >>>>>>>>>>>>>>>>>>> rounding or >>>>>>>>>>>>>>>>>>> something. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>>>>>> The >>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], >>>>>>>>>>>>>>>>>>>> which my previously-mentioned >>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as >>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 >>>>>>>>>>>>>>>>>>>> 15 20614211 ...] >>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of >>>>>>>>>>>>>>>>>> the target rational >>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. >>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer >>>>>>>>>>>>>>>>>> message that was encrypted but >>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational >>>>>>>>>>>>>>>>>> to get the desired number of >>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 >>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. >>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. >>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key >>>>>>>>>>>>>>>>>> (a string of random letters along with each group number >>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the >>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message >>>>>>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. >>>>>>>>>>>>>>>>>> These two strings are placed side by side and sliding the >>>>>>>>>>>>>>>>>> ciphertext from left to right and aligning each letter >>>>>>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the >>>>>>>>>>>>>>>>>> rule. The examples I have previously posted --- >>>>>>>>>>>>>>>>>> A letter is only used once in the left to right scan like >>>>>>>>>>>>>>>>>> the word little the first T in little is used then the >>>>>>>>>>>>>>>>>> scan continues by the decryptor for the second T because >>>>>>>>>>>>>>>>>> this private key string is made up of 49 alpha >>>>>>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters >>>>>>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd >>>>>>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt >>>>>>>>>>>>>>>>>> by just this simple method -- >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public >>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching the >>>>>>>>>>>>>>>>>> end of the fixed private key the cipher is brought back >>>>>>>>>>>>>>>>>> <--- (no scan ) and scanning ----> again for the correct >>>>>>>>>>>>>>>>>> letter alignment to be cherry-picked from the private key. >>>>>>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of >>>>>>>>>>>>>>>>>> the characters in the private key can be drastically >>>>>>>>>>>>>>>>>> changed along with the group identifiers then the public key >>>>>>>>>>>>>>>>>> would be useless to the person without the new private >>>>>>>>>>>>>>>>>> string. In a completed scan (end of too the right ------>), >>>>>>>>>>>>>>>>>> there could be several stops for letter alignments. >>>>>>>>>>>>>>>>>> I am just using this analogy of sliding but the right >>>>>>>>>>>>>>>>>> parsing of strings in both algorithms would get the job >>>>>>>>>>>>>>>>>> done. The above decryption of the public key above is easy >>>>>>>>>>>>>>>>>> if you follow the rules. >>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms I >>>>>>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s >>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these >>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. >>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not >>>>>>>>>>>>>>>>>> getting anywhere yet. >>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher >>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? >>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the >>>>>>>>>>>>>>>> above nature the group identifiers could be changed >>>>>>>>>>>>>>>> to a different identifier position after each message sent. >>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected >>>>>>>>>>>>>>>> even though some >>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any >>>>>>>>>>>>>>>> pattern possible with future cipher messages. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written >>>>>>>>>>>>>>>> message these numbers represent? >>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma >>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric >>>>>>>>>>>>>>>> message can be any length but the >>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers >>>>>>>>>>>>>>>> randomly located and the 49 Alpha characters. >>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone >>>>>>>>>>>>>>> knowing the rules and the private >>>>>>>>>>>>>>> key already revealed. >>>>>>>>>>>>>>> >>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you need >>>>>>>>>>>>>> to make >>>>>>>>>>>>>> sure that every encryption generates a radically different >>>>>>>>>>>>>> ciphertext, >>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same >>>>>>>>>>>>>> plaintext several times in a row would produce very different >>>>>>>>>>>>>> ciphertexts. >>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an >>>>>>>>>>>>> alpha character of 26 possibilities >>>>>>>>>>>>> only the order of these 7 group identifiers is changed after each >>>>>>>>>>>>> message >>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). >>>>>>>>>>>>> Changed randomly. This way no letter connections >>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few >>>>>>>>>>>>> messages are sent but then complete contradictory results >>>>>>>>>>>>> pointing to a letter involved with one particular identifier >>>>>>>>>>>>> group of 7 letters. >>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove >>>>>>>>>>>>> this point. >>>>>>>>>>>>> The order right now of these group identifiers in this one >>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in >>>>>>>>>>>>> odd positions in the private key alpha string --- >>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 >>>>>>>>>>>>> possibilities) chosen from a random table of these >>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once >>>>>>>>>>>>> in a while change the random order (predetermined in a certain >>>>>>>>>>>>> order of vowels and consonance strategically located in all the >>>>>>>>>>>>> private string (groups of 7) should do the trick.. >>>>>>>>>>>>> Did you solve the cipher yet? >>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the >>>>>>>>>>>>> actual private key and ciphertext associated with it. >>>>>>>>>>>> >>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 >>>>>>>>>>>> corrections you are supposed to solve against the private >>>>>>>>>>>> alpha key. >>>>>>>>>>>> When aligning an odd positioned group identifier from the public >>>>>>>>>>>> key it can only draw one letter from that group >>>>>>>>>>>> in the private key string. This is because the left to right >>>>>>>>>>>> movement to align the identifier can't go back to the left >>>>>>>>>>>> or stay in the same position on that identifier to choose the >>>>>>>>>>>> first but not the second letter within the same group. >>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- >>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 >>>>>>>>>>>> It will be self-explanatory when you solve the cipher. >>>>>>>>>>>> >>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>>>>>> >>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext >>>>>>>>>>> several times in a row should create different ciphertexts. Here >>>>>>>>>>> is a crude example I made of my highly experimental fractal based >>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically >>>>>>>>>>> different than my HMAC cipher. Anyway... >>>>>>>>>>> >>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact >>>>>>>>>>> plaintext using the default secret key using the following online >>>>>>>>>>> program of mine: >>>>>>>>>>> >>>>>>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>>>>>> >>>>>>>>>>> The plaintext is: Hello World. >>>>>>>>>>> >>>>>>>>>>> 12 bytes >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> ciphertext 0 >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> 0.07464055294813914 0.21413369654338263 >>>>>>>>>>> 0.18726842930653814 0.15381457747419044 >>>>>>>>>>> >>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>>>>>> >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> ciphertext 1 >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> 0.10712703156460045 0.3825663517793289 >>>>>>>>>>> 0.3822450385558595 0.18493372431673 >>>>>>>>>>> >>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>>>>>> >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> ciphertext 2 >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> 0.4562359936711957 0.21850028449704323 >>>>>>>>>>> 0.3486656373192471 0.3596603216576378 >>>>>>>>>>> >>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>>>>>> >>>>>>>>>>> ______________________________ >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the >>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a >>>>>>>>>>> desktop for the crude layout. >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> This is using something called an IV. However, my HMAC cipher >>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, >>>>>>>>>>> its not sent in the clear. Read all of: >>>>>>>>>>> >>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>> >>>>>>>>>>> Also, read all of: >>>>>>>>>>> >>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at >>>>>>>>>>> what happens to the ciphertext. >>>>>>>>>> >>>>>>>>>> Chris, >>>>>>>>>> It appears to create a few more encrypted 2 character codes than the >>>>>>>>>> actual number of alpha characters >>>>>>>>>> in the plaintext in a one-for-one matchup. >>>>>>>>> >>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for >>>>>>>>> each plaintext character. Can you show me an example plaintext where >>>>>>>>> it creates more? This is different than my HMAC cipher that can >>>>>>>>> extend the ciphertext and make it larger than the plaintext via >>>>>>>>> using TRNG random bytes in the plaintext before encrypting. read >>>>>>>>> all: http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>> >>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can >>>>>>>>> be: _______________________ >>>>>>>>> 0.12934470968540027 0.025161836871791087 >>>>>>>>> 0.03337929216249355 0.11671759502753765 >>>>>>>>> >>>>>>>>> FF 19 E6 62 D5 >>>>>>>>> _______________________ >>>>>>>>> >>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>>>>>> >>>>>>>>> If you can give me a plaintext that creates more than hexbytes than >>>>>>>>> the number of characters in the plaintext, please show me! >>>>>>>>> >>>>>>>>>> Interesting what is going on there. >>>>>>>>>> Also, what are the number of mathematical possibilities of creating >>>>>>>>>> these 2 unique character codes of a mix >>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final >>>>>>>>>> total of possibilities? >>>>>>>>>> Is it 26! *10! ? Probably not that big. >>>>>>>>> >>>>>>>>> I am not sure. It depends on how many different secret keys one can >>>>>>>>> make and how many possibilities of getting the same exact random >>>>>>>>> IV.[...] >>>>>>>> >>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 >>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be the >>>>>>>> chances of rolling 5 16 sided die and getting a result X. Okay, now >>>>>>>> how many times do we need to roll to get X again? Each roll would be >>>>>>>> a click of the Encrypt button for the same plaintext and secret key. >>>>>>>> Yes, the secret key comes into play. Because FF 19 E6 62 D5 does not >>>>>>>> work with another secret key that was not used to create it. >>>>>>> >>>>>>> One big question? >>>>>>> A possible scenario -- >>>>>>> Joe the encryptor has his own offline encryption algorithm in a >>>>>>> computer. He copies the encrypted message on a thumb drive and loads >>>>>>> it into his online computer and sends the encrypted message to his >>>>>>> foreign opertive Alice. >>>>>>> Is some other info coming along with that encrypted message? >>>>>>> There could be something berried in the encrypted hex code? >>>>>>> My big question is, has this been tried on two separate offline >>>>>>> systems? >>>>>>> If this was all done on one system, I was snookered if not then this is >>>>>>> fantastic. >>>>>>> On the encryption side algorithm --- plaintext read in. >>>>>>> On the decryption side hex coding -- read in. >>>>>>> Two separate systems. >>>>>>> A Huge advantage if both algorithms are on one system to >>>>>>> pull a fast one. >>>>>>> Or a possibility much more data is coming across than just the >>>>>>> encrypted message? >>>>>>> >>>>>>> Just my take an opinion. >>>>>>> Not accusing you of anything because you have much more talent than I >>>>>>> on fractals and the whole structure of the two, I hope, separate >>>>>>> systems.(encryption,decryption) The question needs to be asked. >>>>>>> >>>>>>> Whatever just keep producing these great renderings which I find >>>>>>> fascinating. Also what you produced here, even if it was only on one >>>>>>> system. >>>>>> It will work on different systems, online or offline. The full code is >>>>>> on the webpage. So, Bob can be using his own system, and browser of >>>>>> choice. Alice can decrypt it using her own system, and browser of >>>>>> choice. The code is all client side. >>>>> >>>>> So Alice is the client-side? (decryptor) >>>>> If so, it makes no sense. >>>>> >>>>> >>>>> >>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>> lines into the Cipher Text box in the page, and click the decrypt button. >>>> >>>> ________________________________ >>>> >>>> 0.39351870705816516 0.12367086856260284 >>>> 0.10821656063857987 0.5183020398197964 >>>> >>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>> 49 40 AE E2 >>>> >>>> ________________________________ >>>> >>>> >>>> What does it say? >>> It just comes back with the short message "plaintext" I just erased to >>> paste in the hex code above. Do I need to paste the four fractional parts >>> into the lower window also? >> Or do I run one of your Python algorithms? > > > I am still trying to wrap my head around your encryption/decryption concept. > Examing your Python code and your explanations. > Okay Chris, let's draw a crude comparison. > The German enigma was employed separately within the different military > groups. The navy, army, airforce. etc. > Each had a few or more enigma machines at each end of their radio > communications networks. Like your system, they could send the encrypted code > either way but each had charts that would dictate any changes to the cypher > wheels and plugboards with a time and date stamp for that change, even > allowing for different time zones if necessary. Drawing a comparison to your > system like the charts but only employed as a special hash function in both > algorithms that after each message sent and received by either party, Bob or > Alice, the new duplicate cypher is updated in each algorithm so they match to > each letter/hex. Crudely put but like the German enigma where each > combination of the cypher was changed after a period of time instead of after > each transmission and receiving of YOUR system. Then it is automatically > updated on both systems algorithms to match any alpha to hex conversion on > both algorithms to give a new letter/hex cypher. Have I got the comparison > right? One difference is that the Enigma encrypting the same message with the same 'key' resulted in the same ciphertext. Also, the Enigma would never give a CT letter the same coded letter as the plaintext letter because of that reflector wheel.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-04 10:35 -0700 |
| Message-ID | <067baa07-287f-401e-8805-6d331f161109n@googlegroups.com> |
| In reply to | #516566 |
On Sunday, April 4, 2021 at 5:31:01 AM UTC-4, FromTheRafters wrote: > djoyce099 explained on 4/3/2021 : > > On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: > >> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > >>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > >>>> On 4/3/2021 1:56 PM, djoyce099 wrote: > >>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson wrote: > >>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: > >>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson wrote: > >>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > >>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > >>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson > >>>>>>>>>> wrote: > >>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > >>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 wrote: > >>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. > >>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 > >>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 > >>>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 > >>>>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > >>>>>>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > >>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris > >>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: > >>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > >>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... > >>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > >>>>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > >>>>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > >>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret > >>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... > >>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > >>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > >>>>>>>>>>>>>>>>>>>>>>>>> different digits. > >>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original rational. > >>>>>>>>>>>>>>>>>>>>>>>>> Take the > >>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > >>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of > >>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... > >>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > >>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting to > >>>>>>>>>>>>>>>>>>>>>> 2.xyz where x > >>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider > >>>>>>>>>>>>>>>>>>>>>> 2.269. > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to > >>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original > >>>>>>>>>>>>>>>>>>>>> number that contains the > >>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, > >>>>>>>>>>>>>>>>>>>>> spoiler alert: ... > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> //// > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> The plaintext is: hello > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> ;^) > >>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate > >>>>>>>>>>>>>>>>>>>> enough? > >>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives the > >>>>>>>>>>>>>>>>>>> convergents > >>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > >>>>>>>>>>>>>>>>>>> rounding or > >>>>>>>>>>>>>>>>>>> something. > >>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > >>>>>>>>>>>>>>>>>>>> The > >>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], > >>>>>>>>>>>>>>>>>>>> which my previously-mentioned > >>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as > >>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > >>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 12 > >>>>>>>>>>>>>>>>>>>> 15 20614211 ...] > >>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of > >>>>>>>>>>>>>>>>>> the target rational > >>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > >>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer > >>>>>>>>>>>>>>>>>> message that was encrypted but > >>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational > >>>>>>>>>>>>>>>>>> to get the desired number of > >>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > >>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 > >>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. > >>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > >>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > >>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key > >>>>>>>>>>>>>>>>>> (a string of random letters along with each group number > >>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the > >>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted message > >>>>>>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. > >>>>>>>>>>>>>>>>>> These two strings are placed side by side and sliding the > >>>>>>>>>>>>>>>>>> ciphertext from left to right and aligning each letter > >>>>>>>>>>>>>>>>>> with the encrypted numbers of the sliding portion of the > >>>>>>>>>>>>>>>>>> rule. The examples I have previously posted --- > >>>>>>>>>>>>>>>>>> A letter is only used once in the left to right scan like > >>>>>>>>>>>>>>>>>> the word little the first T in little is used then the > >>>>>>>>>>>>>>>>>> scan continues by the decryptor for the second T because > >>>>>>>>>>>>>>>>>> this private key string is made up of 49 alpha > >>>>>>>>>>>>>>>>>> characters = 26*2 minus the second XYZ = 49 Alpha characters > >>>>>>>>>>>>>>>>>> and 1-7 group identifiers placed in the odd > >>>>>>>>>>>>>>>>>> count positions. Example below where this is easy to decrypt > >>>>>>>>>>>>>>>>>> by just this simple method -- > >>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > >>>>>>>>>>>>>>>>>> Fixed private > >>>>>>>>>>>>>>>>>> key--------------------------------------------------------- > >>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > >>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public > >>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching the > >>>>>>>>>>>>>>>>>> end of the fixed private key the cipher is brought back > >>>>>>>>>>>>>>>>>> <--- (no scan ) and scanning ----> again for the correct > >>>>>>>>>>>>>>>>>> letter alignment to be cherry-picked from the private key. > >>>>>>>>>>>>>>>>>> This is giving the whole cipher idea away but the order of > >>>>>>>>>>>>>>>>>> the characters in the private key can be drastically > >>>>>>>>>>>>>>>>>> changed along with the group identifiers then the public key > >>>>>>>>>>>>>>>>>> would be useless to the person without the new private > >>>>>>>>>>>>>>>>>> string. In a completed scan (end of too the right ------>), > >>>>>>>>>>>>>>>>>> there could be several stops for letter alignments. > >>>>>>>>>>>>>>>>>> I am just using this analogy of sliding but the right > >>>>>>>>>>>>>>>>>> parsing of strings in both algorithms would get the job > >>>>>>>>>>>>>>>>>> done. The above decryption of the public key above is easy > >>>>>>>>>>>>>>>>>> if you follow the rules. > >>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms I > >>>>>>>>>>>>>>>>>> produced in basic on my commodore 64 back in the 80s > >>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these > >>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. > >>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > >>>>>>>>>>>>>>>>>> getting anywhere yet. > >>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher > >>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? > >>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the > >>>>>>>>>>>>>>>> above nature the group identifiers could be changed > >>>>>>>>>>>>>>>> to a different identifier position after each message sent. > >>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected > >>>>>>>>>>>>>>>> even though some > >>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any > >>>>>>>>>>>>>>>> pattern possible with future cipher messages. > >>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > >>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- > >>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written > >>>>>>>>>>>>>>>> message these numbers represent? > >>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma > >>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric > >>>>>>>>>>>>>>>> message can be any length but the > >>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group identifiers > >>>>>>>>>>>>>>>> randomly located and the 49 Alpha characters. > >>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by anyone > >>>>>>>>>>>>>>> knowing the rules and the private > >>>>>>>>>>>>>>> key already revealed. > >>>>>>>>>>>>>>> > >>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you need > >>>>>>>>>>>>>> to make > >>>>>>>>>>>>>> sure that every encryption generates a radically different > >>>>>>>>>>>>>> ciphertext, > >>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same > >>>>>>>>>>>>>> plaintext several times in a row would produce very different > >>>>>>>>>>>>>> ciphertexts. > >>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > >>>>>>>>>>>>> alpha character of 26 possibilities > >>>>>>>>>>>>> only the order of these 7 group identifiers is changed after each > >>>>>>>>>>>>> message > >>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). > >>>>>>>>>>>>> Changed randomly. This way no letter connections > >>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few > >>>>>>>>>>>>> messages are sent but then complete contradictory results > >>>>>>>>>>>>> pointing to a letter involved with one particular identifier > >>>>>>>>>>>>> group of 7 letters. > >>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove > >>>>>>>>>>>>> this point. > >>>>>>>>>>>>> The order right now of these group identifiers in this one > >>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in > >>>>>>>>>>>>> odd positions in the private key alpha string --- > >>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > >>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 > >>>>>>>>>>>>> possibilities) chosen from a random table of these > >>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once > >>>>>>>>>>>>> in a while change the random order (predetermined in a certain > >>>>>>>>>>>>> order of vowels and consonance strategically located in all the > >>>>>>>>>>>>> private string (groups of 7) should do the trick.. > >>>>>>>>>>>>> Did you solve the cipher yet? > >>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the > >>>>>>>>>>>>> actual private key and ciphertext associated with it. > >>>>>>>>>>>> > >>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 > >>>>>>>>>>>> corrections you are supposed to solve against the private > >>>>>>>>>>>> alpha key. > >>>>>>>>>>>> When aligning an odd positioned group identifier from the public > >>>>>>>>>>>> key it can only draw one letter from that group > >>>>>>>>>>>> in the private key string. This is because the left to right > >>>>>>>>>>>> movement to align the identifier can't go back to the left > >>>>>>>>>>>> or stay in the same position on that identifier to choose the > >>>>>>>>>>>> first but not the second letter within the same group. > >>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- > >>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > >>>>>>>>>>>> It will be self-explanatory when you solve the cipher. > >>>>>>>>>>>> > >>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. > >>>>>>>>>>> > >>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext > >>>>>>>>>>> several times in a row should create different ciphertexts. Here > >>>>>>>>>>> is a crude example I made of my highly experimental fractal based > >>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically > >>>>>>>>>>> different than my HMAC cipher. Anyway... > >>>>>>>>>>> > >>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact > >>>>>>>>>>> plaintext using the default secret key using the following online > >>>>>>>>>>> program of mine: > >>>>>>>>>>> > >>>>>>>>>>> http://funwithfractals.atspace.cc/ffe > >>>>>>>>>>> > >>>>>>>>>>> The plaintext is: Hello World. > >>>>>>>>>>> > >>>>>>>>>>> 12 bytes > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> ciphertext 0 > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> 0.07464055294813914 0.21413369654338263 > >>>>>>>>>>> 0.18726842930653814 0.15381457747419044 > >>>>>>>>>>> > >>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > >>>>>>>>>>> > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> ciphertext 1 > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> 0.10712703156460045 0.3825663517793289 > >>>>>>>>>>> 0.3822450385558595 0.18493372431673 > >>>>>>>>>>> > >>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > >>>>>>>>>>> > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> ciphertext 2 > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> 0.4562359936711957 0.21850028449704323 > >>>>>>>>>>> 0.3486656373192471 0.3596603216576378 > >>>>>>>>>>> > >>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > >>>>>>>>>>> > >>>>>>>>>>> ______________________________ > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the > >>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a > >>>>>>>>>>> desktop for the crude layout. > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> This is using something called an IV. However, my HMAC cipher > >>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, > >>>>>>>>>>> its not sent in the clear. Read all of: > >>>>>>>>>>> > >>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>>>>>>>> > >>>>>>>>>>> Also, read all of: > >>>>>>>>>>> > >>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > >>>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at > >>>>>>>>>>> what happens to the ciphertext. > >>>>>>>>>> > >>>>>>>>>> Chris, > >>>>>>>>>> It appears to create a few more encrypted 2 character codes than the > >>>>>>>>>> actual number of alpha characters > >>>>>>>>>> in the plaintext in a one-for-one matchup. > >>>>>>>>> > >>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for > >>>>>>>>> each plaintext character. Can you show me an example plaintext where > >>>>>>>>> it creates more? This is different than my HMAC cipher that can > >>>>>>>>> extend the ciphertext and make it larger than the plaintext via > >>>>>>>>> using TRNG random bytes in the plaintext before encrypting. read > >>>>>>>>> all: http://funwithfractals.atspace.cc/ct_cipher > >>>>>>>>> > >>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can > >>>>>>>>> be: _______________________ > >>>>>>>>> 0.12934470968540027 0.025161836871791087 > >>>>>>>>> 0.03337929216249355 0.11671759502753765 > >>>>>>>>> > >>>>>>>>> FF 19 E6 62 D5 > >>>>>>>>> _______________________ > >>>>>>>>> > >>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. > >>>>>>>>> > >>>>>>>>> If you can give me a plaintext that creates more than hexbytes than > >>>>>>>>> the number of characters in the plaintext, please show me! > >>>>>>>>> > >>>>>>>>>> Interesting what is going on there. > >>>>>>>>>> Also, what are the number of mathematical possibilities of creating > >>>>>>>>>> these 2 unique character codes of a mix > >>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final > >>>>>>>>>> total of possibilities? > >>>>>>>>>> Is it 26! *10! ? Probably not that big. > >>>>>>>>> > >>>>>>>>> I am not sure. It depends on how many different secret keys one can > >>>>>>>>> make and how many possibilities of getting the same exact random > >>>>>>>>> IV.[...] > >>>>>>>> > >>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 > >>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be the > >>>>>>>> chances of rolling 5 16 sided die and getting a result X. Okay, now > >>>>>>>> how many times do we need to roll to get X again? Each roll would be > >>>>>>>> a click of the Encrypt button for the same plaintext and secret key. > >>>>>>>> Yes, the secret key comes into play. Because FF 19 E6 62 D5 does not > >>>>>>>> work with another secret key that was not used to create it. > >>>>>>> > >>>>>>> One big question? > >>>>>>> A possible scenario -- > >>>>>>> Joe the encryptor has his own offline encryption algorithm in a > >>>>>>> computer. He copies the encrypted message on a thumb drive and loads > >>>>>>> it into his online computer and sends the encrypted message to his > >>>>>>> foreign opertive Alice. > >>>>>>> Is some other info coming along with that encrypted message? > >>>>>>> There could be something berried in the encrypted hex code? > >>>>>>> My big question is, has this been tried on two separate offline > >>>>>>> systems? > >>>>>>> If this was all done on one system, I was snookered if not then this is > >>>>>>> fantastic. > >>>>>>> On the encryption side algorithm --- plaintext read in. > >>>>>>> On the decryption side hex coding -- read in. > >>>>>>> Two separate systems. > >>>>>>> A Huge advantage if both algorithms are on one system to > >>>>>>> pull a fast one. > >>>>>>> Or a possibility much more data is coming across than just the > >>>>>>> encrypted message? > >>>>>>> > >>>>>>> Just my take an opinion. > >>>>>>> Not accusing you of anything because you have much more talent than I > >>>>>>> on fractals and the whole structure of the two, I hope, separate > >>>>>>> systems.(encryption,decryption) The question needs to be asked. > >>>>>>> > >>>>>>> Whatever just keep producing these great renderings which I find > >>>>>>> fascinating. Also what you produced here, even if it was only on one > >>>>>>> system. > >>>>>> It will work on different systems, online or offline. The full code is > >>>>>> on the webpage. So, Bob can be using his own system, and browser of > >>>>>> choice. Alice can decrypt it using her own system, and browser of > >>>>>> choice. The code is all client side. > >>>>> > >>>>> So Alice is the client-side? (decryptor) > >>>>> If so, it makes no sense. > >>>>> > >>>>> > >>>>> > >>>> Try to decrypt this... Just copy-and-paste the ciphertext between the > >>>> lines into the Cipher Text box in the page, and click the decrypt button. > >>>> > >>>> ________________________________ > >>>> > >>>> 0.39351870705816516 0.12367086856260284 > >>>> 0.10821656063857987 0.5183020398197964 > >>>> > >>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > >>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > >>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > >>>> 49 40 AE E2 > >>>> > >>>> ________________________________ > >>>> > >>>> > >>>> What does it say? > >>> It just comes back with the short message "plaintext" I just erased to > >>> paste in the hex code above. Do I need to paste the four fractional parts > >>> into the lower window also? > >> Or do I run one of your Python algorithms? > > > > > > I am still trying to wrap my head around your encryption/decryption concept. > > Examing your Python code and your explanations. > > Okay Chris, let's draw a crude comparison. > > The German enigma was employed separately within the different military > > groups. The navy, army, airforce. etc. > > Each had a few or more enigma machines at each end of their radio > > communications networks. Like your system, they could send the encrypted code > > either way but each had charts that would dictate any changes to the cypher > > wheels and plugboards with a time and date stamp for that change, even > > allowing for different time zones if necessary. Drawing a comparison to your > > system like the charts but only employed as a special hash function in both > > algorithms that after each message sent and received by either party, Bob or > > Alice, the new duplicate cypher is updated in each algorithm so they match to > > each letter/hex. Crudely put but like the German enigma where each > > combination of the cypher was changed after a period of time instead of after > > each transmission and receiving of YOUR system. Then it is automatically > > updated on both systems algorithms to match any alpha to hex conversion on > > both algorithms to give a new letter/hex cypher. Have I got the comparison > > right? > One difference is that the Enigma encrypting the same message with the > same 'key' resulted in the same ciphertext. Also, the Enigma would > never give a CT letter the same coded letter as the plaintext letter > because of that reflector wheel. We can't forget the plugboard either.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-04-04 14:10 -0400 |
| Message-ID | <s4cvfh$8at$1@gioia.aioe.org> |
| In reply to | #516598 |
djoyce099 pretended : > On Sunday, April 4, 2021 at 5:31:01 AM UTC-4, FromTheRafters wrote: >> djoyce099 explained on 4/3/2021 : >>> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: >>>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: >>>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson >>>>>>> wrote: >>>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: >>>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson >>>>>>>>> wrote: >>>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson >>>>>>>>>>>> wrote: >>>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 >>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. >>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 >>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 >>>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 >>>>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. >>>>>>>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris >>>>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret >>>>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... >>>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are >>>>>>>>>>>>>>>>>>>>>>>>>>> different digits. >>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original >>>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the >>>>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your >>>>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of >>>>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... >>>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting >>>>>>>>>>>>>>>>>>>>>>>> to 2.xyz where x >>>>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider >>>>>>>>>>>>>>>>>>>>>>>> 2.269. >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to >>>>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original >>>>>>>>>>>>>>>>>>>>>>> number that contains the >>>>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, >>>>>>>>>>>>>>>>>>>>>>> spoiler alert: ... >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate >>>>>>>>>>>>>>>>>>>>>> enough? >>>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives >>>>>>>>>>>>>>>>>>>>> the convergents >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be >>>>>>>>>>>>>>>>>>>>> rounding or >>>>>>>>>>>>>>>>>>>>> something. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>>>>>>>> The >>>>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], >>>>>>>>>>>>>>>>>>>>>> which my previously-mentioned >>>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as >>>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 >>>>>>>>>>>>>>>>>>>>>> 12 15 20614211 ...] >>>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of >>>>>>>>>>>>>>>>>>>> the target rational >>>>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. >>>>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer >>>>>>>>>>>>>>>>>>>> message that was encrypted but >>>>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational >>>>>>>>>>>>>>>>>>>> to get the desired number of >>>>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 >>>>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. >>>>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. >>>>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key >>>>>>>>>>>>>>>>>>>> (a string of random letters along with each group number >>>>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the >>>>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted >>>>>>>>>>>>>>>>>>>> message of just the numbers 1-7 and the 7 group >>>>>>>>>>>>>>>>>>>> identifiers. These two strings are placed side by side >>>>>>>>>>>>>>>>>>>> and sliding the ciphertext from left to right and >>>>>>>>>>>>>>>>>>>> aligning each letter with the encrypted numbers of the >>>>>>>>>>>>>>>>>>>> sliding portion of the rule. The examples I have >>>>>>>>>>>>>>>>>>>> previously posted --- A letter is only used once in the >>>>>>>>>>>>>>>>>>>> left to right scan like the word little the first T in >>>>>>>>>>>>>>>>>>>> little is used then the scan continues by the decryptor >>>>>>>>>>>>>>>>>>>> for the second T because this private key string is made >>>>>>>>>>>>>>>>>>>> up of 49 alpha characters = 26*2 minus the second XYZ = >>>>>>>>>>>>>>>>>>>> 49 Alpha characters and 1-7 group identifiers placed in >>>>>>>>>>>>>>>>>>>> the odd count positions. Example below where this is easy >>>>>>>>>>>>>>>>>>>> to decrypt by just this simple method -- >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public >>>>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching >>>>>>>>>>>>>>>>>>>> the end of the fixed private key the cipher is brought >>>>>>>>>>>>>>>>>>>> back <--- (no scan ) and scanning ----> again for the >>>>>>>>>>>>>>>>>>>> correct letter alignment to be cherry-picked from the >>>>>>>>>>>>>>>>>>>> private key. This is giving the whole cipher idea away >>>>>>>>>>>>>>>>>>>> but the order of the characters in the private key can be >>>>>>>>>>>>>>>>>>>> drastically changed along with the group identifiers then >>>>>>>>>>>>>>>>>>>> the public key would be useless to the person without the >>>>>>>>>>>>>>>>>>>> new private string. In a completed scan (end of too the >>>>>>>>>>>>>>>>>>>> right ------>), there could be several stops for letter >>>>>>>>>>>>>>>>>>>> alignments. I am just using this analogy of sliding but >>>>>>>>>>>>>>>>>>>> the right parsing of strings in both algorithms would get >>>>>>>>>>>>>>>>>>>> the job done. The above decryption of the public key >>>>>>>>>>>>>>>>>>>> above is easy if you follow the rules. >>>>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms >>>>>>>>>>>>>>>>>>>> I produced in basic on my commodore 64 back in the 80s >>>>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these >>>>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. >>>>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not >>>>>>>>>>>>>>>>>>>> getting anywhere yet. >>>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher >>>>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? >>>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the >>>>>>>>>>>>>>>>>> above nature the group identifiers could be changed >>>>>>>>>>>>>>>>>> to a different identifier position after each message sent. >>>>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected >>>>>>>>>>>>>>>>>> even though some >>>>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any >>>>>>>>>>>>>>>>>> pattern possible with future cipher messages. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written >>>>>>>>>>>>>>>>>> message these numbers represent? >>>>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma >>>>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric >>>>>>>>>>>>>>>>>> message can be any length but the >>>>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group >>>>>>>>>>>>>>>>>> identifiers randomly located and the 49 Alpha characters. >>>>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by >>>>>>>>>>>>>>>>> anyone knowing the rules and the private >>>>>>>>>>>>>>>>> key already revealed. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you >>>>>>>>>>>>>>>> need to make >>>>>>>>>>>>>>>> sure that every encryption generates a radically different >>>>>>>>>>>>>>>> ciphertext, >>>>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same >>>>>>>>>>>>>>>> plaintext several times in a row would produce very different >>>>>>>>>>>>>>>> ciphertexts. >>>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an >>>>>>>>>>>>>>> alpha character of 26 possibilities >>>>>>>>>>>>>>> only the order of these 7 group identifiers is changed after >>>>>>>>>>>>>>> each message >>>>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). >>>>>>>>>>>>>>> Changed randomly. This way no letter connections >>>>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few >>>>>>>>>>>>>>> messages are sent but then complete contradictory results >>>>>>>>>>>>>>> pointing to a letter involved with one particular identifier >>>>>>>>>>>>>>> group of 7 letters. >>>>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove >>>>>>>>>>>>>>> this point. >>>>>>>>>>>>>>> The order right now of these group identifiers in this one >>>>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in >>>>>>>>>>>>>>> odd positions in the private key alpha string --- >>>>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 >>>>>>>>>>>>>>> possibilities) chosen from a random table of these >>>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once >>>>>>>>>>>>>>> in a while change the random order (predetermined in a certain >>>>>>>>>>>>>>> order of vowels and consonance strategically located in all the >>>>>>>>>>>>>>> private string (groups of 7) should do the trick.. >>>>>>>>>>>>>>> Did you solve the cipher yet? >>>>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the >>>>>>>>>>>>>>> actual private key and ciphertext associated with it. >>>>>>>>>>>>>> >>>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 >>>>>>>>>>>>>> corrections you are supposed to solve against the private >>>>>>>>>>>>>> alpha key. >>>>>>>>>>>>>> When aligning an odd positioned group identifier from the public >>>>>>>>>>>>>> key it can only draw one letter from that group >>>>>>>>>>>>>> in the private key string. This is because the left to right >>>>>>>>>>>>>> movement to align the identifier can't go back to the left >>>>>>>>>>>>>> or stay in the same position on that identifier to choose the >>>>>>>>>>>>>> first but not the second letter within the same group. >>>>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- >>>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 >>>>>>>>>>>>>> It will be self-explanatory when you solve the cipher. >>>>>>>>>>>>>> >>>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>>>>>>>> >>>>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext >>>>>>>>>>>>> several times in a row should create different ciphertexts. Here >>>>>>>>>>>>> is a crude example I made of my highly experimental fractal based >>>>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically >>>>>>>>>>>>> different than my HMAC cipher. Anyway... >>>>>>>>>>>>> >>>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact >>>>>>>>>>>>> plaintext using the default secret key using the following online >>>>>>>>>>>>> program of mine: >>>>>>>>>>>>> >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>>>>>>>> >>>>>>>>>>>>> The plaintext is: Hello World. >>>>>>>>>>>>> >>>>>>>>>>>>> 12 bytes >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 0 >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 >>>>>>>>>>>>> 0.18726842930653814 0.15381457747419044 >>>>>>>>>>>>> >>>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>>>>>>>> >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 1 >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 >>>>>>>>>>>>> 0.3822450385558595 0.18493372431673 >>>>>>>>>>>>> >>>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>>>>>>>> >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 2 >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 >>>>>>>>>>>>> 0.3486656373192471 0.3596603216576378 >>>>>>>>>>>>> >>>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>>>>>>>> >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the >>>>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a >>>>>>>>>>>>> desktop for the crude layout. >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> This is using something called an IV. However, my HMAC cipher >>>>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, >>>>>>>>>>>>> its not sent in the clear. Read all of: >>>>>>>>>>>>> >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>>>> >>>>>>>>>>>>> Also, read all of: >>>>>>>>>>>>> >>>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at >>>>>>>>>>>>> what happens to the ciphertext. >>>>>>>>>>>> >>>>>>>>>>>> Chris, >>>>>>>>>>>> It appears to create a few more encrypted 2 character codes than >>>>>>>>>>>> the actual number of alpha characters >>>>>>>>>>>> in the plaintext in a one-for-one matchup. >>>>>>>>>>> >>>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for >>>>>>>>>>> each plaintext character. Can you show me an example plaintext >>>>>>>>>>> where it creates more? This is different than my HMAC cipher that >>>>>>>>>>> can extend the ciphertext and make it larger than the plaintext >>>>>>>>>>> via using TRNG random bytes in the plaintext before encrypting. >>>>>>>>>>> read all: http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>> >>>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can >>>>>>>>>>> be: _______________________ >>>>>>>>>>> 0.12934470968540027 0.025161836871791087 >>>>>>>>>>> 0.03337929216249355 0.11671759502753765 >>>>>>>>>>> >>>>>>>>>>> FF 19 E6 62 D5 >>>>>>>>>>> _______________________ >>>>>>>>>>> >>>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>>>>>>>> >>>>>>>>>>> If you can give me a plaintext that creates more than hexbytes than >>>>>>>>>>> the number of characters in the plaintext, please show me! >>>>>>>>>>> >>>>>>>>>>>> Interesting what is going on there. >>>>>>>>>>>> Also, what are the number of mathematical possibilities of >>>>>>>>>>>> creating these 2 unique character codes of a mix >>>>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final >>>>>>>>>>>> total of possibilities? >>>>>>>>>>>> Is it 26! *10! ? Probably not that big. >>>>>>>>>>> >>>>>>>>>>> I am not sure. It depends on how many different secret keys one can >>>>>>>>>>> make and how many possibilities of getting the same exact random >>>>>>>>>>> IV.[...] >>>>>>>>>> >>>>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 >>>>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be >>>>>>>>>> the chances of rolling 5 16 sided die and getting a result X. Okay, >>>>>>>>>> now how many times do we need to roll to get X again? Each roll >>>>>>>>>> would be a click of the Encrypt button for the same plaintext and >>>>>>>>>> secret key. Yes, the secret key comes into play. Because FF 19 E6 >>>>>>>>>> 62 D5 does not work with another secret key that was not used to >>>>>>>>>> create it. >>>>>>>>> >>>>>>>>> One big question? >>>>>>>>> A possible scenario -- >>>>>>>>> Joe the encryptor has his own offline encryption algorithm in a >>>>>>>>> computer. He copies the encrypted message on a thumb drive and loads >>>>>>>>> it into his online computer and sends the encrypted message to his >>>>>>>>> foreign opertive Alice. >>>>>>>>> Is some other info coming along with that encrypted message? >>>>>>>>> There could be something berried in the encrypted hex code? >>>>>>>>> My big question is, has this been tried on two separate offline >>>>>>>>> systems? >>>>>>>>> If this was all done on one system, I was snookered if not then this >>>>>>>>> is fantastic. >>>>>>>>> On the encryption side algorithm --- plaintext read in. >>>>>>>>> On the decryption side hex coding -- read in. >>>>>>>>> Two separate systems. >>>>>>>>> A Huge advantage if both algorithms are on one system to >>>>>>>>> pull a fast one. >>>>>>>>> Or a possibility much more data is coming across than just the >>>>>>>>> encrypted message? >>>>>>>>> >>>>>>>>> Just my take an opinion. >>>>>>>>> Not accusing you of anything because you have much more talent than I >>>>>>>>> on fractals and the whole structure of the two, I hope, separate >>>>>>>>> systems.(encryption,decryption) The question needs to be asked. >>>>>>>>> >>>>>>>>> Whatever just keep producing these great renderings which I find >>>>>>>>> fascinating. Also what you produced here, even if it was only on one >>>>>>>>> system. >>>>>>>> It will work on different systems, online or offline. The full code is >>>>>>>> on the webpage. So, Bob can be using his own system, and browser of >>>>>>>> choice. Alice can decrypt it using her own system, and browser of >>>>>>>> choice. The code is all client side. >>>>>>> >>>>>>> So Alice is the client-side? (decryptor) >>>>>>> If so, it makes no sense. >>>>>>> >>>>>>> >>>>>>> >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>>>> lines into the Cipher Text box in the page, and click the decrypt >>>>>> button. >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> 0.39351870705816516 0.12367086856260284 >>>>>> 0.10821656063857987 0.5183020398197964 >>>>>> >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>>>> 49 40 AE E2 >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> >>>>>> What does it say? >>>>> It just comes back with the short message "plaintext" I just erased to >>>>> paste in the hex code above. Do I need to paste the four fractional parts >>>>> into the lower window also? >>>> Or do I run one of your Python algorithms? >>> >>> >>> I am still trying to wrap my head around your encryption/decryption >>> concept. Examing your Python code and your explanations. >>> Okay Chris, let's draw a crude comparison. >>> The German enigma was employed separately within the different military >>> groups. The navy, army, airforce. etc. >>> Each had a few or more enigma machines at each end of their radio >>> communications networks. Like your system, they could send the encrypted >>> code either way but each had charts that would dictate any changes to the >>> cypher wheels and plugboards with a time and date stamp for that change, >>> even allowing for different time zones if necessary. Drawing a comparison >>> to your system like the charts but only employed as a special hash >>> function in both algorithms that after each message sent and received by >>> either party, Bob or Alice, the new duplicate cypher is updated in each >>> algorithm so they match to each letter/hex. Crudely put but like the >>> German enigma where each combination of the cypher was changed after a >>> period of time instead of after each transmission and receiving of YOUR >>> system. Then it is automatically updated on both systems algorithms to >>> match any alpha to hex conversion on both algorithms to give a new >>> letter/hex cypher. Have I got the comparison right? >> One difference is that the Enigma encrypting the same message with the >> same 'key' resulted in the same ciphertext. Also, the Enigma would >> never give a CT letter the same coded letter as the plaintext letter >> because of that reflector wheel. > > We can't forget the plugboard either. All part of the "key".
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-04 13:29 -0700 |
| Message-ID | <fd5878ea-59c8-4a30-81c6-28279f72e06bn@googlegroups.com> |
| In reply to | #516604 |
On Sunday, April 4, 2021 at 2:11:11 PM UTC-4, FromTheRafters wrote: > djoyce099 pretended : > > On Sunday, April 4, 2021 at 5:31:01 AM UTC-4, FromTheRafters wrote: > >> djoyce099 explained on 4/3/2021 : > >>> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: > >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > >>>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: > >>>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson > >>>>>>> wrote: > >>>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: > >>>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson > >>>>>>>>> wrote: > >>>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > >>>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > >>>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson > >>>>>>>>>>>> wrote: > >>>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 > >>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. > >>>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 > >>>>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 > >>>>>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 > >>>>>>>>>>>>>>>>>>> wrote: > >>>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > >>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > >>>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris > >>>>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: > >>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > >>>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > >>>>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... > >>>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > >>>>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > >>>>>>>>>>>>>>>>>>>>>>>>>>> different digits. > >>>>>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original > >>>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the > >>>>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > >>>>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of > >>>>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... > >>>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > >>>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting > >>>>>>>>>>>>>>>>>>>>>>>> to 2.xyz where x > >>>>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider > >>>>>>>>>>>>>>>>>>>>>>>> 2.269. > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to > >>>>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original > >>>>>>>>>>>>>>>>>>>>>>> number that contains the > >>>>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, > >>>>>>>>>>>>>>>>>>>>>>> spoiler alert: ... > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> //// > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello > >>>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>>> ;^) > >>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate > >>>>>>>>>>>>>>>>>>>>>> enough? > >>>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives > >>>>>>>>>>>>>>>>>>>>> the convergents > >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > >>>>>>>>>>>>>>>>>>>>> rounding or > >>>>>>>>>>>>>>>>>>>>> something. > >>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > >>>>>>>>>>>>>>>>>>>>>> The > >>>>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], > >>>>>>>>>>>>>>>>>>>>>> which my previously-mentioned > >>>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as > >>>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > >>>>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 > >>>>>>>>>>>>>>>>>>>>>> 12 15 20614211 ...] > >>>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of > >>>>>>>>>>>>>>>>>>>> the target rational > >>>>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > >>>>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer > >>>>>>>>>>>>>>>>>>>> message that was encrypted but > >>>>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational > >>>>>>>>>>>>>>>>>>>> to get the desired number of > >>>>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > >>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 > >>>>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. > >>>>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > >>>>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > >>>>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key > >>>>>>>>>>>>>>>>>>>> (a string of random letters along with each group number > >>>>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the > >>>>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted > >>>>>>>>>>>>>>>>>>>> message of just the numbers 1-7 and the 7 group > >>>>>>>>>>>>>>>>>>>> identifiers. These two strings are placed side by side > >>>>>>>>>>>>>>>>>>>> and sliding the ciphertext from left to right and > >>>>>>>>>>>>>>>>>>>> aligning each letter with the encrypted numbers of the > >>>>>>>>>>>>>>>>>>>> sliding portion of the rule. The examples I have > >>>>>>>>>>>>>>>>>>>> previously posted --- A letter is only used once in the > >>>>>>>>>>>>>>>>>>>> left to right scan like the word little the first T in > >>>>>>>>>>>>>>>>>>>> little is used then the scan continues by the decryptor > >>>>>>>>>>>>>>>>>>>> for the second T because this private key string is made > >>>>>>>>>>>>>>>>>>>> up of 49 alpha characters = 26*2 minus the second XYZ = > >>>>>>>>>>>>>>>>>>>> 49 Alpha characters and 1-7 group identifiers placed in > >>>>>>>>>>>>>>>>>>>> the odd count positions. Example below where this is easy > >>>>>>>>>>>>>>>>>>>> to decrypt by just this simple method -- > >>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > >>>>>>>>>>>>>>>>>>>> Fixed private > >>>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > >>>>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public > >>>>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching > >>>>>>>>>>>>>>>>>>>> the end of the fixed private key the cipher is brought > >>>>>>>>>>>>>>>>>>>> back <--- (no scan ) and scanning ----> again for the > >>>>>>>>>>>>>>>>>>>> correct letter alignment to be cherry-picked from the > >>>>>>>>>>>>>>>>>>>> private key. This is giving the whole cipher idea away > >>>>>>>>>>>>>>>>>>>> but the order of the characters in the private key can be > >>>>>>>>>>>>>>>>>>>> drastically changed along with the group identifiers then > >>>>>>>>>>>>>>>>>>>> the public key would be useless to the person without the > >>>>>>>>>>>>>>>>>>>> new private string. In a completed scan (end of too the > >>>>>>>>>>>>>>>>>>>> right ------>), there could be several stops for letter > >>>>>>>>>>>>>>>>>>>> alignments. I am just using this analogy of sliding but > >>>>>>>>>>>>>>>>>>>> the right parsing of strings in both algorithms would get > >>>>>>>>>>>>>>>>>>>> the job done. The above decryption of the public key > >>>>>>>>>>>>>>>>>>>> above is easy if you follow the rules. > >>>>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms > >>>>>>>>>>>>>>>>>>>> I produced in basic on my commodore 64 back in the 80s > >>>>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these > >>>>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. > >>>>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > >>>>>>>>>>>>>>>>>>>> getting anywhere yet. > >>>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher > >>>>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? > >>>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the > >>>>>>>>>>>>>>>>>> above nature the group identifiers could be changed > >>>>>>>>>>>>>>>>>> to a different identifier position after each message sent. > >>>>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected > >>>>>>>>>>>>>>>>>> even though some > >>>>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any > >>>>>>>>>>>>>>>>>> pattern possible with future cipher messages. > >>>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > >>>>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- > >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > >>>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written > >>>>>>>>>>>>>>>>>> message these numbers represent? > >>>>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma > >>>>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric > >>>>>>>>>>>>>>>>>> message can be any length but the > >>>>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group > >>>>>>>>>>>>>>>>>> identifiers randomly located and the 49 Alpha characters. > >>>>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by > >>>>>>>>>>>>>>>>> anyone knowing the rules and the private > >>>>>>>>>>>>>>>>> key already revealed. > >>>>>>>>>>>>>>>>> > >>>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you > >>>>>>>>>>>>>>>> need to make > >>>>>>>>>>>>>>>> sure that every encryption generates a radically different > >>>>>>>>>>>>>>>> ciphertext, > >>>>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same > >>>>>>>>>>>>>>>> plaintext several times in a row would produce very different > >>>>>>>>>>>>>>>> ciphertexts. > >>>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > >>>>>>>>>>>>>>> alpha character of 26 possibilities > >>>>>>>>>>>>>>> only the order of these 7 group identifiers is changed after > >>>>>>>>>>>>>>> each message > >>>>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). > >>>>>>>>>>>>>>> Changed randomly. This way no letter connections > >>>>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few > >>>>>>>>>>>>>>> messages are sent but then complete contradictory results > >>>>>>>>>>>>>>> pointing to a letter involved with one particular identifier > >>>>>>>>>>>>>>> group of 7 letters. > >>>>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove > >>>>>>>>>>>>>>> this point. > >>>>>>>>>>>>>>> The order right now of these group identifiers in this one > >>>>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in > >>>>>>>>>>>>>>> odd positions in the private key alpha string --- > >>>>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > >>>>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 > >>>>>>>>>>>>>>> possibilities) chosen from a random table of these > >>>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once > >>>>>>>>>>>>>>> in a while change the random order (predetermined in a certain > >>>>>>>>>>>>>>> order of vowels and consonance strategically located in all the > >>>>>>>>>>>>>>> private string (groups of 7) should do the trick.. > >>>>>>>>>>>>>>> Did you solve the cipher yet? > >>>>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the > >>>>>>>>>>>>>>> actual private key and ciphertext associated with it. > >>>>>>>>>>>>>> > >>>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 > >>>>>>>>>>>>>> corrections you are supposed to solve against the private > >>>>>>>>>>>>>> alpha key. > >>>>>>>>>>>>>> When aligning an odd positioned group identifier from the public > >>>>>>>>>>>>>> key it can only draw one letter from that group > >>>>>>>>>>>>>> in the private key string. This is because the left to right > >>>>>>>>>>>>>> movement to align the identifier can't go back to the left > >>>>>>>>>>>>>> or stay in the same position on that identifier to choose the > >>>>>>>>>>>>>> first but not the second letter within the same group. > >>>>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- > >>>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > >>>>>>>>>>>>>> It will be self-explanatory when you solve the cipher. > >>>>>>>>>>>>>> > >>>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. > >>>>>>>>>>>>> > >>>>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext > >>>>>>>>>>>>> several times in a row should create different ciphertexts. Here > >>>>>>>>>>>>> is a crude example I made of my highly experimental fractal based > >>>>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically > >>>>>>>>>>>>> different than my HMAC cipher. Anyway... > >>>>>>>>>>>>> > >>>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact > >>>>>>>>>>>>> plaintext using the default secret key using the following online > >>>>>>>>>>>>> program of mine: > >>>>>>>>>>>>> > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe > >>>>>>>>>>>>> > >>>>>>>>>>>>> The plaintext is: Hello World. > >>>>>>>>>>>>> > >>>>>>>>>>>>> 12 bytes > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> ciphertext 0 > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 > >>>>>>>>>>>>> 0.18726842930653814 0.15381457747419044 > >>>>>>>>>>>>> > >>>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > >>>>>>>>>>>>> > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> ciphertext 1 > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 > >>>>>>>>>>>>> 0.3822450385558595 0.18493372431673 > >>>>>>>>>>>>> > >>>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > >>>>>>>>>>>>> > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> ciphertext 2 > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 > >>>>>>>>>>>>> 0.3486656373192471 0.3596603216576378 > >>>>>>>>>>>>> > >>>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > >>>>>>>>>>>>> > >>>>>>>>>>>>> ______________________________ > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the > >>>>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a > >>>>>>>>>>>>> desktop for the crude layout. > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> This is using something called an IV. However, my HMAC cipher > >>>>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, > >>>>>>>>>>>>> its not sent in the clear. Read all of: > >>>>>>>>>>>>> > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>>>>>>>>>> > >>>>>>>>>>>>> Also, read all of: > >>>>>>>>>>>>> > >>>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > >>>>>>>>>>>>> > >>>>>>>>>>>>> > >>>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at > >>>>>>>>>>>>> what happens to the ciphertext. > >>>>>>>>>>>> > >>>>>>>>>>>> Chris, > >>>>>>>>>>>> It appears to create a few more encrypted 2 character codes than > >>>>>>>>>>>> the actual number of alpha characters > >>>>>>>>>>>> in the plaintext in a one-for-one matchup. > >>>>>>>>>>> > >>>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for > >>>>>>>>>>> each plaintext character. Can you show me an example plaintext > >>>>>>>>>>> where it creates more? This is different than my HMAC cipher that > >>>>>>>>>>> can extend the ciphertext and make it larger than the plaintext > >>>>>>>>>>> via using TRNG random bytes in the plaintext before encrypting. > >>>>>>>>>>> read all: http://funwithfractals.atspace.cc/ct_cipher > >>>>>>>>>>> > >>>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can > >>>>>>>>>>> be: _______________________ > >>>>>>>>>>> 0.12934470968540027 0.025161836871791087 > >>>>>>>>>>> 0.03337929216249355 0.11671759502753765 > >>>>>>>>>>> > >>>>>>>>>>> FF 19 E6 62 D5 > >>>>>>>>>>> _______________________ > >>>>>>>>>>> > >>>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. > >>>>>>>>>>> > >>>>>>>>>>> If you can give me a plaintext that creates more than hexbytes than > >>>>>>>>>>> the number of characters in the plaintext, please show me! > >>>>>>>>>>> > >>>>>>>>>>>> Interesting what is going on there. > >>>>>>>>>>>> Also, what are the number of mathematical possibilities of > >>>>>>>>>>>> creating these 2 unique character codes of a mix > >>>>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final > >>>>>>>>>>>> total of possibilities? > >>>>>>>>>>>> Is it 26! *10! ? Probably not that big. > >>>>>>>>>>> > >>>>>>>>>>> I am not sure. It depends on how many different secret keys one can > >>>>>>>>>>> make and how many possibilities of getting the same exact random > >>>>>>>>>>> IV.[...] > >>>>>>>>>> > >>>>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 > >>>>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be > >>>>>>>>>> the chances of rolling 5 16 sided die and getting a result X. Okay, > >>>>>>>>>> now how many times do we need to roll to get X again? Each roll > >>>>>>>>>> would be a click of the Encrypt button for the same plaintext and > >>>>>>>>>> secret key. Yes, the secret key comes into play. Because FF 19 E6 > >>>>>>>>>> 62 D5 does not work with another secret key that was not used to > >>>>>>>>>> create it. > >>>>>>>>> > >>>>>>>>> One big question? > >>>>>>>>> A possible scenario -- > >>>>>>>>> Joe the encryptor has his own offline encryption algorithm in a > >>>>>>>>> computer. He copies the encrypted message on a thumb drive and loads > >>>>>>>>> it into his online computer and sends the encrypted message to his > >>>>>>>>> foreign opertive Alice. > >>>>>>>>> Is some other info coming along with that encrypted message? > >>>>>>>>> There could be something berried in the encrypted hex code? > >>>>>>>>> My big question is, has this been tried on two separate offline > >>>>>>>>> systems? > >>>>>>>>> If this was all done on one system, I was snookered if not then this > >>>>>>>>> is fantastic. > >>>>>>>>> On the encryption side algorithm --- plaintext read in. > >>>>>>>>> On the decryption side hex coding -- read in. > >>>>>>>>> Two separate systems. > >>>>>>>>> A Huge advantage if both algorithms are on one system to > >>>>>>>>> pull a fast one. > >>>>>>>>> Or a possibility much more data is coming across than just the > >>>>>>>>> encrypted message? > >>>>>>>>> > >>>>>>>>> Just my take an opinion. > >>>>>>>>> Not accusing you of anything because you have much more talent than I > >>>>>>>>> on fractals and the whole structure of the two, I hope, separate > >>>>>>>>> systems.(encryption,decryption) The question needs to be asked. > >>>>>>>>> > >>>>>>>>> Whatever just keep producing these great renderings which I find > >>>>>>>>> fascinating. Also what you produced here, even if it was only on one > >>>>>>>>> system. > >>>>>>>> It will work on different systems, online or offline. The full code is > >>>>>>>> on the webpage. So, Bob can be using his own system, and browser of > >>>>>>>> choice. Alice can decrypt it using her own system, and browser of > >>>>>>>> choice. The code is all client side. > >>>>>>> > >>>>>>> So Alice is the client-side? (decryptor) > >>>>>>> If so, it makes no sense. > >>>>>>> > >>>>>>> > >>>>>>> > >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the > >>>>>> lines into the Cipher Text box in the page, and click the decrypt > >>>>>> button. > >>>>>> > >>>>>> ________________________________ > >>>>>> > >>>>>> 0.39351870705816516 0.12367086856260284 > >>>>>> 0.10821656063857987 0.5183020398197964 > >>>>>> > >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > >>>>>> 49 40 AE E2 > >>>>>> > >>>>>> ________________________________ > >>>>>> > >>>>>> > >>>>>> What does it say? > >>>>> It just comes back with the short message "plaintext" I just erased to > >>>>> paste in the hex code above. Do I need to paste the four fractional parts > >>>>> into the lower window also? > >>>> Or do I run one of your Python algorithms? > >>> > >>> > >>> I am still trying to wrap my head around your encryption/decryption > >>> concept. Examing your Python code and your explanations. > >>> Okay Chris, let's draw a crude comparison. > >>> The German enigma was employed separately within the different military > >>> groups. The navy, army, airforce. etc. > >>> Each had a few or more enigma machines at each end of their radio > >>> communications networks. Like your system, they could send the encrypted > >>> code either way but each had charts that would dictate any changes to the > >>> cypher wheels and plugboards with a time and date stamp for that change, > >>> even allowing for different time zones if necessary. Drawing a comparison > >>> to your system like the charts but only employed as a special hash > >>> function in both algorithms that after each message sent and received by > >>> either party, Bob or Alice, the new duplicate cypher is updated in each > >>> algorithm so they match to each letter/hex. Crudely put but like the > >>> German enigma where each combination of the cypher was changed after a > >>> period of time instead of after each transmission and receiving of YOUR > >>> system. Then it is automatically updated on both systems algorithms to > >>> match any alpha to hex conversion on both algorithms to give a new > >>> letter/hex cypher. Have I got the comparison right? > >> One difference is that the Enigma encrypting the same message with the > >> same 'key' resulted in the same ciphertext. Also, the Enigma would > >> never give a CT letter the same coded letter as the plaintext letter > >> because of that reflector wheel. > > > > We can't forget the plugboard either. > All part of the "key". What about my idea for a private key that only 7 numbers (Alpha group identifiers) have to be changed after each message sent whereas both sides could send these encrypted messages. These 7 group identifiers would be protecting the identity of the onetime random order set for each of the 7 Alpha characters within each group. This eliminates any possible outside attack on repeated messages where the identifiers are not changed they may identify where some Alpha characters are located within each group after analyzing many messages. A private key string read from left to right holding 7 random groups of 7 alpha characters and 7 group identifiers placed only in odd count positions of the string. When the scan (read) of the string has reached the end of the string it just starts the scan at the beginning of the string again. This happens as many times as needed for each message. Only one letter can be drawn from any one particular group on each scan. The random order of the 7 group identifiers is only changed after each completed message. The set random order for the Alpha characters within each group of 7 is not changed. 49 Alpha characters -- 26*2 = 52 minus one X, one Y, and one Z = 49 Alpha characters and 7 group identifiers 1-7 for a total string length of 56. The encrypted numbers are run across the bottom of the string and alining each group identifier starting at the beginning of the encrypted message. Say the first identifier, the start of the encrypted message is 3. The left-right scan (read) stops at 3 then from the next number after the identifier is 5 the alpha character in that position is T. So the first letter of the encrypted message is a T and so on. Only drawing a limit of one letter from any one group on every completed scan. Reaching the end of the string and then starting the scan from the start of the string again until each number in the even positions of the encryption has drawn a letter to complete the plain text message. Example of a private key string --- 2KPMJNOL5VQSUWRT4KHMNJIL6IDCGHFE1BECGFDA3SOQUTRP7YAVXBWZ And an encrypted public message created from the above private key --- 574267274635574767113626554462326431523446632147712454433767163273673657426727177771663274 This message contains all the letters of the Alphabet. Just follow the K-I-S-S rules above and you can decrypt it very easily by scanning and comparing the above private key with the public key over and over from left to right. The latter part of the encryption shows 4 7's but it does not break the rule of 1 letter limit from one particular group per complete scan. It actually scans again the whole string and picks up the only Y in the string whereas the previous letter was also in the 7TH group and the only one of the 3 letters represented just once in the string. A nice little hint. These one-timers (XYZ) also could be spread out a little more in the string where all 3 reside in group 7 identifier.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-05 06:27 -0700 |
| Message-ID | <75aa6e69-7af1-495b-ae16-7028124f56e0n@googlegroups.com> |
| In reply to | #516621 |
On Sunday, April 4, 2021 at 4:29:50 PM UTC-4, djoyce099 wrote: > On Sunday, April 4, 2021 at 2:11:11 PM UTC-4, FromTheRafters wrote: > > djoyce099 pretended : > > > On Sunday, April 4, 2021 at 5:31:01 AM UTC-4, FromTheRafters wrote: > > >> djoyce099 explained on 4/3/2021 : > > >>> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: > > >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > > >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > > >>>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: > > >>>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson > > >>>>>>> wrote: > > >>>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: > > >>>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson > > >>>>>>>>> wrote: > > >>>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > > >>>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > > >>>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson > > >>>>>>>>>>>> wrote: > > >>>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > > >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 > > >>>>>>>>>>>>>> wrote: > > >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. > > >>>>>>>>>>>>>>> Thomasson wrote: > > >>>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > > >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 > > >>>>>>>>>>>>>>>>> wrote: > > >>>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 > > >>>>>>>>>>>>>>>>>> wrote: > > >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 > > >>>>>>>>>>>>>>>>>>> wrote: > > >>>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > > >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > >>>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > > >>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > >>>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > > >>>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris > > >>>>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: > > >>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > > >>>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > > >>>>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... > > >>>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > > >>>>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > > >>>>>>>>>>>>>>>>>>>>>>>>>>> different digits. > > >>>>>>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original > > >>>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the > > >>>>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > > >>>>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of > > >>>>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... > > >>>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > > >>>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting > > >>>>>>>>>>>>>>>>>>>>>>>> to 2.xyz where x > > >>>>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider > > >>>>>>>>>>>>>>>>>>>>>>>> 2.269. > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to > > >>>>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original > > >>>>>>>>>>>>>>>>>>>>>>> number that contains the > > >>>>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, > > >>>>>>>>>>>>>>>>>>>>>>> spoiler alert: ... > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> //// > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello > > >>>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>>> ;^) > > >>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate > > >>>>>>>>>>>>>>>>>>>>>> enough? > > >>>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives > > >>>>>>>>>>>>>>>>>>>>> the convergents > > >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > > >>>>>>>>>>>>>>>>>>>>> rounding or > > >>>>>>>>>>>>>>>>>>>>> something. > > >>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > > >>>>>>>>>>>>>>>>>>>>>> The > > >>>>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], > > >>>>>>>>>>>>>>>>>>>>>> which my previously-mentioned > > >>>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as > > >>>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > > >>>>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 > > >>>>>>>>>>>>>>>>>>>>>> 12 15 20614211 ...] > > >>>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of > > >>>>>>>>>>>>>>>>>>>> the target rational > > >>>>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > > >>>>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer > > >>>>>>>>>>>>>>>>>>>> message that was encrypted but > > >>>>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational > > >>>>>>>>>>>>>>>>>>>> to get the desired number of > > >>>>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > > >>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 > > >>>>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. > > >>>>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > > >>>>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > > >>>>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key > > >>>>>>>>>>>>>>>>>>>> (a string of random letters along with each group number > > >>>>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the > > >>>>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted > > >>>>>>>>>>>>>>>>>>>> message of just the numbers 1-7 and the 7 group > > >>>>>>>>>>>>>>>>>>>> identifiers. These two strings are placed side by side > > >>>>>>>>>>>>>>>>>>>> and sliding the ciphertext from left to right and > > >>>>>>>>>>>>>>>>>>>> aligning each letter with the encrypted numbers of the > > >>>>>>>>>>>>>>>>>>>> sliding portion of the rule. The examples I have > > >>>>>>>>>>>>>>>>>>>> previously posted --- A letter is only used once in the > > >>>>>>>>>>>>>>>>>>>> left to right scan like the word little the first T in > > >>>>>>>>>>>>>>>>>>>> little is used then the scan continues by the decryptor > > >>>>>>>>>>>>>>>>>>>> for the second T because this private key string is made > > >>>>>>>>>>>>>>>>>>>> up of 49 alpha characters = 26*2 minus the second XYZ = > > >>>>>>>>>>>>>>>>>>>> 49 Alpha characters and 1-7 group identifiers placed in > > >>>>>>>>>>>>>>>>>>>> the odd count positions. Example below where this is easy > > >>>>>>>>>>>>>>>>>>>> to decrypt by just this simple method -- > > >>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > > >>>>>>>>>>>>>>>>>>>> Fixed private > > >>>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- > > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > > >>>>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > >>>>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public > > >>>>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching > > >>>>>>>>>>>>>>>>>>>> the end of the fixed private key the cipher is brought > > >>>>>>>>>>>>>>>>>>>> back <--- (no scan ) and scanning ----> again for the > > >>>>>>>>>>>>>>>>>>>> correct letter alignment to be cherry-picked from the > > >>>>>>>>>>>>>>>>>>>> private key. This is giving the whole cipher idea away > > >>>>>>>>>>>>>>>>>>>> but the order of the characters in the private key can be > > >>>>>>>>>>>>>>>>>>>> drastically changed along with the group identifiers then > > >>>>>>>>>>>>>>>>>>>> the public key would be useless to the person without the > > >>>>>>>>>>>>>>>>>>>> new private string. In a completed scan (end of too the > > >>>>>>>>>>>>>>>>>>>> right ------>), there could be several stops for letter > > >>>>>>>>>>>>>>>>>>>> alignments. I am just using this analogy of sliding but > > >>>>>>>>>>>>>>>>>>>> the right parsing of strings in both algorithms would get > > >>>>>>>>>>>>>>>>>>>> the job done. The above decryption of the public key > > >>>>>>>>>>>>>>>>>>>> above is easy if you follow the rules. > > >>>>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms > > >>>>>>>>>>>>>>>>>>>> I produced in basic on my commodore 64 back in the 80s > > >>>>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these > > >>>>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. > > >>>>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > > >>>>>>>>>>>>>>>>>>>> getting anywhere yet. > > >>>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher > > >>>>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? > > >>>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the > > >>>>>>>>>>>>>>>>>> above nature the group identifiers could be changed > > >>>>>>>>>>>>>>>>>> to a different identifier position after each message sent. > > >>>>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected > > >>>>>>>>>>>>>>>>>> even though some > > >>>>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any > > >>>>>>>>>>>>>>>>>> pattern possible with future cipher messages. > > >>>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > > >>>>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- > > >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > >>>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written > > >>>>>>>>>>>>>>>>>> message these numbers represent? > > >>>>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma > > >>>>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric > > >>>>>>>>>>>>>>>>>> message can be any length but the > > >>>>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group > > >>>>>>>>>>>>>>>>>> identifiers randomly located and the 49 Alpha characters. > > >>>>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by > > >>>>>>>>>>>>>>>>> anyone knowing the rules and the private > > >>>>>>>>>>>>>>>>> key already revealed. > > >>>>>>>>>>>>>>>>> > > >>>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you > > >>>>>>>>>>>>>>>> need to make > > >>>>>>>>>>>>>>>> sure that every encryption generates a radically different > > >>>>>>>>>>>>>>>> ciphertext, > > >>>>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same > > >>>>>>>>>>>>>>>> plaintext several times in a row would produce very different > > >>>>>>>>>>>>>>>> ciphertexts. > > >>>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > > >>>>>>>>>>>>>>> alpha character of 26 possibilities > > >>>>>>>>>>>>>>> only the order of these 7 group identifiers is changed after > > >>>>>>>>>>>>>>> each message > > >>>>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). > > >>>>>>>>>>>>>>> Changed randomly. This way no letter connections > > >>>>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few > > >>>>>>>>>>>>>>> messages are sent but then complete contradictory results > > >>>>>>>>>>>>>>> pointing to a letter involved with one particular identifier > > >>>>>>>>>>>>>>> group of 7 letters. > > >>>>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove > > >>>>>>>>>>>>>>> this point. > > >>>>>>>>>>>>>>> The order right now of these group identifiers in this one > > >>>>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in > > >>>>>>>>>>>>>>> odd positions in the private key alpha string --- > > >>>>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > > >>>>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 > > >>>>>>>>>>>>>>> possibilities) chosen from a random table of these > > >>>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once > > >>>>>>>>>>>>>>> in a while change the random order (predetermined in a certain > > >>>>>>>>>>>>>>> order of vowels and consonance strategically located in all the > > >>>>>>>>>>>>>>> private string (groups of 7) should do the trick.. > > >>>>>>>>>>>>>>> Did you solve the cipher yet? > > >>>>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the > > >>>>>>>>>>>>>>> actual private key and ciphertext associated with it. > > >>>>>>>>>>>>>> > > >>>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 > > >>>>>>>>>>>>>> corrections you are supposed to solve against the private > > >>>>>>>>>>>>>> alpha key. > > >>>>>>>>>>>>>> When aligning an odd positioned group identifier from the public > > >>>>>>>>>>>>>> key it can only draw one letter from that group > > >>>>>>>>>>>>>> in the private key string. This is because the left to right > > >>>>>>>>>>>>>> movement to align the identifier can't go back to the left > > >>>>>>>>>>>>>> or stay in the same position on that identifier to choose the > > >>>>>>>>>>>>>> first but not the second letter within the same group. > > >>>>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- > > >>>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > > >>>>>>>>>>>>>> It will be self-explanatory when you solve the cipher. > > >>>>>>>>>>>>>> > > >>>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext > > >>>>>>>>>>>>> several times in a row should create different ciphertexts. Here > > >>>>>>>>>>>>> is a crude example I made of my highly experimental fractal based > > >>>>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically > > >>>>>>>>>>>>> different than my HMAC cipher. Anyway... > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact > > >>>>>>>>>>>>> plaintext using the default secret key using the following online > > >>>>>>>>>>>>> program of mine: > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> The plaintext is: Hello World. > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 12 bytes > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ciphertext 0 > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 > > >>>>>>>>>>>>> 0.18726842930653814 0.15381457747419044 > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ciphertext 1 > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 > > >>>>>>>>>>>>> 0.3822450385558595 0.18493372431673 > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ciphertext 2 > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 > > >>>>>>>>>>>>> 0.3486656373192471 0.3596603216576378 > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> ______________________________ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the > > >>>>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a > > >>>>>>>>>>>>> desktop for the crude layout. > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> This is using something called an IV. However, my HMAC cipher > > >>>>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, > > >>>>>>>>>>>>> its not sent in the clear. Read all of: > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> Also, read all of: > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> > > >>>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at > > >>>>>>>>>>>>> what happens to the ciphertext. > > >>>>>>>>>>>> > > >>>>>>>>>>>> Chris, > > >>>>>>>>>>>> It appears to create a few more encrypted 2 character codes than > > >>>>>>>>>>>> the actual number of alpha characters > > >>>>>>>>>>>> in the plaintext in a one-for-one matchup. > > >>>>>>>>>>> > > >>>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for > > >>>>>>>>>>> each plaintext character. Can you show me an example plaintext > > >>>>>>>>>>> where it creates more? This is different than my HMAC cipher that > > >>>>>>>>>>> can extend the ciphertext and make it larger than the plaintext > > >>>>>>>>>>> via using TRNG random bytes in the plaintext before encrypting. > > >>>>>>>>>>> read all: http://funwithfractals.atspace.cc/ct_cipher > > >>>>>>>>>>> > > >>>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can > > >>>>>>>>>>> be: _______________________ > > >>>>>>>>>>> 0.12934470968540027 0.025161836871791087 > > >>>>>>>>>>> 0.03337929216249355 0.11671759502753765 > > >>>>>>>>>>> > > >>>>>>>>>>> FF 19 E6 62 D5 > > >>>>>>>>>>> _______________________ > > >>>>>>>>>>> > > >>>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. > > >>>>>>>>>>> > > >>>>>>>>>>> If you can give me a plaintext that creates more than hexbytes than > > >>>>>>>>>>> the number of characters in the plaintext, please show me! > > >>>>>>>>>>> > > >>>>>>>>>>>> Interesting what is going on there. > > >>>>>>>>>>>> Also, what are the number of mathematical possibilities of > > >>>>>>>>>>>> creating these 2 unique character codes of a mix > > >>>>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final > > >>>>>>>>>>>> total of possibilities? > > >>>>>>>>>>>> Is it 26! *10! ? Probably not that big. > > >>>>>>>>>>> > > >>>>>>>>>>> I am not sure. It depends on how many different secret keys one can > > >>>>>>>>>>> make and how many possibilities of getting the same exact random > > >>>>>>>>>>> IV.[...] > > >>>>>>>>>> > > >>>>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 > > >>>>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be > > >>>>>>>>>> the chances of rolling 5 16 sided die and getting a result X. Okay, > > >>>>>>>>>> now how many times do we need to roll to get X again? Each roll > > >>>>>>>>>> would be a click of the Encrypt button for the same plaintext and > > >>>>>>>>>> secret key. Yes, the secret key comes into play. Because FF 19 E6 > > >>>>>>>>>> 62 D5 does not work with another secret key that was not used to > > >>>>>>>>>> create it. > > >>>>>>>>> > > >>>>>>>>> One big question? > > >>>>>>>>> A possible scenario -- > > >>>>>>>>> Joe the encryptor has his own offline encryption algorithm in a > > >>>>>>>>> computer. He copies the encrypted message on a thumb drive and loads > > >>>>>>>>> it into his online computer and sends the encrypted message to his > > >>>>>>>>> foreign opertive Alice. > > >>>>>>>>> Is some other info coming along with that encrypted message? > > >>>>>>>>> There could be something berried in the encrypted hex code? > > >>>>>>>>> My big question is, has this been tried on two separate offline > > >>>>>>>>> systems? > > >>>>>>>>> If this was all done on one system, I was snookered if not then this > > >>>>>>>>> is fantastic. > > >>>>>>>>> On the encryption side algorithm --- plaintext read in. > > >>>>>>>>> On the decryption side hex coding -- read in. > > >>>>>>>>> Two separate systems. > > >>>>>>>>> A Huge advantage if both algorithms are on one system to > > >>>>>>>>> pull a fast one. > > >>>>>>>>> Or a possibility much more data is coming across than just the > > >>>>>>>>> encrypted message? > > >>>>>>>>> > > >>>>>>>>> Just my take an opinion. > > >>>>>>>>> Not accusing you of anything because you have much more talent than I > > >>>>>>>>> on fractals and the whole structure of the two, I hope, separate > > >>>>>>>>> systems.(encryption,decryption) The question needs to be asked. > > >>>>>>>>> > > >>>>>>>>> Whatever just keep producing these great renderings which I find > > >>>>>>>>> fascinating. Also what you produced here, even if it was only on one > > >>>>>>>>> system. > > >>>>>>>> It will work on different systems, online or offline. The full code is > > >>>>>>>> on the webpage. So, Bob can be using his own system, and browser of > > >>>>>>>> choice. Alice can decrypt it using her own system, and browser of > > >>>>>>>> choice. The code is all client side. > > >>>>>>> > > >>>>>>> So Alice is the client-side? (decryptor) > > >>>>>>> If so, it makes no sense. > > >>>>>>> > > >>>>>>> > > >>>>>>> > > >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the > > >>>>>> lines into the Cipher Text box in the page, and click the decrypt > > >>>>>> button. > > >>>>>> > > >>>>>> ________________________________ > > >>>>>> > > >>>>>> 0.39351870705816516 0.12367086856260284 > > >>>>>> 0.10821656063857987 0.5183020398197964 > > >>>>>> > > >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > > >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > > >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > > >>>>>> 49 40 AE E2 > > >>>>>> > > >>>>>> ________________________________ > > >>>>>> > > >>>>>> > > >>>>>> What does it say? > > >>>>> It just comes back with the short message "plaintext" I just erased to > > >>>>> paste in the hex code above. Do I need to paste the four fractional parts > > >>>>> into the lower window also? > > >>>> Or do I run one of your Python algorithms? > > >>> > > >>> > > >>> I am still trying to wrap my head around your encryption/decryption > > >>> concept. Examing your Python code and your explanations. > > >>> Okay Chris, let's draw a crude comparison. > > >>> The German enigma was employed separately within the different military > > >>> groups. The navy, army, airforce. etc. > > >>> Each had a few or more enigma machines at each end of their radio > > >>> communications networks. Like your system, they could send the encrypted > > >>> code either way but each had charts that would dictate any changes to the > > >>> cypher wheels and plugboards with a time and date stamp for that change, > > >>> even allowing for different time zones if necessary. Drawing a comparison > > >>> to your system like the charts but only employed as a special hash > > >>> function in both algorithms that after each message sent and received by > > >>> either party, Bob or Alice, the new duplicate cypher is updated in each > > >>> algorithm so they match to each letter/hex. Crudely put but like the > > >>> German enigma where each combination of the cypher was changed after a > > >>> period of time instead of after each transmission and receiving of YOUR > > >>> system. Then it is automatically updated on both systems algorithms to > > >>> match any alpha to hex conversion on both algorithms to give a new > > >>> letter/hex cypher. Have I got the comparison right? > > >> One difference is that the Enigma encrypting the same message with the > > >> same 'key' resulted in the same ciphertext. Also, the Enigma would > > >> never give a CT letter the same coded letter as the plaintext letter > > >> because of that reflector wheel. > > > > > > We can't forget the plugboard either. > > All part of the "key". > What about my idea for a private key that only 7 numbers (Alpha group identifiers) have > to be changed after each message sent whereas both sides could send these encrypted > messages. These 7 group identifiers would be protecting the identity of the onetime > random order set for each of the 7 Alpha characters within each group. > This eliminates any possible outside attack on repeated messages where the identifiers > are not changed they may identify where some Alpha characters are located within each > group after analyzing many messages. > A private key string read from left to right holding 7 random groups of 7 alpha characters > and 7 group identifiers placed only in odd count positions of the string. > When the scan (read) of the string has reached the end of the string it just starts the scan > at the beginning of the string again. This happens as many times as needed for each message. > Only one letter can be drawn from any one particular group on each scan. > The random order of the 7 group identifiers is only changed after each completed message. > The set random order for the Alpha characters within each group of 7 is not changed. > > 49 Alpha characters -- 26*2 = 52 minus one X, one Y, and one Z = 49 Alpha characters > and 7 group identifiers 1-7 for a total string length of 56. > The encrypted numbers are run across the bottom of the string and alining each > group identifier starting at the beginning of the encrypted message. > Say the first identifier, the start of the encrypted message is 3. The left-right scan (read) > stops at 3 then from the next number after the identifier is 5 the alpha character in that > position is T. So the first letter of the encrypted message is a T and so on. Only drawing > a limit of one letter from any one group on every completed scan. > Reaching the end of the string and then starting the scan from the start of the string again > until each number in the even positions of the encryption has drawn a letter to complete the > plain text message. > > > > Example of a private key string --- > 2KPMJNOL5VQSUWRT4KHMNJIL6IDCGHFE1BECGFDA3SOQUTRP7YAVXBWZ > > And an encrypted public message created from the above private key --- > 574267274635574767113626554462326431523446632147712454433767163273673657426727177771663274 > > This message contains all the letters of the Alphabet. > > Just follow the K-I-S-S rules above and you can decrypt it very easily > by scanning and comparing the above private key with the public key over and over > from left to right. > The latter part of the encryption shows 4 7's but it does not break the rule > of 1 letter limit from one particular group per complete scan. It actually > scans again the whole string and picks up the only Y in the string whereas the previous > letter was also in the 7TH group and the only one of the 3 letters represented just once in the string. > A nice little hint. These one-timers (XYZ) also could be spread out a little more in the string where > all 3 reside in group 7 identifier. Chris, You gave me an Idea on my 7^2 encryption brainstorm. The way you pass off the new information on updating the private key when a ciphertext is sent by either party, Bob or Alice, it updates the receiver's file which intern gives the private key new information. In essence, changing the private key of the receiver or how it processes the new information from a file or some other direct process. The fractional values that are sent along with the encrypted message are the catalyst for that change on the receiver's end of the encrypted message. This, I believe, your fractional values sent with the ciphertext do just that. In my system, it is much simpler. Instead of a few fractional values sent with the ciphertext, as in your system, a random order of 1,2,3,4,5,6,7 as group identifiers could either update the present private key of the receiver or choose a whole new string with randomly placed Alpha characters from a database that will match the new random order of the group identifiers. I would prefer the latter. The number of combinations for 1,2,3,4,5,6,7 are <7! but still, a good number that could be used again. What is the actual number of combinations 1-7? Dan
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-05 08:15 -0700 |
| Message-ID | <3b41ea8f-fa84-4b8b-a7ae-c36d3fd90f24n@googlegroups.com> |
| In reply to | #516672 |
On Monday, April 5, 2021 at 9:27:08 AM UTC-4, djoyce099 wrote: > On Sunday, April 4, 2021 at 4:29:50 PM UTC-4, djoyce099 wrote: > > On Sunday, April 4, 2021 at 2:11:11 PM UTC-4, FromTheRafters wrote: > > > djoyce099 pretended : > > > > On Sunday, April 4, 2021 at 5:31:01 AM UTC-4, FromTheRafters wrote: > > > >> djoyce099 explained on 4/3/2021 : > > > >>> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: > > > >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > > > >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: > > > >>>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: > > > >>>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson > > > >>>>>>> wrote: > > > >>>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: > > > >>>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson > > > >>>>>>>>> wrote: > > > >>>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: > > > >>>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: > > > >>>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson > > > >>>>>>>>>>>> wrote: > > > >>>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: > > > >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 > > > >>>>>>>>>>>>>> wrote: > > > >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. > > > >>>>>>>>>>>>>>> Thomasson wrote: > > > >>>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: > > > >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 > > > >>>>>>>>>>>>>>>>> wrote: > > > >>>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 > > > >>>>>>>>>>>>>>>>>> wrote: > > > >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, djoyce099 > > > >>>>>>>>>>>>>>>>>>> wrote: > > > >>>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris M. > > > >>>>>>>>>>>>>>>>>>>> Thomasson wrote: > > > >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: > > > >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > > >>>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: > > > >>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: > > > >>>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: > > > >>>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, Chris > > > >>>>>>>>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret > > > >>>>>>>>>>>>>>>>>>>>>>>>>>>>> key. You should post it there. ... > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> different digits. > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> convergents of the original rational and use your > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> initial mapping of > > > >>>>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... > > > >>>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 > > > >>>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting > > > >>>>>>>>>>>>>>>>>>>>>>>> to 2.xyz where x > > > >>>>>>>>>>>>>>>>>>>>>>>> < y < z, the only word I see is `gab`, from divider > > > >>>>>>>>>>>>>>>>>>>>>>>> 2.269. > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to > > > >>>>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original > > > >>>>>>>>>>>>>>>>>>>>>>> number that contains the > > > >>>>>>>>>>>>>>>>>>>>>>> plaintext in its convergents. The answer is below, > > > >>>>>>>>>>>>>>>>>>>>>>> spoiler alert: ... > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> //// > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello > > > >>>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>>> ;^) > > > >>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate > > > >>>>>>>>>>>>>>>>>>>>>> enough? > > > >>>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives > > > >>>>>>>>>>>>>>>>>>>>> the convergents > > > >>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] for 8.1967434328895. Strange, it must be > > > >>>>>>>>>>>>>>>>>>>>> rounding or > > > >>>>>>>>>>>>>>>>>>>>> something. > > > >>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 > > > >>>>>>>>>>>>>>>>>>>>>> The > > > >>>>>>>>>>>>>>>>>>>>>> convergents actually are [8; 5 12 12 14 1 282893 ...], > > > >>>>>>>>>>>>>>>>>>>>>> which my previously-mentioned > > > >>>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as > > > >>>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. > > > >>>>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 > > > >>>>>>>>>>>>>>>>>>>>>> 12 15 20614211 ...] > > > >>>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of > > > >>>>>>>>>>>>>>>>>>>> the target rational > > > >>>>>>>>>>>>>>>>>>>> you need to compare to the number of terms in the cf. > > > >>>>>>>>>>>>>>>>>>>> I way overdid it in my first post but it was a longer > > > >>>>>>>>>>>>>>>>>>>> message that was encrypted but > > > >>>>>>>>>>>>>>>>>>>> probably could have used a much smaller in length rational > > > >>>>>>>>>>>>>>>>>>>> to get the desired number of > > > >>>>>>>>>>>>>>>>>>>> of terms in the cf for the number to letter conversion. > > > >>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers 1-7 > > > >>>>>>>>>>>>>>>>>>>> in the even positions -- 2,4,6,8,10,12,14.. > > > >>>>>>>>>>>>>>>>>>>> and group number identifiers 1-7 in the odd positions -- > > > >>>>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. > > > >>>>>>>>>>>>>>>>>>>> Think of it as using a slide rule where the private key > > > >>>>>>>>>>>>>>>>>>>> (a string of random letters along with each group number > > > >>>>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the > > > >>>>>>>>>>>>>>>>>>>> rule and the slider portion has the cipher encrypted > > > >>>>>>>>>>>>>>>>>>>> message of just the numbers 1-7 and the 7 group > > > >>>>>>>>>>>>>>>>>>>> identifiers. These two strings are placed side by side > > > >>>>>>>>>>>>>>>>>>>> and sliding the ciphertext from left to right and > > > >>>>>>>>>>>>>>>>>>>> aligning each letter with the encrypted numbers of the > > > >>>>>>>>>>>>>>>>>>>> sliding portion of the rule. The examples I have > > > >>>>>>>>>>>>>>>>>>>> previously posted --- A letter is only used once in the > > > >>>>>>>>>>>>>>>>>>>> left to right scan like the word little the first T in > > > >>>>>>>>>>>>>>>>>>>> little is used then the scan continues by the decryptor > > > >>>>>>>>>>>>>>>>>>>> for the second T because this private key string is made > > > >>>>>>>>>>>>>>>>>>>> up of 49 alpha characters = 26*2 minus the second XYZ = > > > >>>>>>>>>>>>>>>>>>>> 49 Alpha characters and 1-7 group identifiers placed in > > > >>>>>>>>>>>>>>>>>>>> the odd count positions. Example below where this is easy > > > >>>>>>>>>>>>>>>>>>>> to decrypt by just this simple method -- > > > >>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- > > > >>>>>>>>>>>>>>>>>>>> Fixed private > > > >>>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- > > > >>>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" > > > >>>>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > > >>>>>>>>>>>>>>>>>>>> Sliding cipher for the right letter alignment --- a public > > > >>>>>>>>>>>>>>>>>>>> key sent to be decrypted. moving --> then when reaching > > > >>>>>>>>>>>>>>>>>>>> the end of the fixed private key the cipher is brought > > > >>>>>>>>>>>>>>>>>>>> back <--- (no scan ) and scanning ----> again for the > > > >>>>>>>>>>>>>>>>>>>> correct letter alignment to be cherry-picked from the > > > >>>>>>>>>>>>>>>>>>>> private key. This is giving the whole cipher idea away > > > >>>>>>>>>>>>>>>>>>>> but the order of the characters in the private key can be > > > >>>>>>>>>>>>>>>>>>>> drastically changed along with the group identifiers then > > > >>>>>>>>>>>>>>>>>>>> the public key would be useless to the person without the > > > >>>>>>>>>>>>>>>>>>>> new private string. In a completed scan (end of too the > > > >>>>>>>>>>>>>>>>>>>> right ------>), there could be several stops for letter > > > >>>>>>>>>>>>>>>>>>>> alignments. I am just using this analogy of sliding but > > > >>>>>>>>>>>>>>>>>>>> the right parsing of strings in both algorithms would get > > > >>>>>>>>>>>>>>>>>>>> the job done. The above decryption of the public key > > > >>>>>>>>>>>>>>>>>>>> above is easy if you follow the rules. > > > >>>>>>>>>>>>>>>>>>>> This is just what I can remember from these old algorithms > > > >>>>>>>>>>>>>>>>>>>> I produced in basic on my commodore 64 back in the 80s > > > >>>>>>>>>>>>>>>>>>>> that worked great for encrypting and decrypting these > > > >>>>>>>>>>>>>>>>>>>> numbers only 1-7 ciphers. > > > >>>>>>>>>>>>>>>>>>>> Just trying to transfer these thoughts into Python but not > > > >>>>>>>>>>>>>>>>>>>> getting anywhere yet. > > > >>>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square cipher > > > >>>>>>>>>>>>>>>>>>> yet? Or found any flaws in the concept? > > > >>>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the > > > >>>>>>>>>>>>>>>>>> above nature the group identifiers could be changed > > > >>>>>>>>>>>>>>>>>> to a different identifier position after each message sent. > > > >>>>>>>>>>>>>>>>>> This way no patterns of odd position numbers can be detected > > > >>>>>>>>>>>>>>>>>> even though some > > > >>>>>>>>>>>>>>>>>> identifiers sometimes are used in succession breaking any > > > >>>>>>>>>>>>>>>>>> pattern possible with future cipher messages. > > > >>>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? > > > >>>>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- > > > >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 > > > >>>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written > > > >>>>>>>>>>>>>>>>>> message these numbers represent? > > > >>>>>>>>>>>>>>>>>> Duh, This is more powerful than even the German enigma > > > >>>>>>>>>>>>>>>>>> machine. This is because the public key encoded numeric > > > >>>>>>>>>>>>>>>>>> message can be any length but the > > > >>>>>>>>>>>>>>>>>> private key is just 56 characters long. 1-7 group > > > >>>>>>>>>>>>>>>>>> identifiers randomly located and the 49 Alpha characters. > > > >>>>>>>>>>>>>>>>>> In other words, I would die with this secret. ;-) > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by > > > >>>>>>>>>>>>>>>>> anyone knowing the rules and the private > > > >>>>>>>>>>>>>>>>> key already revealed. > > > >>>>>>>>>>>>>>>>> > > > >>>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you > > > >>>>>>>>>>>>>>>> need to make > > > >>>>>>>>>>>>>>>> sure that every encryption generates a radically different > > > >>>>>>>>>>>>>>>> ciphertext, > > > >>>>>>>>>>>>>>>> even for the exact same plaintext. So encrypting the same > > > >>>>>>>>>>>>>>>> plaintext several times in a row would produce very different > > > >>>>>>>>>>>>>>>> ciphertexts. > > > >>>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick an > > > >>>>>>>>>>>>>>> alpha character of 26 possibilities > > > >>>>>>>>>>>>>>> only the order of these 7 group identifiers is changed after > > > >>>>>>>>>>>>>>> each message > > > >>>>>>>>>>>>>>> The different combinations are 7! . A lot of messages (5048). > > > >>>>>>>>>>>>>>> Changed randomly. This way no letter connections > > > >>>>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a few > > > >>>>>>>>>>>>>>> messages are sent but then complete contradictory results > > > >>>>>>>>>>>>>>> pointing to a letter involved with one particular identifier > > > >>>>>>>>>>>>>>> group of 7 letters. > > > >>>>>>>>>>>>>>> A bunch of test ciphertext would have to be processed to prove > > > >>>>>>>>>>>>>>> this point. > > > >>>>>>>>>>>>>>> The order right now of these group identifiers in this one > > > >>>>>>>>>>>>>>> example of the private key above is --- 3,5,1,6,2,7,4 and in > > > >>>>>>>>>>>>>>> odd positions in the private key alpha string --- > > > >>>>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. > > > >>>>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 > > > >>>>>>>>>>>>>>> possibilities) chosen from a random table of these > > > >>>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and once > > > >>>>>>>>>>>>>>> in a while change the random order (predetermined in a certain > > > >>>>>>>>>>>>>>> order of vowels and consonance strategically located in all the > > > >>>>>>>>>>>>>>> private string (groups of 7) should do the trick.. > > > >>>>>>>>>>>>>>> Did you solve the cipher yet? > > > >>>>>>>>>>>>>>> I gave plenty of info by using the slide rule method and the > > > >>>>>>>>>>>>>>> actual private key and ciphertext associated with it. > > > >>>>>>>>>>>>>> > > > >>>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 > > > >>>>>>>>>>>>>> corrections you are supposed to solve against the private > > > >>>>>>>>>>>>>> alpha key. > > > >>>>>>>>>>>>>> When aligning an odd positioned group identifier from the public > > > >>>>>>>>>>>>>> key it can only draw one letter from that group > > > >>>>>>>>>>>>>> in the private key string. This is because the left to right > > > >>>>>>>>>>>>>> movement to align the identifier can't go back to the left > > > >>>>>>>>>>>>>> or stay in the same position on that identifier to choose the > > > >>>>>>>>>>>>>> first but not the second letter within the same group. > > > >>>>>>>>>>>>>> So here is the corrected ciphertext with 4 corrections -- > > > >>>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 > > > >>>>>>>>>>>>>> It will be self-explanatory when you solve the cipher. > > > >>>>>>>>>>>>>> > > > >>>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext > > > >>>>>>>>>>>>> several times in a row should create different ciphertexts. Here > > > >>>>>>>>>>>>> is a crude example I made of my highly experimental fractal based > > > >>>>>>>>>>>>> encryption algorihtm. This funny fractal thing is radically > > > >>>>>>>>>>>>> different than my HMAC cipher. Anyway... > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact > > > >>>>>>>>>>>>> plaintext using the default secret key using the following online > > > >>>>>>>>>>>>> program of mine: > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> The plaintext is: Hello World. > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 12 bytes > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ciphertext 0 > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 > > > >>>>>>>>>>>>> 0.18726842930653814 0.15381457747419044 > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ciphertext 1 > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 > > > >>>>>>>>>>>>> 0.3822450385558595 0.18493372431673 > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ciphertext 2 > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 > > > >>>>>>>>>>>>> 0.3486656373192471 0.3596603216576378 > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> ______________________________ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into the > > > >>>>>>>>>>>>> Cipher Text box and click the Decrypt button. Better to use a > > > >>>>>>>>>>>>> desktop for the crude layout. > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> This is using something called an IV. However, my HMAC cipher > > > >>>>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, > > > >>>>>>>>>>>>> its not sent in the clear. Read all of: > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> Also, read all of: > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> > > > >>>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at > > > >>>>>>>>>>>>> what happens to the ciphertext. > > > >>>>>>>>>>>> > > > >>>>>>>>>>>> Chris, > > > >>>>>>>>>>>> It appears to create a few more encrypted 2 character codes than > > > >>>>>>>>>>>> the actual number of alpha characters > > > >>>>>>>>>>>> in the plaintext in a one-for-one matchup. > > > >>>>>>>>>>> > > > >>>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for > > > >>>>>>>>>>> each plaintext character. Can you show me an example plaintext > > > >>>>>>>>>>> where it creates more? This is different than my HMAC cipher that > > > >>>>>>>>>>> can extend the ciphertext and make it larger than the plaintext > > > >>>>>>>>>>> via using TRNG random bytes in the plaintext before encrypting. > > > >>>>>>>>>>> read all: http://funwithfractals.atspace.cc/ct_cipher > > > >>>>>>>>>>> > > > >>>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key can > > > >>>>>>>>>>> be: _______________________ > > > >>>>>>>>>>> 0.12934470968540027 0.025161836871791087 > > > >>>>>>>>>>> 0.03337929216249355 0.11671759502753765 > > > >>>>>>>>>>> > > > >>>>>>>>>>> FF 19 E6 62 D5 > > > >>>>>>>>>>> _______________________ > > > >>>>>>>>>>> > > > >>>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. > > > >>>>>>>>>>> > > > >>>>>>>>>>> If you can give me a plaintext that creates more than hexbytes than > > > >>>>>>>>>>> the number of characters in the plaintext, please show me! > > > >>>>>>>>>>> > > > >>>>>>>>>>>> Interesting what is going on there. > > > >>>>>>>>>>>> Also, what are the number of mathematical possibilities of > > > >>>>>>>>>>>> creating these 2 unique character codes of a mix > > > >>>>>>>>>>>> of alpha-numeric or just alpha, or just numeric to give a final > > > >>>>>>>>>>>> total of possibilities? > > > >>>>>>>>>>>> Is it 26! *10! ? Probably not that big. > > > >>>>>>>>>>> > > > >>>>>>>>>>> I am not sure. It depends on how many different secret keys one can > > > >>>>>>>>>>> make and how many possibilities of getting the same exact random > > > >>>>>>>>>>> IV.[...] > > > >>>>>>>>>> > > > >>>>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 E6 > > > >>>>>>>>>> 62 D5, it would be 5 16-bit numbers. So, the probability would be > > > >>>>>>>>>> the chances of rolling 5 16 sided die and getting a result X. Okay, > > > >>>>>>>>>> now how many times do we need to roll to get X again? Each roll > > > >>>>>>>>>> would be a click of the Encrypt button for the same plaintext and > > > >>>>>>>>>> secret key. Yes, the secret key comes into play. Because FF 19 E6 > > > >>>>>>>>>> 62 D5 does not work with another secret key that was not used to > > > >>>>>>>>>> create it. > > > >>>>>>>>> > > > >>>>>>>>> One big question? > > > >>>>>>>>> A possible scenario -- > > > >>>>>>>>> Joe the encryptor has his own offline encryption algorithm in a > > > >>>>>>>>> computer. He copies the encrypted message on a thumb drive and loads > > > >>>>>>>>> it into his online computer and sends the encrypted message to his > > > >>>>>>>>> foreign opertive Alice. > > > >>>>>>>>> Is some other info coming along with that encrypted message? > > > >>>>>>>>> There could be something berried in the encrypted hex code? > > > >>>>>>>>> My big question is, has this been tried on two separate offline > > > >>>>>>>>> systems? > > > >>>>>>>>> If this was all done on one system, I was snookered if not then this > > > >>>>>>>>> is fantastic. > > > >>>>>>>>> On the encryption side algorithm --- plaintext read in. > > > >>>>>>>>> On the decryption side hex coding -- read in. > > > >>>>>>>>> Two separate systems. > > > >>>>>>>>> A Huge advantage if both algorithms are on one system to > > > >>>>>>>>> pull a fast one. > > > >>>>>>>>> Or a possibility much more data is coming across than just the > > > >>>>>>>>> encrypted message? > > > >>>>>>>>> > > > >>>>>>>>> Just my take an opinion. > > > >>>>>>>>> Not accusing you of anything because you have much more talent than I > > > >>>>>>>>> on fractals and the whole structure of the two, I hope, separate > > > >>>>>>>>> systems.(encryption,decryption) The question needs to be asked. > > > >>>>>>>>> > > > >>>>>>>>> Whatever just keep producing these great renderings which I find > > > >>>>>>>>> fascinating. Also what you produced here, even if it was only on one > > > >>>>>>>>> system. > > > >>>>>>>> It will work on different systems, online or offline. The full code is > > > >>>>>>>> on the webpage. So, Bob can be using his own system, and browser of > > > >>>>>>>> choice. Alice can decrypt it using her own system, and browser of > > > >>>>>>>> choice. The code is all client side. > > > >>>>>>> > > > >>>>>>> So Alice is the client-side? (decryptor) > > > >>>>>>> If so, it makes no sense. > > > >>>>>>> > > > >>>>>>> > > > >>>>>>> > > > >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the > > > >>>>>> lines into the Cipher Text box in the page, and click the decrypt > > > >>>>>> button. > > > >>>>>> > > > >>>>>> ________________________________ > > > >>>>>> > > > >>>>>> 0.39351870705816516 0.12367086856260284 > > > >>>>>> 0.10821656063857987 0.5183020398197964 > > > >>>>>> > > > >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > > > >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > > > >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > > > >>>>>> 49 40 AE E2 > > > >>>>>> > > > >>>>>> ________________________________ > > > >>>>>> > > > >>>>>> > > > >>>>>> What does it say? > > > >>>>> It just comes back with the short message "plaintext" I just erased to > > > >>>>> paste in the hex code above. Do I need to paste the four fractional parts > > > >>>>> into the lower window also? > > > >>>> Or do I run one of your Python algorithms? > > > >>> > > > >>> > > > >>> I am still trying to wrap my head around your encryption/decryption > > > >>> concept. Examing your Python code and your explanations. > > > >>> Okay Chris, let's draw a crude comparison. > > > >>> The German enigma was employed separately within the different military > > > >>> groups. The navy, army, airforce. etc. > > > >>> Each had a few or more enigma machines at each end of their radio > > > >>> communications networks. Like your system, they could send the encrypted > > > >>> code either way but each had charts that would dictate any changes to the > > > >>> cypher wheels and plugboards with a time and date stamp for that change, > > > >>> even allowing for different time zones if necessary. Drawing a comparison > > > >>> to your system like the charts but only employed as a special hash > > > >>> function in both algorithms that after each message sent and received by > > > >>> either party, Bob or Alice, the new duplicate cypher is updated in each > > > >>> algorithm so they match to each letter/hex. Crudely put but like the > > > >>> German enigma where each combination of the cypher was changed after a > > > >>> period of time instead of after each transmission and receiving of YOUR > > > >>> system. Then it is automatically updated on both systems algorithms to > > > >>> match any alpha to hex conversion on both algorithms to give a new > > > >>> letter/hex cypher. Have I got the comparison right? > > > >> One difference is that the Enigma encrypting the same message with the > > > >> same 'key' resulted in the same ciphertext. Also, the Enigma would > > > >> never give a CT letter the same coded letter as the plaintext letter > > > >> because of that reflector wheel. > > > > > > > > We can't forget the plugboard either. > > > All part of the "key". > > What about my idea for a private key that only 7 numbers (Alpha group identifiers) have > > to be changed after each message sent whereas both sides could send these encrypted > > messages. These 7 group identifiers would be protecting the identity of the onetime > > random order set for each of the 7 Alpha characters within each group. > > This eliminates any possible outside attack on repeated messages where the identifiers > > are not changed they may identify where some Alpha characters are located within each > > group after analyzing many messages. > > A private key string read from left to right holding 7 random groups of 7 alpha characters > > and 7 group identifiers placed only in odd count positions of the string. > > When the scan (read) of the string has reached the end of the string it just starts the scan > > at the beginning of the string again. This happens as many times as needed for each message. > > Only one letter can be drawn from any one particular group on each scan. > > The random order of the 7 group identifiers is only changed after each completed message. > > The set random order for the Alpha characters within each group of 7 is not changed. > > > > 49 Alpha characters -- 26*2 = 52 minus one X, one Y, and one Z = 49 Alpha characters > > and 7 group identifiers 1-7 for a total string length of 56. > > The encrypted numbers are run across the bottom of the string and alining each > > group identifier starting at the beginning of the encrypted message. > > Say the first identifier, the start of the encrypted message is 3. The left-right scan (read) > > stops at 3 then from the next number after the identifier is 5 the alpha character in that > > position is T. So the first letter of the encrypted message is a T and so on. Only drawing > > a limit of one letter from any one group on every completed scan. > > Reaching the end of the string and then starting the scan from the start of the string again > > until each number in the even positions of the encryption has drawn a letter to complete the > > plain text message. > > > > > > > > Example of a private key string --- > > 2KPMJNOL5VQSUWRT4KHMNJIL6IDCGHFE1BECGFDA3SOQUTRP7YAVXBWZ > > > > And an encrypted public message created from the above private key --- > > 574267274635574767113626554462326431523446632147712454433767163273673657426727177771663274 > > > > This message contains all the letters of the Alphabet. > > > > Just follow the K-I-S-S rules above and you can decrypt it very easily > > by scanning and comparing the above private key with the public key over and over > > from left to right. > > The latter part of the encryption shows 4 7's but it does not break the rule > > of 1 letter limit from one particular group per complete scan. It actually > > scans again the whole string and picks up the only Y in the string whereas the previous > > letter was also in the 7TH group and the only one of the 3 letters represented just once in the string. > > A nice little hint. These one-timers (XYZ) also could be spread out a little more in the string where > > all 3 reside in group 7 identifier. > > Chris, > You gave me an Idea on my 7^2 encryption brainstorm. > The way you pass off the new information on updating the private key when a ciphertext is > sent by either party, Bob or Alice, it updates the receiver's file which intern gives the private > key new information. In essence, changing the private key of the receiver or how it processes > the new information from a file or some other direct process. > The fractional values that are sent along with the encrypted message are the catalyst for that change > on the receiver's end of the encrypted message. > This, I believe, your fractional values sent with the ciphertext do just that. > > In my system, it is much simpler. > Instead of a few fractional values sent with the ciphertext, as in your system, a random order of > 1,2,3,4,5,6,7 as group identifiers could either update the present private key of the receiver or > choose a whole new string with randomly placed Alpha characters from a database that will match > the new random order of the group identifiers. > I would prefer the latter. > The number of combinations for 1,2,3,4,5,6,7 are <7! but still, a good number that could be used > again. > What is the actual number of combinations 1-7? > Dan Or as a disguise, a rational number sent with the ciphertext with a cf with 7 different starting numbers like [3:5,1,7,4,2,6..then up to x amount of any other trailing digits.] This would produce the 7 unique group identifiers for updating a private key or choosing a matching string with the same order of group identifiers.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-04 14:28 -0700 |
| Message-ID | <s4db1k$1jgs$1@gioia.aioe.org> |
| In reply to | #516566 |
On 4/4/2021 2:30 AM, FromTheRafters wrote: > djoyce099 explained on 4/3/2021 : >> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: >>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson >>>> wrote: >>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: >>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson >>>>>> wrote: >>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: >>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson >>>>>>>> wrote: >>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. >>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 >>>>>>>>>>>>> wrote: >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. >>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, >>>>>>>>>>>>>>>> djoyce099 wrote: >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, >>>>>>>>>>>>>>>>> djoyce099 wrote: >>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, >>>>>>>>>>>>>>>>>> djoyce099 wrote: >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, >>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, >>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM >>>>>>>>>>>>>>>>>>>>>>>>>>> UTC-4, Chris M. Thomasson wrote: ... >>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying >>>>>>>>>>>>>>>>>>>>>>>>>>>> against a constant in the secret key. You >>>>>>>>>>>>>>>>>>>>>>>>>>>> should post it there. ... >>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists >>>>>>>>>>>>>>>>>>>>>>>>>> of a 2.xyx. x y and z are different digits. >>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original >>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the convergents of the original >>>>>>>>>>>>>>>>>>>>>>>>>> rational and use your initial mapping of >>>>>>>>>>>>>>>>>>>>>>>>>> numbers to letters to decrypt the message. ... >>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and >>>>>>>>>>>>>>>>>>>>>>> limiting to 2.xyz where x < y < z, the only word >>>>>>>>>>>>>>>>>>>>>>> I see is `gab`, from divider 2.269. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you >>>>>>>>>>>>>>>>>>>>>> need to divide 17.4016863080244085 by it to get >>>>>>>>>>>>>>>>>>>>>> the original number that contains the plaintext >>>>>>>>>>>>>>>>>>>>>> in its convergents. The answer is below, spoiler >>>>>>>>>>>>>>>>>>>>>> alert: ... >>>>>>>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate >>>>>>>>>>>>>>>>>>>>> enough? >>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram >>>>>>>>>>>>>>>>>>>> gives the convergents [8; 5 12 12 15] for >>>>>>>>>>>>>>>>>>>> 8.1967434328895. Strange, it must be rounding or >>>>>>>>>>>>>>>>>>>> something. >>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>>>>>>> The convergents actually are [8; 5 12 12 14 1 >>>>>>>>>>>>>>>>>>>>> 282893 ...], which my previously-mentioned >>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as >>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 >>>>>>>>>>>>>>>>>>>>> 12 12 15 20614211 ...] >>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal >>>>>>>>>>>>>>>>>>> expansion of the target rational you need to compare >>>>>>>>>>>>>>>>>>> to the number of terms in the cf. I way overdid it in >>>>>>>>>>>>>>>>>>> my first post but it was a longer message that was >>>>>>>>>>>>>>>>>>> encrypted but probably could have used a much smaller >>>>>>>>>>>>>>>>>>> in length rational to get the desired number of of >>>>>>>>>>>>>>>>>>> terms in the cf for the number to letter conversion. >>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only >>>>>>>>>>>>>>>>>>> numbers 1-7 in the even positions -- >>>>>>>>>>>>>>>>>>> 2,4,6,8,10,12,14.. and group number identifiers 1-7 >>>>>>>>>>>>>>>>>>> in the odd positions -- 1,3,5,7,9,11,13.. Think of it >>>>>>>>>>>>>>>>>>> as using a slide rule where the private key (a string >>>>>>>>>>>>>>>>>>> of random letters along with each group number >>>>>>>>>>>>>>>>>>> identifiers) is on the fixed portion of the rule and >>>>>>>>>>>>>>>>>>> the slider portion has the cipher encrypted message >>>>>>>>>>>>>>>>>>> of just the numbers 1-7 and the 7 group identifiers. >>>>>>>>>>>>>>>>>>> These two strings are placed side by side and sliding >>>>>>>>>>>>>>>>>>> the ciphertext from left to right and aligning each >>>>>>>>>>>>>>>>>>> letter with the encrypted numbers of the sliding >>>>>>>>>>>>>>>>>>> portion of the rule. The examples I have previously >>>>>>>>>>>>>>>>>>> posted --- A letter is only used once in the left to >>>>>>>>>>>>>>>>>>> right scan like the word little the first T in >>>>>>>>>>>>>>>>>>> little is used then the scan continues by the >>>>>>>>>>>>>>>>>>> decryptor for the second T because this private key >>>>>>>>>>>>>>>>>>> string is made up of 49 alpha characters = 26*2 minus >>>>>>>>>>>>>>>>>>> the second XYZ = 49 Alpha characters and 1-7 group >>>>>>>>>>>>>>>>>>> identifiers placed in the odd count positions. >>>>>>>>>>>>>>>>>>> Example below where this is easy to decrypt by just >>>>>>>>>>>>>>>>>>> this simple method -- >>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>>>>> > Sliding cipher for the right letter alignment --- a >>>>>>>>>>>>>>>>>>> public key sent to be decrypted. moving --> then >>>>>>>>>>>>>>>>>>> when reaching the end of the fixed private key the >>>>>>>>>>>>>>>>>>> cipher is brought back <--- (no scan ) and scanning >>>>>>>>>>>>>>>>>>> ----> again for the correct letter alignment to be >>>>>>>>>>>>>>>>>>> cherry-picked from the private key. This is giving >>>>>>>>>>>>>>>>>>> the whole cipher idea away but the order of the >>>>>>>>>>>>>>>>>>> characters in the private key can be drastically >>>>>>>>>>>>>>>>>>> changed along with the group identifiers then the >>>>>>>>>>>>>>>>>>> public key would be useless to the person without the >>>>>>>>>>>>>>>>>>> new private string. In a completed scan (end of too >>>>>>>>>>>>>>>>>>> the right ------>), there could be several stops for >>>>>>>>>>>>>>>>>>> letter alignments. I am just using this analogy of >>>>>>>>>>>>>>>>>>> sliding but the right parsing of strings in both >>>>>>>>>>>>>>>>>>> algorithms would get the job done. The above >>>>>>>>>>>>>>>>>>> decryption of the public key above is easy if you >>>>>>>>>>>>>>>>>>> follow the rules. This is just what I can remember >>>>>>>>>>>>>>>>>>> from these old algorithms I produced in basic on my >>>>>>>>>>>>>>>>>>> commodore 64 back in the 80s that worked great for >>>>>>>>>>>>>>>>>>> encrypting and decrypting these numbers only 1-7 >>>>>>>>>>>>>>>>>>> ciphers. Just trying to transfer these thoughts into >>>>>>>>>>>>>>>>>>> Python but not getting anywhere yet. >>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square >>>>>>>>>>>>>>>>>> cipher yet? Or found any flaws in the concept? >>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of >>>>>>>>>>>>>>>>> the above nature the group identifiers could be >>>>>>>>>>>>>>>>> changed to a different identifier position after each >>>>>>>>>>>>>>>>> message sent. This way no patterns of odd position >>>>>>>>>>>>>>>>> numbers can be detected even though some identifiers >>>>>>>>>>>>>>>>> sometimes are used in succession breaking any pattern >>>>>>>>>>>>>>>>> possible with future cipher messages. >>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this >>>>>>>>>>>>>>>>> cipher? Okay, Just say I presented the public key --- >>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden >>>>>>>>>>>>>>>>> written message these numbers represent? Duh, This is >>>>>>>>>>>>>>>>> more powerful than even the German enigma machine. >>>>>>>>>>>>>>>>> This is because the public key encoded numeric message >>>>>>>>>>>>>>>>> can be any length but the private key is just 56 >>>>>>>>>>>>>>>>> characters long. 1-7 group identifiers randomly located >>>>>>>>>>>>>>>>> and the 49 Alpha characters. In other words, I would >>>>>>>>>>>>>>>>> die with this secret. ;-) >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by >>>>>>>>>>>>>>>> anyone knowing the rules and the private key already >>>>>>>>>>>>>>>> revealed. >>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, >>>>>>>>>>>>>>> you need to make sure that every encryption generates a >>>>>>>>>>>>>>> radically different ciphertext, even for the exact same >>>>>>>>>>>>>>> plaintext. So encrypting the same plaintext several >>>>>>>>>>>>>>> times in a row would produce very different ciphertexts. >>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to >>>>>>>>>>>>>> pick an alpha character of 26 possibilities only the order >>>>>>>>>>>>>> of these 7 group identifiers is changed after each message >>>>>>>>>>>>>> The different combinations are 7! . A lot of messages >>>>>>>>>>>>>> (5048). Changed randomly. This way no letter connections >>>>>>>>>>>>>> other than a few out of 7 letters in a few groups after a >>>>>>>>>>>>>> few messages are sent but then complete contradictory >>>>>>>>>>>>>> results pointing to a letter involved with one particular >>>>>>>>>>>>>> identifier group of 7 letters. A bunch of test ciphertext >>>>>>>>>>>>>> would have to be processed to prove this point. The order >>>>>>>>>>>>>> right now of these group identifiers in this one example >>>>>>>>>>>>>> of the private key above is --- 3,5,1,6,2,7,4 and in odd >>>>>>>>>>>>>> positions in the private key alpha string --- >>>>>>>>>>>>>> 1,9,17,25,33,41,49 whose position never changes. >>>>>>>>>>>>>> 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 >>>>>>>>>>>>>> possibilities) chosen from a random table of these >>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and >>>>>>>>>>>>>> once in a while change the random order (predetermined in >>>>>>>>>>>>>> a certain order of vowels and consonance strategically >>>>>>>>>>>>>> located in all the private string (groups of 7) should do >>>>>>>>>>>>>> the trick.. Did you solve the cipher yet? I gave plenty of >>>>>>>>>>>>>> info by using the slide rule method and the actual >>>>>>>>>>>>>> private key and ciphertext associated with it. >>>>>>>>>>>>> >>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 >>>>>>>>>>>>> corrections you are supposed to solve against the private >>>>>>>>>>>>> alpha key. When aligning an odd positioned group identifier >>>>>>>>>>>>> from the public key it can only draw one letter from that >>>>>>>>>>>>> group in the private key string. This is because the left >>>>>>>>>>>>> to right movement to align the identifier can't go back to >>>>>>>>>>>>> the left or stay in the same position on that identifier to >>>>>>>>>>>>> choose the first but not the second letter within the same >>>>>>>>>>>>> group. So here is the corrected ciphertext with 4 >>>>>>>>>>>>> corrections -- >>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 It >>>>>>>>>>>>> will be self-explanatory when you solve the cipher. >>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>>>>>>> Using the same exact secret key, and encrypting the >>>>>>>>>>>> plaintext several times in a row should create different >>>>>>>>>>>> ciphertexts. Here is a crude example I made of my highly >>>>>>>>>>>> experimental fractal based encryption algorihtm. This funny >>>>>>>>>>>> fractal thing is radically different than my HMAC cipher. >>>>>>>>>>>> Anyway... >>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact >>>>>>>>>>>> plaintext using the default secret key using the following >>>>>>>>>>>> online program of mine: >>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>>>>>>> The plaintext is: Hello World. >>>>>>>>>>>> 12 bytes >>>>>>>>>>>> >>>>>>>>>>>> ciphertext 0 ______________________________ >>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 0.18726842930653814 >>>>>>>>>>>> 0.15381457747419044 >>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>>>>>>> ______________________________ >>>>>>>>>>>> >>>>>>>>>>>> ciphertext 1 ______________________________ >>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 0.3822450385558595 >>>>>>>>>>>> 0.18493372431673 >>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>>>>>>> ______________________________ >>>>>>>>>>>> >>>>>>>>>>>> ciphertext 2 ______________________________ >>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 0.3486656373192471 >>>>>>>>>>>> 0.3596603216576378 >>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>>>>>>> ______________________________ >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines >>>>>>>>>>>> into the Cipher Text box and click the Decrypt button. >>>>>>>>>>>> Better to use a desktop for the crude layout. >>>>>>>>>>>> >>>>>>>>>>>> This is using something called an IV. However, my HMAC >>>>>>>>>>>> cipher actually encrypts the random iv into the ciphertext >>>>>>>>>>>> itself. So, its not sent in the clear. Read all of: >>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>>> Also, read all of: >>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a >>>>>>>>>>>> look at what happens to the ciphertext. >>>>>>>>>>> >>>>>>>>>>> Chris, It appears to create a few more encrypted 2 character >>>>>>>>>>> codes than the actual number of alpha characters in the >>>>>>>>>>> plaintext in a one-for-one matchup. >>>>>>>>>> >>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte >>>>>>>>>> for each plaintext character. Can you show me an example >>>>>>>>>> plaintext where it creates more? This is different than my >>>>>>>>>> HMAC cipher that can extend the ciphertext and make it larger >>>>>>>>>> than the plaintext via using TRNG random bytes in the >>>>>>>>>> plaintext before encrypting. read all: >>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default >>>>>>>>>> key can be: _______________________ 0.12934470968540027 >>>>>>>>>> 0.025161836871791087 0.03337929216249355 0.11671759502753765 >>>>>>>>>> FF 19 E6 62 D5 _______________________ >>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>>>>>>> If you can give me a plaintext that creates more than hexbytes >>>>>>>>>> than the number of characters in the plaintext, please show me! >>>>>>>>>>> Interesting what is going on there. Also, what are the number >>>>>>>>>>> of mathematical possibilities of creating these 2 unique >>>>>>>>>>> character codes of a mix of alpha-numeric or just alpha, or >>>>>>>>>>> just numeric to give a final total of possibilities? Is it >>>>>>>>>>> 26! *10! ? Probably not that big. >>>>>>>>>> >>>>>>>>>> I am not sure. It depends on how many different secret keys >>>>>>>>>> one can make and how many possibilities of getting the same >>>>>>>>>> exact random IV.[...] >>>>>>>>> >>>>>>>>> Then again, using the example above with Hello at hexbytes: FF >>>>>>>>> 19 E6 62 D5, it would be 5 16-bit numbers. So, the probability >>>>>>>>> would be the chances of rolling 5 16 sided die and getting a >>>>>>>>> result X. Okay, now how many times do we need to roll to get X >>>>>>>>> again? Each roll would be a click of the Encrypt button for >>>>>>>>> the same plaintext and secret key. Yes, the secret key comes >>>>>>>>> into play. Because FF 19 E6 62 D5 does not work with another >>>>>>>>> secret key that was not used to create it. >>>>>>>> >>>>>>>> One big question? A possible scenario -- Joe the encryptor has >>>>>>>> his own offline encryption algorithm in a computer. He copies >>>>>>>> the encrypted message on a thumb drive and loads it into his >>>>>>>> online computer and sends the encrypted message to his foreign >>>>>>>> opertive Alice. Is some other info coming along with that >>>>>>>> encrypted message? There could be something berried in the >>>>>>>> encrypted hex code? My big question is, has this been tried on >>>>>>>> two separate offline systems? If this was all done on one >>>>>>>> system, I was snookered if not then this is fantastic. On the >>>>>>>> encryption side algorithm --- plaintext read in. On the >>>>>>>> decryption side hex coding -- read in. Two separate systems. A >>>>>>>> Huge advantage if both algorithms are on one system to pull a >>>>>>>> fast one. Or a possibility much more data is coming across than >>>>>>>> just the encrypted message? >>>>>>>> Just my take an opinion. Not accusing you of anything because >>>>>>>> you have much more talent than I on fractals and the whole >>>>>>>> structure of the two, I hope, separate >>>>>>>> systems.(encryption,decryption) The question needs to be asked. >>>>>>>> Whatever just keep producing these great renderings which I find >>>>>>>> fascinating. Also what you produced here, even if it was only >>>>>>>> on one system. >>>>>>> It will work on different systems, online or offline. The full >>>>>>> code is on the webpage. So, Bob can be using his own system, and >>>>>>> browser of choice. Alice can decrypt it using her own system, and >>>>>>> browser of choice. The code is all client side. >>>>>> >>>>>> So Alice is the client-side? (decryptor) If so, it makes no sense. >>>>>> >>>>>> >>>>> Try to decrypt this... Just copy-and-paste the ciphertext between >>>>> the lines into the Cipher Text box in the page, and click the >>>>> decrypt button. >>>>> ________________________________ >>>>> 0.39351870705816516 0.12367086856260284 0.10821656063857987 >>>>> 0.5183020398197964 >>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC >>>>> 31 C7 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 >>>>> 7F 54 AF 7D 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 >>>>> 02 80 55 4C EE 3C 49 40 AE E2 >>>>> ________________________________ >>>>> >>>>> What does it say? >>>> It just comes back with the short message "plaintext" I just erased >>>> to paste in the hex code above. Do I need to paste the four >>>> fractional parts into the lower window also? >>> Or do I run one of your Python algorithms? >> >> >> I am still trying to wrap my head around your encryption/decryption >> concept. >> Examing your Python code and your explanations. >> Okay Chris, let's draw a crude comparison. The German enigma was >> employed separately within the different military groups. The navy, >> army, airforce. etc. >> Each had a few or more enigma machines at each end of their radio >> communications networks. Like your system, they could send the >> encrypted code either way but each had charts that would dictate any >> changes to the cypher wheels and plugboards with a time and date stamp >> for that change, even allowing for different time zones if necessary. >> Drawing a comparison to your system like the charts but only employed >> as a special hash function in both algorithms that after each message >> sent and received by either party, Bob or Alice, the new duplicate >> cypher is updated in each algorithm so they match to each letter/hex. >> Crudely put but like the German enigma where each combination of the >> cypher was changed after a period of time instead of after each >> transmission and receiving of YOUR system. Then it is automatically >> updated on both systems algorithms to match any alpha to hex >> conversion on both algorithms to give a new letter/hex cypher. Have I >> got the comparison right? > > One difference is that the Enigma encrypting the same message with the > same 'key' resulted in the same ciphertext. For some reason, I always assumed that, without doing any research to confirm. > Also, the Enigma would never > give a CT letter the same coded letter as the plaintext letter because > of that reflector wheel. Invvvho, this can be a massive weakness? It would seem to squelch out the answer. A known plaintext attack would handle this weakness. I think a lot of messages encrypted by the crazy nazis would end with a known phrase. This has to be one of the aspects wrt known plaintext that helped them crack it. Wrt known plaintext attack, Eve knows the plaintext, get a nazi bastard to encrypt it, and looks at the ciphertext. Eve notices that no plaintext byte in place of the ciphertext byte in the same position is used in the ciphertext.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-04-04 18:43 -0400 |
| Message-ID | <s4dfec$1bce$1@gioia.aioe.org> |
| In reply to | #516638 |
Chris M. Thomasson was thinking very hard : > On 4/4/2021 2:30 AM, FromTheRafters wrote: >> djoyce099 explained on 4/3/2021 : >>> On Saturday, April 3, 2021 at 8:09:35 PM UTC-4, djoyce099 wrote: >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson >>>>> wrote: >>>>>> On 4/3/2021 1:56 PM, djoyce099 wrote: >>>>>>> On Saturday, April 3, 2021 at 2:59:32 PM UTC-4, Chris M. Thomasson >>>>>>> wrote: >>>>>>>> On 4/3/2021 5:44 AM, djoyce099 wrote: >>>>>>>>> On Friday, April 2, 2021 at 6:32:33 PM UTC-4, Chris M. Thomasson >>>>>>>>> wrote: >>>>>>>>>> On 4/2/2021 3:18 PM, Chris M. Thomasson wrote: >>>>>>>>>>> On 4/2/2021 3:01 PM, djoyce099 wrote: >>>>>>>>>>>> On Friday, April 2, 2021 at 1:43:04 AM UTC-4, Chris M. Thomasson >>>>>>>>>>>> wrote: >>>>>>>>>>>>> On 4/1/2021 9:55 PM, djoyce099 wrote: >>>>>>>>>>>>>> On Thursday, April 1, 2021 at 11:45:36 PM UTC-4, djoyce099 >>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 7:58:28 PM UTC-4, Chris M. >>>>>>>>>>>>>>> Thomasson wrote: >>>>>>>>>>>>>>>> On 4/1/2021 8:04 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 10:39:24 AM UTC-4, djoyce099 >>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>> On Thursday, April 1, 2021 at 9:21:54 AM UTC-4, djoyce099 >>>>>>>>>>>>>>>>>> wrote: >>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 9:32:45 PM UTC-4, >>>>>>>>>>>>>>>>>>> djoyce099 wrote: >>>>>>>>>>>>>>>>>>>> On Wednesday, March 31, 2021 at 7:49:23 PM UTC-4, Chris >>>>>>>>>>>>>>>>>>>> M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>>> On 3/31/2021 4:24 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>> On 3/31/2021 1:55 PM, James Waldby wrote: >>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson <chris.m.t...@gmail.com> wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 3/30/2021 11:36 AM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On Monday, March 29, 2021 at 7:48:36 PM UTC-4, >>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/24/2021 12:43 PM, djoyce099 wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, >>>>>>>>>>>>>>>>>>>>>>>>>>>> Chris M. Thomasson wrote: ... >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Now wrt your work, can you decrypt this? >>>>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 >>>>>>>>>>>>>>>>>>>>>>>>>>>>> It uses my simple idea of multiplying against a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> constant in the secret key. You should post it >>>>>>>>>>>>>>>>>>>>>>>>>>>>> there. ... >>>>>>>>>>>>>>>>>>>>>>>>>>> A massive hint. The secret constant consists of a >>>>>>>>>>>>>>>>>>>>>>>>>>> 2.xyx. x y and z are different digits. >>>>>>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.xyz = the original >>>>>>>>>>>>>>>>>>>>>>>>>>> rational. Take the convergents of the original >>>>>>>>>>>>>>>>>>>>>>>>>>> rational and use your initial mapping of numbers >>>>>>>>>>>>>>>>>>>>>>>>>>> to letters to decrypt the message. ... >>>>>>>>>>>>>>>>>>>>>>>>> 2. followed by three digits. So, its not 2.877 >>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>> Testing the values from 2.000 to 2.999, and limiting >>>>>>>>>>>>>>>>>>>>>>>> to 2.xyz where x < y < z, the only word I see is >>>>>>>>>>>>>>>>>>>>>>>> `gab`, from divider 2.269. >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> Its a number from 2.000 to 2.999. However, you need to >>>>>>>>>>>>>>>>>>>>>>> divide 17.4016863080244085 by it to get the original >>>>>>>>>>>>>>>>>>>>>>> number that contains the plaintext in its >>>>>>>>>>>>>>>>>>>>>>> convergents. The answer is below, spoiler alert: ... >>>>>>>>>>>>>>>>>>>>>>> //// >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> 17.4016863080244085 / 2.123 = 8.1967434328895 >>>>>>>>>>>>>>>>>>>>>>> 8.1967434328895 has the convergents: >>>>>>>>>>>>>>>>>>>>>>> [8; 5 12 12 15] >>>>>>>>>>>>>>>>>>>>>>> The plaintext is: hello >>>>>>>>>>>>>>>>>>>>>>> ;^) >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> Perhaps you didn't use arithmetic that was accurate >>>>>>>>>>>>>>>>>>>>>> enough? >>>>>>>>>>>>>>>>>>>>> Shit. Must have. The funny thing is that wolfram gives >>>>>>>>>>>>>>>>>>>>> the convergents [8; 5 12 12 15] for 8.1967434328895. >>>>>>>>>>>>>>>>>>>>> Strange, it must be rounding or something. >>>>>>>>>>>>>>>>>>>>> https://www.wolframalpha.com/input/?i=8.1967434328895 >>>>>>>>>>>>>>>>>>>>>> The convergents actually are [8; 5 12 12 14 1 282893 >>>>>>>>>>>>>>>>>>>>>> ...], which my previously-mentioned >>>>>>>>>>>>>>>>>>>>>> continued-fractions-to-letters program showed as >>>>>>>>>>>>>>>>>>>>>> `hellna`, which is not found in usual dictionaries. >>>>>>>>>>>>>>>>>>>>>> On the other hand, 8.196743432889529 has c.f. [8; 5 12 >>>>>>>>>>>>>>>>>>>>>> 12 15 20614211 ...] >>>>>>>>>>>>>>>>>>>> I am not sure how many digits in the decimal expansion of >>>>>>>>>>>>>>>>>>>> the target rational you need to compare to the number of >>>>>>>>>>>>>>>>>>>> terms in the cf. I way overdid it in my first post but it >>>>>>>>>>>>>>>>>>>> was a longer message that was encrypted but probably >>>>>>>>>>>>>>>>>>>> could have used a much smaller in length rational to get >>>>>>>>>>>>>>>>>>>> the desired number of of terms in the cf for the number >>>>>>>>>>>>>>>>>>>> to letter conversion. >>>>>>>>>>>>>>>>>>>> What about the new cipher I propose using only numbers >>>>>>>>>>>>>>>>>>>> 1-7 in the even positions -- 2,4,6,8,10,12,14.. and >>>>>>>>>>>>>>>>>>>> group number identifiers 1-7 in the odd positions -- >>>>>>>>>>>>>>>>>>>> 1,3,5,7,9,11,13.. Think of it as using a slide rule where >>>>>>>>>>>>>>>>>>>> the private key (a string of random letters along with >>>>>>>>>>>>>>>>>>>> each group number identifiers) is on the fixed portion of >>>>>>>>>>>>>>>>>>>> the rule and the slider portion has the cipher encrypted >>>>>>>>>>>>>>>>>>>> message of just the numbers 1-7 and the 7 group >>>>>>>>>>>>>>>>>>>> identifiers. These two strings are placed side by side >>>>>>>>>>>>>>>>>>>> and sliding the ciphertext from left to right and >>>>>>>>>>>>>>>>>>>> aligning each letter with the encrypted numbers of the >>>>>>>>>>>>>>>>>>>> sliding portion of the rule. The examples I have >>>>>>>>>>>>>>>>>>>> previously posted --- A letter is only used once in the >>>>>>>>>>>>>>>>>>>> left to right scan like the word little the first T in >>>>>>>>>>>>>>>>>>>> little is used then the scan continues by the decryptor >>>>>>>>>>>>>>>>>>>> for the second T because this private key string is made >>>>>>>>>>>>>>>>>>>> up of 49 alpha characters = 26*2 minus the second XYZ = >>>>>>>>>>>>>>>>>>>> 49 Alpha characters and 1-7 group identifiers placed in >>>>>>>>>>>>>>>>>>>> the odd count positions. Example below where this is easy >>>>>>>>>>>>>>>>>>>> to decrypt by just this simple method -- >>>>>>>>>>>>>>>>>>>> ----------------------------------------------------------------------------------------- >>>>>>>>>>>>>>>>>>>> Fixed private >>>>>>>>>>>>>>>>>>>> key--------------------------------------------------------- >>>>>>>>>>>>>>>>>>>> ----------------------------------------------"3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>>>>>> > Sliding cipher for the right letter alignment --- a >>>>>>>>>>>>>>>>>>>> public key sent to be decrypted. moving --> then when >>>>>>>>>>>>>>>>>>>> reaching the end of the fixed private key the cipher is >>>>>>>>>>>>>>>>>>>> brought back <--- (no scan ) and scanning ----> again >>>>>>>>>>>>>>>>>>>> for the correct letter alignment to be cherry-picked >>>>>>>>>>>>>>>>>>>> from the private key. This is giving the whole cipher >>>>>>>>>>>>>>>>>>>> idea away but the order of the characters in the private >>>>>>>>>>>>>>>>>>>> key can be drastically changed along with the group >>>>>>>>>>>>>>>>>>>> identifiers then the public key would be useless to the >>>>>>>>>>>>>>>>>>>> person without the new private string. In a completed >>>>>>>>>>>>>>>>>>>> scan (end of too the right ------>), there could be >>>>>>>>>>>>>>>>>>>> several stops for letter alignments. I am just using this >>>>>>>>>>>>>>>>>>>> analogy of sliding but the right parsing of strings in >>>>>>>>>>>>>>>>>>>> both algorithms would get the job done. The above >>>>>>>>>>>>>>>>>>>> decryption of the public key above is easy if you follow >>>>>>>>>>>>>>>>>>>> the rules. This is just what I can remember from these >>>>>>>>>>>>>>>>>>>> old algorithms I produced in basic on my commodore 64 >>>>>>>>>>>>>>>>>>>> back in the 80s that worked great for encrypting and >>>>>>>>>>>>>>>>>>>> decrypting these numbers only 1-7 ciphers. Just trying >>>>>>>>>>>>>>>>>>>> to transfer these thoughts into Python but not getting >>>>>>>>>>>>>>>>>>>> anywhere yet. >>>>>>>>>>>>>>>>>>> Has anyone figured out, what I call, my seven square >>>>>>>>>>>>>>>>>>> cipher yet? Or found any flaws in the concept? >>>>>>>>>>>>>>>>>> Adding a level of security to any public key cipher of the >>>>>>>>>>>>>>>>>> above nature the group identifiers could be changed to a >>>>>>>>>>>>>>>>>> different identifier position after each message sent. This >>>>>>>>>>>>>>>>>> way no patterns of odd position numbers can be detected >>>>>>>>>>>>>>>>>> even though some identifiers sometimes are used in >>>>>>>>>>>>>>>>>> succession breaking any pattern possible with future cipher >>>>>>>>>>>>>>>>>> messages. >>>>>>>>>>>>>>>>>> You may ask, why did I reveal the secrets to this cipher? >>>>>>>>>>>>>>>>>> Okay, Just say I presented the public key --- >>>>>>>>>>>>>>>>>> 5,7,1,2,1,6,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,6,7,2,7 >>>>>>>>>>>>>>>>>> Then said, solve this cipher, what is the hidden written >>>>>>>>>>>>>>>>>> message these numbers represent? Duh, This is more >>>>>>>>>>>>>>>>>> powerful than even the German enigma machine. This is >>>>>>>>>>>>>>>>>> because the public key encoded numeric message can be any >>>>>>>>>>>>>>>>>> length but the private key is just 56 characters long. 1-7 >>>>>>>>>>>>>>>>>> group identifiers randomly located and the 49 Alpha >>>>>>>>>>>>>>>>>> characters. In other words, I would die with this secret. >>>>>>>>>>>>>>>>>> ;-) >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> That was stupid of me, The above cipher can be solved by >>>>>>>>>>>>>>>>> anyone knowing the rules and the private key already >>>>>>>>>>>>>>>>> revealed. >>>>>>>>>>>>>>>> Also, if you are going to develop a cipher out of this, you >>>>>>>>>>>>>>>> need to make sure that every encryption generates a radically >>>>>>>>>>>>>>>> different ciphertext, even for the exact same plaintext. So >>>>>>>>>>>>>>>> encrypting the same plaintext several times in a row would >>>>>>>>>>>>>>>> produce very different ciphertexts. >>>>>>>>>>>>>>> Yes this is true, but because only 7 digits are used to pick >>>>>>>>>>>>>>> an alpha character of 26 possibilities only the order of these >>>>>>>>>>>>>>> 7 group identifiers is changed after each message The >>>>>>>>>>>>>>> different combinations are 7! . A lot of messages (5048). >>>>>>>>>>>>>>> Changed randomly. This way no letter connections other than a >>>>>>>>>>>>>>> few out of 7 letters in a few groups after a few messages are >>>>>>>>>>>>>>> sent but then complete contradictory results pointing to a >>>>>>>>>>>>>>> letter involved with one particular identifier group of 7 >>>>>>>>>>>>>>> letters. A bunch of test ciphertext would have to be processed >>>>>>>>>>>>>>> to prove this point. The order right now of these group >>>>>>>>>>>>>>> identifiers in this one example of the private key above is >>>>>>>>>>>>>>> --- 3,5,1,6,2,7,4 and in odd positions in the private key >>>>>>>>>>>>>>> alpha string --- 1,9,17,25,33,41,49 whose position never >>>>>>>>>>>>>>> changes. 3,5,1,6,2,7,4 have 7! unique possibilities or (5040 >>>>>>>>>>>>>>> possibilities) chosen from a random table of these >>>>>>>>>>>>>>> possibilities. So only a 7 number change is necessary and >>>>>>>>>>>>>>> once in a while change the random order (predetermined in a >>>>>>>>>>>>>>> certain order of vowels and consonance strategically located >>>>>>>>>>>>>>> in all the private string (groups of 7) should do the trick.. >>>>>>>>>>>>>>> Did you solve the cipher yet? I gave plenty of info by using >>>>>>>>>>>>>>> the slide rule method and the actual private key and >>>>>>>>>>>>>>> ciphertext associated with it. >>>>>>>>>>>>>> >>>>>>>>>>>>>> I just ran an actual algorithm and the ciphertext has 2 >>>>>>>>>>>>>> corrections you are supposed to solve against the private >>>>>>>>>>>>>> alpha key. When aligning an odd positioned group identifier >>>>>>>>>>>>>> from the public key it can only draw one letter from that >>>>>>>>>>>>>> group in the private key string. This is because the left to >>>>>>>>>>>>>> right movement to align the identifier can't go back to the >>>>>>>>>>>>>> left or stay in the same position on that identifier to choose >>>>>>>>>>>>>> the first but not the second letter within the same group. So >>>>>>>>>>>>>> here is the corrected ciphertext with 4 corrections -- >>>>>>>>>>>>>> 5,7,1,2,6,1,7,1,1,6,7,1,4,2,3,5,6,7,4,6,1,6,6,2,2,2,4,2 It will >>>>>>>>>>>>>> be self-explanatory when you solve the cipher. >>>>>>>>>>>>> I am busy right now, but please post it over on sci.crypt. >>>>>>>>>>>>> Using the same exact secret key, and encrypting the plaintext >>>>>>>>>>>>> several times in a row should create different ciphertexts. >>>>>>>>>>>>> Here is a crude example I made of my highly experimental >>>>>>>>>>>>> fractal based encryption algorihtm. This funny fractal thing is >>>>>>>>>>>>> radically different than my HMAC cipher. Anyway... >>>>>>>>>>>>> Here are several ciphertexts that decrypt to the same exact >>>>>>>>>>>>> plaintext using the default secret key using the following >>>>>>>>>>>>> online program of mine: >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ffe >>>>>>>>>>>>> The plaintext is: Hello World. >>>>>>>>>>>>> 12 bytes >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 0 ______________________________ >>>>>>>>>>>>> 0.07464055294813914 0.21413369654338263 0.18726842930653814 >>>>>>>>>>>>> 0.15381457747419044 >>>>>>>>>>>>> 13 65 3C 20 32 43 F4 50 66 9C 27 7A >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 1 ______________________________ >>>>>>>>>>>>> 0.10712703156460045 0.3825663517793289 0.3822450385558595 >>>>>>>>>>>>> 0.18493372431673 >>>>>>>>>>>>> DF 2D 40 B5 C4 69 C0 C8 E8 9E 4C 99 >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> ciphertext 2 ______________________________ >>>>>>>>>>>>> 0.4562359936711957 0.21850028449704323 0.3486656373192471 >>>>>>>>>>>>> 0.3596603216576378 >>>>>>>>>>>>> 4A 81 3D 5E 3F 26 F7 CF FD 15 83 15 >>>>>>>>>>>>> ______________________________ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> To decrypt, copy-and-paste the text in between the lines into >>>>>>>>>>>>> the Cipher Text box and click the Decrypt button. Better to use >>>>>>>>>>>>> a desktop for the crude layout. >>>>>>>>>>>>> >>>>>>>>>>>>> This is using something called an IV. However, my HMAC cipher >>>>>>>>>>>>> actually encrypts the random iv into the ciphertext itself. So, >>>>>>>>>>>>> its not sent in the clear. Read all of: >>>>>>>>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>>>> Also, read all of: >>>>>>>>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Actually, try clicking Encrypt multiple times and take a look at >>>>>>>>>>>>> what happens to the ciphertext. >>>>>>>>>>>> >>>>>>>>>>>> Chris, It appears to create a few more encrypted 2 character >>>>>>>>>>>> codes than the actual number of alpha characters in the plaintext >>>>>>>>>>>> in a one-for-one matchup. >>>>>>>>>>> >>>>>>>>>>> My highly experimental FFE cipher creates a ciphertext hexbyte for >>>>>>>>>>> each plaintext character. Can you show me an example plaintext >>>>>>>>>>> where it creates more? This is different than my HMAC cipher that >>>>>>>>>>> can extend the ciphertext and make it larger than the plaintext >>>>>>>>>>> via using TRNG random bytes in the plaintext before encrypting. >>>>>>>>>>> read all: http://funwithfractals.atspace.cc/ct_cipher >>>>>>>>>>> Now, back to my FFE. So, encrypting Hello using the default key >>>>>>>>>>> can be: _______________________ 0.12934470968540027 >>>>>>>>>>> 0.025161836871791087 0.03337929216249355 0.11671759502753765 >>>>>>>>>>> FF 19 E6 62 D5 _______________________ >>>>>>>>>>> 5 Hexbytes FF 19 E6 62 D5. >>>>>>>>>>> If you can give me a plaintext that creates more than hexbytes >>>>>>>>>>> than the number of characters in the plaintext, please show me! >>>>>>>>>>>> Interesting what is going on there. Also, what are the number of >>>>>>>>>>>> mathematical possibilities of creating these 2 unique character >>>>>>>>>>>> codes of a mix of alpha-numeric or just alpha, or just numeric to >>>>>>>>>>>> give a final total of possibilities? Is it 26! *10! ? Probably >>>>>>>>>>>> not that big. >>>>>>>>>>> >>>>>>>>>>> I am not sure. It depends on how many different secret keys one >>>>>>>>>>> can make and how many possibilities of getting the same exact >>>>>>>>>>> random IV.[...] >>>>>>>>>> >>>>>>>>>> Then again, using the example above with Hello at hexbytes: FF 19 >>>>>>>>>> E6 62 D5, it would be 5 16-bit numbers. So, the probability would >>>>>>>>>> be the chances of rolling 5 16 sided die and getting a result X. >>>>>>>>>> Okay, now how many times do we need to roll to get X again? Each >>>>>>>>>> roll would be a click of the Encrypt button for the same plaintext >>>>>>>>>> and secret key. Yes, the secret key comes into play. Because FF 19 >>>>>>>>>> E6 62 D5 does not work with another secret key that was not used >>>>>>>>>> to create it. >>>>>>>>> >>>>>>>>> One big question? A possible scenario -- Joe the encryptor has his >>>>>>>>> own offline encryption algorithm in a computer. He copies the >>>>>>>>> encrypted message on a thumb drive and loads it into his online >>>>>>>>> computer and sends the encrypted message to his foreign opertive >>>>>>>>> Alice. Is some other info coming along with that encrypted message? >>>>>>>>> There could be something berried in the encrypted hex code? My big >>>>>>>>> question is, has this been tried on two separate offline systems? If >>>>>>>>> this was all done on one system, I was snookered if not then this is >>>>>>>>> fantastic. On the encryption side algorithm --- plaintext read in. >>>>>>>>> On the decryption side hex coding -- read in. Two separate systems. >>>>>>>>> A Huge advantage if both algorithms are on one system to pull a fast >>>>>>>>> one. Or a possibility much more data is coming across than just the >>>>>>>>> encrypted message? >>>>>>>>> Just my take an opinion. Not accusing you of anything because you >>>>>>>>> have much more talent than I on fractals and the whole structure of >>>>>>>>> the two, I hope, separate systems.(encryption,decryption) The >>>>>>>>> question needs to be asked. >>>>>>>>> Whatever just keep producing these great renderings which I find >>>>>>>>> fascinating. Also what you produced here, even if it was only on >>>>>>>>> one system. >>>>>>>> It will work on different systems, online or offline. The full code >>>>>>>> is on the webpage. So, Bob can be using his own system, and browser >>>>>>>> of choice. Alice can decrypt it using her own system, and browser of >>>>>>>> choice. The code is all client side. >>>>>>> >>>>>>> So Alice is the client-side? (decryptor) If so, it makes no sense. >>>>>>> >>>>>>> >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>>>> lines into the Cipher Text box in the page, and click the decrypt >>>>>> button. >>>>>> ________________________________ >>>>>> 0.39351870705816516 0.12367086856260284 0.10821656063857987 >>>>>> 0.5183020398197964 >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>>>> 49 40 AE E2 >>>>>> ________________________________ >>>>>> >>>>>> What does it say? >>>>> It just comes back with the short message "plaintext" I just erased to >>>>> paste in the hex code above. Do I need to paste the four fractional >>>>> parts into the lower window also? >>>> Or do I run one of your Python algorithms? >>> >>> >>> I am still trying to wrap my head around your encryption/decryption >>> concept. >>> Examing your Python code and your explanations. >>> Okay Chris, let's draw a crude comparison. The German enigma was employed >>> separately within the different military groups. The navy, army, airforce. >>> etc. >>> Each had a few or more enigma machines at each end of their radio >>> communications networks. Like your system, they could send the encrypted >>> code either way but each had charts that would dictate any changes to the >>> cypher wheels and plugboards with a time and date stamp for that change, >>> even allowing for different time zones if necessary. Drawing a comparison >>> to your system like the charts but only employed as a special hash >>> function in both algorithms that after each message sent and received by >>> either party, Bob or Alice, the new duplicate cypher is updated in each >>> algorithm so they match to each letter/hex. Crudely put but like the >>> German enigma where each combination of the cypher was changed after a >>> period of time instead of after each transmission and receiving of YOUR >>> system. Then it is automatically updated on both systems algorithms to >>> match any alpha to hex conversion on both algorithms to give a new >>> letter/hex cypher. Have I got the comparison right? >> >> One difference is that the Enigma encrypting the same message with the same >> 'key' resulted in the same ciphertext. > > For some reason, I always assumed that, without doing any research to > confirm. > > >> Also, the Enigma would never give a CT letter the same coded letter as the >> plaintext letter because of that reflector wheel. > > Invvvho, this can be a massive weakness? It would seem to squelch out the > answer. A known plaintext attack would handle this weakness. I think a lot of > messages encrypted by the crazy nazis would end with a known phrase. This has > to be one of the aspects wrt known plaintext that helped them crack it. Wrt > known plaintext attack, Eve knows the plaintext, get a nazi bastard to > encrypt it, and looks at the ciphertext. Eve notices that no plaintext byte > in place of the ciphertext byte in the same position is used in the > ciphertext. IIRC one of the cribs was German for 'weather report' I'm sure the greetings and salutations were cribs also.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-04 14:14 -0700 |
| Message-ID | <s4da6s$15p7$2@gioia.aioe.org> |
| In reply to | #516539 |
On 4/3/2021 5:09 PM, djoyce099 wrote: > On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson wrote: [...][massive snip] >>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>> lines into the Cipher Text box in the page, and click the decrypt button. >>> >>> ________________________________ >>> >>> 0.39351870705816516 0.12367086856260284 >>> 0.10821656063857987 0.5183020398197964 >>> >>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>> 49 40 AE E2 >>> >>> ________________________________ >>> >>> >>> What does it say? >> It just comes back with the short message "plaintext" I just erased to paste in the hex code above. >> Do I need to paste the four fractional parts into the lower window also? > Or do I run one of your Python algorithms? > No. My Python code has nothing to do with my crude online example. Did you take a look at my JavaScript code in the page?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-07 17:22 -0700 |
| Message-ID | <s4libe$1bac$2@gioia.aioe.org> |
| In reply to | #516634 |
On 4/4/2021 2:14 PM, Chris M. Thomasson wrote: > On 4/3/2021 5:09 PM, djoyce099 wrote: >> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson >>> wrote: > [...][massive snip] >>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>> lines into the Cipher Text box in the page, and click the decrypt >>>> button. >>>> >>>> ________________________________ >>>> >>>> 0.39351870705816516 0.12367086856260284 >>>> 0.10821656063857987 0.5183020398197964 >>>> >>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>> 49 40 AE E2 >>>> >>>> ________________________________ >>>> >>>> >>>> What does it say? >>> It just comes back with the short message "plaintext" I just erased >>> to paste in the hex code above. >>> Do I need to paste the four fractional parts into the lower window also? >> Or do I run one of your Python algorithms? >> > > No. My Python code has nothing to do with my crude online example. Did > you take a look at my JavaScript code in the page? Afaict, you seemed to have confused my HMAC cipher coded in C and ported to Python, with my FFE code in JavaScript. Take a look at my response to you over in comp.lang.c. By the way, post you're idea over in sci.crypt. I am a little busy right now. I do want to put my HMAC cipher online, but have not found the time yet.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-04-07 20:32 -0700 |
| Message-ID | <ea12f130-a4be-4241-a661-e21e4133c2c8n@googlegroups.com> |
| In reply to | #517008 |
On Wednesday, April 7, 2021 at 8:22:18 PM UTC-4, Chris M. Thomasson wrote: > On 4/4/2021 2:14 PM, Chris M. Thomasson wrote: > > On 4/3/2021 5:09 PM, djoyce099 wrote: > >> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: > >>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson > >>> wrote: > > [...][massive snip] > >>>> Try to decrypt this... Just copy-and-paste the ciphertext between the > >>>> lines into the Cipher Text box in the page, and click the decrypt > >>>> button. > >>>> > >>>> ________________________________ > >>>> > >>>> 0.39351870705816516 0.12367086856260284 > >>>> 0.10821656063857987 0.5183020398197964 > >>>> > >>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 > >>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D > >>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C > >>>> 49 40 AE E2 > >>>> > >>>> ________________________________ > >>>> > >>>> > >>>> What does it say? > >>> It just comes back with the short message "plaintext" I just erased > >>> to paste in the hex code above. > >>> Do I need to paste the four fractional parts into the lower window also? > >> Or do I run one of your Python algorithms? > >> > > > > No. My Python code has nothing to do with my crude online example. Did > > you take a look at my JavaScript code in the page? > > Afaict, you seemed to have confused my HMAC cipher coded in C and ported > to Python, with my FFE code in JavaScript. Take a look at my response to > you over in comp.lang.c. By the way, post you're idea over in sci.crypt. > I am a little busy right now. > > I do want to put my HMAC cipher online, but have not found the time yet. What would happen if you and another party started to communicate using only your public keys on Facebook or one of the other social platforms. At the least, you would probably get canceled by the big tech commies or have the FBI breathing down your neck. It would be fun though! I did post my idea on sci-crypt. It is childs play compared to what you are working on but still an interesting concept. It also could be set up to send and receive public keys where the sender's public key would basically update the receiver's private key on each message sent so it could decrypt each new message sent. Does your secret key have a direct link to your private key?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-07 21:02 -0700 |
| Message-ID | <s4lv98$1plt$1@gioia.aioe.org> |
| In reply to | #517028 |
On 4/7/2021 8:32 PM, djoyce099 wrote: > On Wednesday, April 7, 2021 at 8:22:18 PM UTC-4, Chris M. Thomasson wrote: >> On 4/4/2021 2:14 PM, Chris M. Thomasson wrote: >>> On 4/3/2021 5:09 PM, djoyce099 wrote: >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson >>>>> wrote: >>> [...][massive snip] >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>>>> lines into the Cipher Text box in the page, and click the decrypt >>>>>> button. >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> 0.39351870705816516 0.12367086856260284 >>>>>> 0.10821656063857987 0.5183020398197964 >>>>>> >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>>>> 49 40 AE E2 >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> >>>>>> What does it say? >>>>> It just comes back with the short message "plaintext" I just erased >>>>> to paste in the hex code above. >>>>> Do I need to paste the four fractional parts into the lower window also? >>>> Or do I run one of your Python algorithms? >>>> >>> >>> No. My Python code has nothing to do with my crude online example. Did >>> you take a look at my JavaScript code in the page? >> >> Afaict, you seemed to have confused my HMAC cipher coded in C and ported >> to Python, with my FFE code in JavaScript. Take a look at my response to >> you over in comp.lang.c. By the way, post you're idea over in sci.crypt. >> I am a little busy right now. >> >> I do want to put my HMAC cipher online, but have not found the time yet. > > What would happen if you and another party started to communicate using only your > public keys on Facebook or one of the other social platforms. I have communicated using my experimental FFE with the default key, or public, key if you will. Iirc: https://www.facebook.com/chris.thomasson.31/posts/444696843355986 The decrypted plaintext seems to describe the current state of the world. Here is the ciphertext using the default key in that FB post: 0.16501081422957053 0.19607761335050175 0.14177375765872394 0.24909630937438232 2D 83 F8 75 24 F9 AC BE 06 66 47 25 95 16 74 A4 8F 07 1A C0 23 E2 DE 83 E3 61 91 AA 88 B0 D2 93 B9 CB F8 99 C7 76 84 02 15 > At the least, you would probably get canceled by the big tech commies or have the FBI > breathing down your neck. Look what happened to Google+, they can take anybody down, and off their own creations all in one shot! https://www.googleplusdatalitigation.com > It would be fun though! > I did post my idea on sci-crypt. > It is childs play compared to what you are working on but still an interesting concept. > It also could be set up to send and receive public keys where the sender's public key > would basically update the receiver's private key on each message sent so it could decrypt > each new message sent. > Does your secret key have a direct link to your private key? The secret key for my FFE is in the crude webpage UI. Best to view it on a desktop. http://funwithfractals.atspace.cc/ffe Keep in mind that I have two radically different ciphers out there. The other one is my HMAC cipher: http://funwithfractals.atspace.cc/ct_cipher with a rather crude example in C: https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/WIxIwoK7DAAJ
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-07 21:10 -0700 |
| Message-ID | <s4lvoa$1tsq$1@gioia.aioe.org> |
| In reply to | #517028 |
On 4/7/2021 8:32 PM, djoyce099 wrote: > On Wednesday, April 7, 2021 at 8:22:18 PM UTC-4, Chris M. Thomasson wrote: >> On 4/4/2021 2:14 PM, Chris M. Thomasson wrote: >>> On 4/3/2021 5:09 PM, djoyce099 wrote: >>>> On Saturday, April 3, 2021 at 7:50:41 PM UTC-4, djoyce099 wrote: >>>>> On Saturday, April 3, 2021 at 5:11:45 PM UTC-4, Chris M. Thomasson >>>>> wrote: >>> [...][massive snip] >>>>>> Try to decrypt this... Just copy-and-paste the ciphertext between the >>>>>> lines into the Cipher Text box in the page, and click the decrypt >>>>>> button. >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> 0.39351870705816516 0.12367086856260284 >>>>>> 0.10821656063857987 0.5183020398197964 >>>>>> >>>>>> 1C B5 06 8A 79 13 96 5E B5 8D AE FE 88 E4 91 1C 5A 2B E0 86 DE EC 31 C7 >>>>>> 62 A2 13 9B 52 4A B5 DA 9F EC 93 CD F5 96 2C C9 4E 5E 1D 99 7F 54 AF 7D >>>>>> 03 F2 B1 32 8A 02 6F 4D E9 49 47 C6 11 D7 87 4A D2 A6 02 80 55 4C EE 3C >>>>>> 49 40 AE E2 >>>>>> >>>>>> ________________________________ >>>>>> >>>>>> >>>>>> What does it say? >>>>> It just comes back with the short message "plaintext" I just erased >>>>> to paste in the hex code above. >>>>> Do I need to paste the four fractional parts into the lower window also? >>>> Or do I run one of your Python algorithms? >>>> >>> >>> No. My Python code has nothing to do with my crude online example. Did >>> you take a look at my JavaScript code in the page? >> >> Afaict, you seemed to have confused my HMAC cipher coded in C and ported >> to Python, with my FFE code in JavaScript. Take a look at my response to >> you over in comp.lang.c. By the way, post you're idea over in sci.crypt. >> I am a little busy right now. >> >> I do want to put my HMAC cipher online, but have not found the time yet. > > What would happen if you and another party started to communicate using only your > public keys on Facebook or one of the other social platforms. > At the least, you would probably get canceled by the big tech commies or have the FBI > breathing down your neck. > It would be fun though! > I did post my idea on sci-crypt. Can you find the post? Is it older? > It is childs play compared to what you are working on but still an interesting concept. > It also could be set up to send and receive public keys where the sender's public key > would basically update the receiver's private key on each message sent so it could decrypt > each new message sent. > Does your secret key have a direct link to your private key? > > >
[toc] | [prev] | [next] | [standalone]
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
Back to top | Article view | sci.math
csiph-web