Ham radio operator: KY8D, M0KYD, VA7KYD, and ZS1KYD. Fluent in Esperanto. Designer in Rhino 3D CAD. Programmer in LabVIEW, Perl, and Forth. Retired Senior Test Engineer.
#morsecode #hamradio #labview #forth #esperanto
| Personal | https://starling.us/gan |
| Ham Radio | https://ky8d.net |
| Esperanto | https://esperanto.us |
| LabVIEW & Perl | https://ky8d.net/free |
Hey rest of the world! Would you all please kindly stop coddling my country's foremost delusion? We suffer from plural, but one has long since risen high above all of the rest.
Just suppose, what if any other nation at all were to begin insistently self-identifying as an entire continent?
For instance, what if Japan should arrogate unto itself symbolic identity with the whole of Asia?
No, wait... Didn't they actually pull that off some little while back? And just look how it turned out...
Getting old sucks....
Last Saturday's ΜRI confirms neck joint arthritis: severe left sided C5-6 and C6-7 left neuroforaminal stenosis.
Cause of near constant throbing ache from left shoulder blade down to the pinkie finger that I've been putting up with the past six weeks.
Steroid pills had been helping, but Rx has run since out. Cortisone injections are now in my future.
On the bright side, I'm right-handed. Morse code I'm still able to do, if somewhat distracted meanwhile.
Hurrah! Eureka! This guy's GitHub archive is an absolute treasure trove!
Well, drat! More than one genuine crypto guru has politely poo-pooed my 'bright idea' of yesterday morning for a pseudo-random number generator.
In its place, they several have recommend a well proven standard algorithm called Blum Blum Shub.
Herewith do I disavow all association with the hairbrained concept above and begin coding Blum Blum Shub into #Forth.
Just this morning it dawned on me how to generate a repeatable sequence of truly random numbers for encryption purposes.
1. Obtain a pseudo-random number as/per usual.
2. Permute it into a 64-element Knapsack key.
3. Obtain a new pseudo-random number.
4. Encrypt that with the key from step 2.
5. Repeat steps 1 and 2 for a new key.
6. Decrypt the result of step 4 with the new key.
I now have this working in #Forth. Looks good so far.
What say you all?
My little encryption project enjoyed a milestone of sorts today. Math for big integers now includes exponentiation, both with and without modulo. Will also solve for greatest common factor. For integers of any size, the only limit being available memory to hold the arrays.
The programming language is #Forth
Today's Forth programming success is three little words added to my project aimed toward eventual RSA encryption.
e@ and e! -- Just like @ and ! but endian-aware. Each will mirror-image the transfer when so appropriate.
a.u+ -- Just like M+ but sums top of stack into a c-array holding a big integer of any length. Like so at any column offset along said c-arrray. Intended for use principally inside the DO LOOP of a word still being coded which shall perform multiplication.
As of last night in the programming language Forth, I'm now able not only to add, but also subtract. Numbers to any precision! No longer tied down to a piddly 32 or 64 bits. Numbers instead of any size up to the limit of memory.
Today I'll begin on multiplication. Planning to exponentiate after that. Saving the euphoric joys of long division with remainder (aka modulo), for last.
The ultimate goal is RSA encryption, just for fun. A most engaging (and low-cost) retirement hobby.
A progress report on my encryption project coded in Forth.
Twelve files authored and tested. Main is fybb.fs which calls INCLUDED others. Words for byte chain xor-ing, byte and bit shuffling, byte position exchanges. Those plus binary to Grey conversion and bit rolling of arbitrarily large arrays (or any portion thereof) as if the contents were one single enormous number.
Just today, words for a multi-line pass phrase with three tries for a double match.