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 2 of 6 — ← Prev page 1 [2] 3 4 5 6 Next page →
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-20 17:16 -0700 |
| Message-ID | <ee1c03c4-389a-4ec9-802d-6f2958bd9c2bn@googlegroups.com> |
| In reply to | #515023 |
On Saturday, March 20, 2021 at 8:09:42 PM UTC-4, djoyce099 wrote: > On Saturday, March 20, 2021 at 8:06:01 PM UTC-4, Chris M. Thomasson wrote: > > On 3/20/2021 4:58 PM, djoyce099 wrote: > > > On Saturday, March 20, 2021 at 7:18:41 PM UTC-4, Chris M. Thomasson wrote: > > [...] > > >>>> Come on Chris, you know the name of this process. > > >>> Basically, 129 fractions were involved. > > >>> > > >> For some reason you have me thinking of convergents. > > >> > > >> 5, 3, 18, 25, 16, 20, 9, 14, 7, 20, 8, 9 comes to mind. > > > Getting close to the first word but no cigar. You are missing the first letter. > > > > > > > > Is the first letter 4? > You got it and that is the start of the poem. simple number-letter replacement. I'm still not sure on just how many numbers you need of this rational to carry out the CF for the full 129 letters involved. I posted them all but probably didn't have to.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-20 14:54 -0700 |
| Message-ID | <s35quh$t8q$1@gioia.aioe.org> |
| In reply to | #514995 |
On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > On 3/20/2021 2:22 PM, djoyce099 wrote: >> The rational number below will produce a decrypted >> poem using number to letter plain text for a total of 129 letters. >> How is it done? >> What you see below has to be processed. >> A certain mathematical process to this number >> has to be initiated to solve this puzzle. >> The simple process will expose the simplicity >> of this cipher. > > Did you xor the plaintext with the decimal expansion of the rational? > >> >> The rational number below may not need to be >> as large a decimal expansion as it is but probably >> about 90% of it is necessary to complete the process >> of decrypting. >> You will need an online calculator or coding language that >> supports a level of 10,000 digit precision, that is what the >> decimal expansion of the number below has. >> >> 4.187712846814656608060732918259108770874449265728424018596029628858094844009685949860782027378038056761807604280273008996752199234546409671468770571930526274960145551358466684183719431378092648508021661601994903379878880042778032637233193496151434357216170853272412145048795658483433096110454242973389136013456073243647892721898267681525658769052795363987514092626856068608417394241541368126034205825614874919755289790774645331682765266722353822397782406215384331546350129798518449187036543244053893097980370119140144354890349541027971147890441032606005563013889342605140024268120674391339189077758108874551138891366583580369812620594057061310970506411769256065174324853423664348672485001270342524168456961407163945674172091660255779230268507929772244912821686039149597728778786776650739479486175529154050983638246389644011570693085404988027689447730276877378108108956350503246397123462302020440466460200582137355974185549004949273375829085468202464300446334477300902040227091595507124573952797530858179437842052140619594181351245847228680165097081665953689378069873327490134260691661394699534860339044640973371226650793778261002201136077263433558715339483222531899862403232085074038934911575309972063642266912244239950106487580618604355805139439582418327088643438446493398316608356324878239855373423929799927799493835397905533606094938627232686114580884895330767671506186381960248258261199388486246557309931134296744566225147789889854940626295768640232628724013184172600457079570523302080797975092334962901118345415511595982705605581216687998240580891701696576506270366394426860638758971634034111568690290564387782842866209925060839377293130940104720369140855156121125168038167482125186587881708135623072872336443182956728284858147745183404718349515192936482964688807592369626324482995923343951741743743076178553477128485564340155224751265203157413138868786397507566597668983359226565630601915430620076699524431310095455455542524484135136824320295663989521930511900734294300291446996525592566004873831762952208913396110384164194675210996047400818580613669299963851206602307073159281923254682620228106967230642649685691122950912916834909864969417965826221671506929579934642387781488238285957428281861332080930029992458352374010121152692928478675613622112164135034683689936627701340892516005696109969753603906839346026619407408889988313209021299749894557357145557731563833361347769001521151680713344325936288076883881308056040807569838830385198501101943519194497568564221392184844203772016256255949061168980215213691093076061178042509443836431461069891100340062732295299229014997253824192376917307766018557292694297906364878731694470027817514632898867906569056009337971613254127297577513353445644942122238994174636848653271561072100563407074407565435018400021268812818499439542502647060761170648813819604148599373201815509367542343406194790294462078011336743641173325813611895241915181659607722460959743060517214081558047793100082637964083379966147038106807096804083581018234104077119074486698329771372267023325247560379292588930592659782064884890314333653372639032942822999016551115308598825536912614264571520983357886610683611753760003585573610542136993268320572017937493504694038673628998102047922811578032176621913910448192314946381562799587666717802915153828071045449611216524000359907346665477965135650301485599588065972057989741345135492377363605928222591982098057768352885670379610476222820128729164068915094364300742400980405821788392619899503516324527073511596740579410578764265455319703584812773448863997595548473347652160894828244701365048084821456784571670246669414094814291475289487463733379888533766571229831534908385819128571656719551932398941278430877011512751260611235593656957088516264524709371820292915871624438041760687511801234555276426168924892469041067404842839540690654668171583444797155051071385296240435285091418771459539561777558543307410959237857058050025920055624973115174861890309017765114311021845329356952346493267623073224350247773740157952182061176275928893152730802376462002972681552474147706278480703278422385943910845652496156032975309329203303568142097852185332228727212189110760017872472420834844175388847369401616254549381581045428401267156654461868552316587103013591528124184735868732619660836463132996968324459529190363059711799707739567381948043148019978839694839509375313339972553531657471258367011960399989483500765399546457152959980383247303067826865743766278050814994918619241412955483484745064732413465854766686139518281115317123413666109789032039929075051364267217522168684338952567396924461192815165381363083675885202537423708920953173093545302608386945168747463323562349197439262536893596987899552530404234277020166495069211967326323241476971084799483327126999502088789776957999781357241591145745201806327667844516335648994009990071173225845065629555919358682552278156179751817671541736177476145432522021192151040722199437720013459166576381510205042777198072439161896600272979865368349609951735875889775487412476685544055562631284809949280758989669842465976363404368433065621027574041746834244612297008670492366050479581351995218861227537899531722985887557100101393351179477299582776247670081654741043739406163267902752067365380673237499355492247202367577401030457209355520403352213378393366740372485437165844729340032054549023009599897281192906958462265459556425704377204274408643847835024027894356023626107985660380087574493598296835012457733802432243842807908117222857130916792366382711632828375348269451407721184122834113057966808145821595999230881367614189868728338785351583402996119355120057772851834700306000943159679166345488274416931874044382462724844038686155494932121324054533976609876766308384560086871149749503075650491297404095718471544195450677934612449267256904798177989036367226936231594241611486183750206986432804337505601387862204509790394191285585139602174182063846539241573959312989398164400863963924557316971962464279224665314055451286927656040638844252419057645702037758640954038791303132293779257148274823020503608944652295467657858728734410233123768741116154374756104370601378679898018395100661744797074616768443670764763358497158333076760389206196378780242884881359260788776279845285059858919592002331612325063086839835352579590661309823705972574400759914445126802110953177252985974610524264128930591084762617490608825266077035870317650922281976893691111279185892798541690947815620415591702089510540426224809731721824826918301200351779429575308278737704915290713683364639445844323037454876415198081450713968532762938176145336544306594101466858608964686625385138178120363042122196536936567826066679164494591701614199809452143458754978067109792471807288610205360843162698180388904504835180653222046966145790324550512905254952591071062785669510152839576421893000230263648452293122062150302688141877138102351474843648638796365115169452476457339532039542575355843796615818113107493628296359735103077404383254539960682490744966958702765467795136843854460834516816526350602407646586617358681608262501356029711635069917873141592951698578042457765528231973265882837869775870788652717140080862972527589961187006634133780230807803244772768070270783066816886260024165408282100824063324929894264334099215935418638529402784730123101630899206570888674594787039708681942200155003881680175580351971743877168644945039880204274390806926867465178337477759489398035466356783928319348651643123177478912721043804717844720501754377785099273851353821472169268396832561229091799585861773088418210314168449088555389273033470650669004660346612988227319502492658224295112928175831201151980208414403345516935254503079175556668140825966511251788219413466108363194066947820078316705708123190443541989459086868532369781776341798597232047159251761263508577198500625097713414284253431634460958583191119915246175916087435520277529610345178933095482656489294619224690917424820492247068148714347322650620763521113403760187455186963606767981183946018488274727485957685951353380163705165842791975159989182823402820672070737367827740916361895152808990496538429983273819697119723152789823228788249778649121369618487333832734367133606950271409926433581144688838042160629684998796134160405342267989608324749898157957607027815984305426702934821176177060644271158496416064600839665392707173384917439856144799068845205937080131412515248602749136353267091921180100109425870852138381585416460888862649653573399271622139014331821821885909584983646008054070832417840682636097104183495191193526268299324862905463644604518531628114870495616903398854934358399087216610269344520598862763484408795410443265492077869425426351402446262069572360691749775482044270322448280631136034533540469030208516584935112062173529643330309780491315795866049037503184998982052781691675064968186121093653242741762911444419809769926419304900454149437093392647870924408914411991841962677266401674574057452694452187200071792170375883898569284551552994334672040354628110542894379941512020624672703023834051132445237400687072253185445217706611251746206259253946966321000341488626726671571627870538508087949333835163477932181121793554113280615679663202615319141725643545610642023520765600326357658736611382306011085043920556248399321474002634102736254854421570520181946454034184712023341048885251159195185620268697491034411453454322001828115214513888194537105369233165819966538745572284976335479999773967631055953089608980052424212214981991220573367316228700655485867908670049989146469494193703174502965883593603264295400798352052398028977997935073952900677209717043802066415317995501358967359101133035467074423106078397739914579655345254333280148693970533895592495741340544211217835235631757354960648385530346480850666361201936071552103586100809893646198869758916039915227744856815678402213225442456240633906125896473267706728413938666113004723423401991448583558457124100640698517036394131097774620433378167835018758847482637251482202189612658828558617905933744703105266032145118083084076101016775578613635828969337372103751031220299942056705014011758528719574241628933959018438549068667417817132463905216074609865481399528662081225926118113407331248992 >> Something around? 4 + 1312157922258571340376196960089331324265374789879473059624665260158945 / 6990240383249667527969103919605229207361243904353281741648390492032924
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-20 17:39 -0700 |
| Message-ID | <s364jt$n16$1@dont-email.me> |
| In reply to | #514995 |
On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > On 3/20/2021 2:22 PM, djoyce099 wrote: >> The rational number below will produce a decrypted >> poem using number to letter plain text for a total of 129 letters. >> How is it done? >> What you see below has to be processed. >> A certain mathematical process to this number >> has to be initiated to solve this puzzle. >> The simple process will expose the simplicity >> of this cipher. > > Did you xor the plaintext with the decimal expansion of the rational? > >> >> The rational number below may not need to be >> as large a decimal expansion as it is but probably >> about 90% of it is necessary to complete the process >> of decrypting. >> You will need an online calculator or coding language that >> supports a level of 10,000 digit precision, that is what the >> decimal expansion of the number below has. >> >> 4.187712846814656608060732918259108770874449265728424018596029628858094844009685949860782027378038056761807604280273008996752199234546409671468770571930526274960145551358466684183719431378092648508021661601994903379878880042778032637233193496151434357216170853272412145048795658483433096110454242973389136013456073243647892721898267681525658769052795363987514092626856068608417394241541368126034205825614874919755289790774645331682765266722353822397782406215384331546350129798518449187036543244053893097980370119140144354890349541027971147890441032606005563013889342605140024268120674391339189077758108874551138891366583580369812620594057061310970506411769256065174324853423664348672485001270342524168456961407163945674172091660255779230268507929772244912821686039149597728778786776650739479486175529154050983638246389644011570693085404988027689447730276877378108108956350503246397123462302020440466460200582137355974185549004949273375829085468202464300446334477300902040227091595507124573952797530858179437842052140619594181351245847228680165097081665953689378069873327490134260691661394699534860339044640973371226650793778261002201136077263433558715339483222531899862403232085074038934911575309972063642266912244239950106487580618604355805139439582418327088643438446493398316608356324878239855373423929799927799493835397905533606094938627232686114580884895330767671506186381960248258261199388486246557309931134296744566225147789889854940626295768640232628724013184172600457079570523302080797975092334962901118345415511595982705605581216687998240580891701696576506270366394426860638758971634034111568690290564387782842866209925060839377293130940104720369140855156121125168038167482125186587881708135623072872336443182956728284858147745183404718349515192936482964688807592369626324482995923343951741743743076178553477128485564340155224751265203157413138868786397507566597668983359226565630601915430620076699524431310095455455542524484135136824320295663989521930511900734294300291446996525592566004873831762952208913396110384164194675210996047400818580613669299963851206602307073159281923254682620228106967230642649685691122950912916834909864969417965826221671506929579934642387781488238285957428281861332080930029992458352374010121152692928478675613622112164135034683689936627701340892516005696109969753603906839346026619407408889988313209021299749894557357145557731563833361347769001521151680713344325936288076883881308056040807569838830385198501101943519194497568564221392184844203772016256255949061168980215213691093076061178042509443836431461069891100340062732295299229014997253824192376917307766018557292694297906364878731694470027817514632898867906569056009337971613254127297577513353445644942122238994174636848653271561072100563407074407565435018400021268812818499439542502647060761170648813819604148599373201815509367542343406194790294462078011336743641173325813611895241915181659607722460959743060517214081558047793100082637964083379966147038106807096804083581018234104077119074486698329771372267023325247560379292588930592659782064884890314333653372639032942822999016551115308598825536912614264571520983357886610683611753760003585573610542136993268320572017937493504694038673628998102047922811578032176621913910448192314946381562799587666717802915153828071045449611216524000359907346665477965135650301485599588065972057989741345135492377363605928222591982098057768352885670379610476222820128729164068915094364300742400980405821788392619899503516324527073511596740579410578764265455319703584812773448863997595548473347652160894828244701365048084821456784571670246669414094814291475289487463733379888533766571229831534908385819128571656719551932398941278430877011512751260611235593656957088516264524709371820292915871624438041760687511801234555276426168924892469041067404842839540690654668171583444797155051071385296240435285091418771459539561777558543307410959237857058050025920055624973115174861890309017765114311021845329356952346493267623073224350247773740157952182061176275928893152730802376462002972681552474147706278480703278422385943910845652496156032975309329203303568142097852185332228727212189110760017872472420834844175388847369401616254549381581045428401267156654461868552316587103013591528124184735868732619660836463132996968324459529190363059711799707739567381948043148019978839694839509375313339972553531657471258367011960399989483500765399546457152959980383247303067826865743766278050814994918619241412955483484745064732413465854766686139518281115317123413666109789032039929075051364267217522168684338952567396924461192815165381363083675885202537423708920953173093545302608386945168747463323562349197439262536893596987899552530404234277020166495069211967326323241476971084799483327126999502088789776957999781357241591145745201806327667844516335648994009990071173225845065629555919358682552278156179751817671541736177476145432522021192151040722199437720013459166576381510205042777198072439161896600272979865368349609951735875889775487412476685544055562631284809949280758989669842465976363404368433065621027574041746834244612297008670492366050479581351995218861227537899531722985887557100101393351179477299582776247670081654741043739406163267902752067365380673237499355492247202367577401030457209355520403352213378393366740372485437165844729340032054549023009599897281192906958462265459556425704377204274408643847835024027894356023626107985660380087574493598296835012457733802432243842807908117222857130916792366382711632828375348269451407721184122834113057966808145821595999230881367614189868728338785351583402996119355120057772851834700306000943159679166345488274416931874044382462724844038686155494932121324054533976609876766308384560086871149749503075650491297404095718471544195450677934612449267256904798177989036367226936231594241611486183750206986432804337505601387862204509790394191285585139602174182063846539241573959312989398164400863963924557316971962464279224665314055451286927656040638844252419057645702037758640954038791303132293779257148274823020503608944652295467657858728734410233123768741116154374756104370601378679898018395100661744797074616768443670764763358497158333076760389206196378780242884881359260788776279845285059858919592002331612325063086839835352579590661309823705972574400759914445126802110953177252985974610524264128930591084762617490608825266077035870317650922281976893691111279185892798541690947815620415591702089510540426224809731721824826918301200351779429575308278737704915290713683364639445844323037454876415198081450713968532762938176145336544306594101466858608964686625385138178120363042122196536936567826066679164494591701614199809452143458754978067109792471807288610205360843162698180388904504835180653222046966145790324550512905254952591071062785669510152839576421893000230263648452293122062150302688141877138102351474843648638796365115169452476457339532039542575355843796615818113107493628296359735103077404383254539960682490744966958702765467795136843854460834516816526350602407646586617358681608262501356029711635069917873141592951698578042457765528231973265882837869775870788652717140080862972527589961187006634133780230807803244772768070270783066816886260024165408282100824063324929894264334099215935418638529402784730123101630899206570888674594787039708681942200155003881680175580351971743877168644945039880204274390806926867465178337477759489398035466356783928319348651643123177478912721043804717844720501754377785099273851353821472169268396832561229091799585861773088418210314168449088555389273033470650669004660346612988227319502492658224295112928175831201151980208414403345516935254503079175556668140825966511251788219413466108363194066947820078316705708123190443541989459086868532369781776341798597232047159251761263508577198500625097713414284253431634460958583191119915246175916087435520277529610345178933095482656489294619224690917424820492247068148714347322650620763521113403760187455186963606767981183946018488274727485957685951353380163705165842791975159989182823402820672070737367827740916361895152808990496538429983273819697119723152789823228788249778649121369618487333832734367133606950271409926433581144688838042160629684998796134160405342267989608324749898157957607027815984305426702934821176177060644271158496416064600839665392707173384917439856144799068845205937080131412515248602749136353267091921180100109425870852138381585416460888862649653573399271622139014331821821885909584983646008054070832417840682636097104183495191193526268299324862905463644604518531628114870495616903398854934358399087216610269344520598862763484408795410443265492077869425426351402446262069572360691749775482044270322448280631136034533540469030208516584935112062173529643330309780491315795866049037503184998982052781691675064968186121093653242741762911444419809769926419304900454149437093392647870924408914411991841962677266401674574057452694452187200071792170375883898569284551552994334672040354628110542894379941512020624672703023834051132445237400687072253185445217706611251746206259253946966321000341488626726671571627870538508087949333835163477932181121793554113280615679663202615319141725643545610642023520765600326357658736611382306011085043920556248399321474002634102736254854421570520181946454034184712023341048885251159195185620268697491034411453454322001828115214513888194537105369233165819966538745572284976335479999773967631055953089608980052424212214981991220573367316228700655485867908670049989146469494193703174502965883593603264295400798352052398028977997935073952900677209717043802066415317995501358967359101133035467074423106078397739914579655345254333280148693970533895592495741340544211217835235631757354960648385530346480850666361201936071552103586100809893646198869758916039915227744856815678402213225442456240633906125896473267706728413938666113004723423401991448583558457124100640698517036394131097774620433378167835018758847482637251482202189612658828558617905933744703105266032145118083084076101016775578613635828969337372103751031220299942056705014011758528719574241628933959018438549068667417817132463905216074609865481399528662081225926118113407331248992 >> >> >> Who will be the first to decrypt this poem? >> Good luck! > I think I got it, but I need more precision! So far, I am getting: decryptingthisnumberandyo I must have it! Just need to continue further to complete the message! ;^)
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-20 18:49 -0700 |
| Message-ID | <19317fb2-1f3d-4e63-a426-2d92f33a86ecn@googlegroups.com> |
| In reply to | #515029 |
On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > On 3/20/2021 2:22 PM, djoyce099 wrote: > >> The rational number below will produce a decrypted > >> poem using number to letter plain text for a total of 129 letters. > >> How is it done? > >> What you see below has to be processed. > >> A certain mathematical process to this number > >> has to be initiated to solve this puzzle. > >> The simple process will expose the simplicity > >> of this cipher. > > > > Did you xor the plaintext with the decimal expansion of the rational? > > > >> > >> The rational number below may not need to be > >> as large a decimal expansion as it is but probably > >> about 90% of it is necessary to complete the process > >> of decrypting. > >> You will need an online calculator or coding language that > >> supports a level of 10,000 digit precision, that is what the > >> decimal expansion of the number below has. > >> > >> 4.187712846814656608060732918259108770874449265728424018596029628858094844009685949860782027378038056761807604280273008996752199234546409671468770571930526274960145551358466684183719431378092648508021661601994903379878880042778032637233193496151434357216170853272412145048795658483433096110454242973389136013456073243647892721898267681525658769052795363987514092626856068608417394241541368126034205825614874919755289790774645331682765266722353822397782406215384331546350129798518449187036543244053893097980370119140144354890349541027971147890441032606005563013889342605140024268120674391339189077758108874551138891366583580369812620594057061310970506411769256065174324853423664348672485001270342524168456961407163945674172091660255779230268507929772244912821686039149597728778786776650739479486175529154050983638246389644011570693085404988027689447730276877378108108956350503246397123462302020440466460200582137355974185549004949273375829085468202464300446334477300902040227091595507124573952797530858179437842052140619594181351245847228680165097081665953689378069873327490134260691661394699534860339044640973371226650793778261002201136077263433558715339483222531899862403232085074038934911575309972063642266912244239950106487580618604355805139439582418327088643438446493398316608356324878239855373423929799927799493835397905533606094938627232686114580884895330767671506186381960248258261199388486246557309931134296744566225147789889854940626295768640232628724013184172600457079570523302080797975092334962901118345415511595982705605581216687998240580891701696576506270366394426860638758971634034111568690290564387782842866209925060839377293130940104720369140855156121125168038167482125186587881708135623072872336443182956728284858147745183404718349515192936482964688807592369626324482995923343951741743743076178553477128485564340155224751265203157413138868786397507566597668983359226565630601915430620076699524431310095455455542524484135136824320295663989521930511900734294300291446996525592566004873831762952208913396110384164194675210996047400818580613669299963851206602307073159281923254682620228106967230642649685691122950912916834909864969417965826221671506929579934642387781488238285957428281861332080930029992458352374010121152692928478675613622112164135034683689936627701340892516005696109969753603906839346026619407408889988313209021299749894557357145557731563833361347769001521151680713344325936288076883881308056040807569838830385198501101943519194497568564221392184844203772016256255949061168980215213691093076061178042509443836431461069891100340062732295299229014997253824192376917307766018557292694297906364878731694470027817514632898867906569056009337971613254127297577513353445644942122238994174636848653271561072100563407074407565435018400021268812818499439542502647060761170648813819604148599373201815509367542343406194790294462078011336743641173325813611895241915181659607722460959743060517214081558047793100082637964083379966147038106807096804083581018234104077119074486698329771372267023325247560379292588930592659782064884890314333653372639032942822999016551115308598825536912614264571520983357886610683611753760003585573610542136993268320572017937493504694038673628998102047922811578032176621913910448192314946381562799587666717802915153828071045449611216524000359907346665477965135650301485599588065972057989741345135492377363605928222591982098057768352885670379610476222820128729164068915094364300742400980405821788392619899503516324527073511596740579410578764265455319703584812773448863997595548473347652160894828244701365048084821456784571670246669414094814291475289487463733379888533766571229831534908385819128571656719551932398941278430877011512751260611235593656957088516264524709371820292915871624438041760687511801234555276426168924892469041067404842839540690654668171583444797155051071385296240435285091418771459539561777558543307410959237857058050025920055624973115174861890309017765114311021845329356952346493267623073224350247773740157952182061176275928893152730802376462002972681552474147706278480703278422385943910845652496156032975309329203303568142097852185332228727212189110760017872472420834844175388847369401616254549381581045428401267156654461868552316587103013591528124184735868732619660836463132996968324459529190363059711799707739567381948043148019978839694839509375313339972553531657471258367011960399989483500765399546457152959980383247303067826865743766278050814994918619241412955483484745064732413465854766686139518281115317123413666109789032039929075051364267217522168684338952567396924461192815165381363083675885202537423708920953173093545302608386945168747463323562349197439262536893596987899552530404234277020166495069211967326323241476971084799483327126999502088789776957999781357241591145745201806327667844516335648994009990071173225845065629555919358682552278156179751817671541736177476145432522021192151040722199437720013459166576381510205042777198072439161896600272979865368349609951735875889775487412476685544055562631284809949280758989669842465976363404368433065621027574041746834244612297008670492366050479581351995218861227537899531722985887557100101393351179477299582776247670081654741043739406163267902752067365380673237499355492247202367577401030457209355520403352213378393366740372485437165844729340032054549023009599897281192906958462265459556425704377204274408643847835024027894356023626107985660380087574493598296835012457733802432243842807908117222857130916792366382711632828375348269451407721184122834113057966808145821595999230881367614189868728338785351583402996119355120057772851834700306000943159679166345488274416931874044382462724844038686155494932121324054533976609876766308384560086871149749503075650491297404095718471544195450677934612449267256904798177989036367226936231594241611486183750206986432804337505601387862204509790394191285585139602174182063846539241573959312989398164400863963924557316971962464279224665314055451286927656040638844252419057645702037758640954038791303132293779257148274823020503608944652295467657858728734410233123768741116154374756104370601378679898018395100661744797074616768443670764763358497158333076760389206196378780242884881359260788776279845285059858919592002331612325063086839835352579590661309823705972574400759914445126802110953177252985974610524264128930591084762617490608825266077035870317650922281976893691111279185892798541690947815620415591702089510540426224809731721824826918301200351779429575308278737704915290713683364639445844323037454876415198081450713968532762938176145336544306594101466858608964686625385138178120363042122196536936567826066679164494591701614199809452143458754978067109792471807288610205360843162698180388904504835180653222046966145790324550512905254952591071062785669510152839576421893000230263648452293122062150302688141877138102351474843648638796365115169452476457339532039542575355843796615818113107493628296359735103077404383254539960682490744966958702765467795136843854460834516816526350602407646586617358681608262501356029711635069917873141592951698578042457765528231973265882837869775870788652717140080862972527589961187006634133780230807803244772768070270783066816886260024165408282100824063324929894264334099215935418638529402784730123101630899206570888674594787039708681942200155003881680175580351971743877168644945039880204274390806926867465178337477759489398035466356783928319348651643123177478912721043804717844720501754377785099273851353821472169268396832561229091799585861773088418210314168449088555389273033470650669004660346612988227319502492658224295112928175831201151980208414403345516935254503079175556668140825966511251788219413466108363194066947820078316705708123190443541989459086868532369781776341798597232047159251761263508577198500625097713414284253431634460958583191119915246175916087435520277529610345178933095482656489294619224690917424820492247068148714347322650620763521113403760187455186963606767981183946018488274727485957685951353380163705165842791975159989182823402820672070737367827740916361895152808990496538429983273819697119723152789823228788249778649121369618487333832734367133606950271409926433581144688838042160629684998796134160405342267989608324749898157957607027815984305426702934821176177060644271158496416064600839665392707173384917439856144799068845205937080131412515248602749136353267091921180100109425870852138381585416460888862649653573399271622139014331821821885909584983646008054070832417840682636097104183495191193526268299324862905463644604518531628114870495616903398854934358399087216610269344520598862763484408795410443265492077869425426351402446262069572360691749775482044270322448280631136034533540469030208516584935112062173529643330309780491315795866049037503184998982052781691675064968186121093653242741762911444419809769926419304900454149437093392647870924408914411991841962677266401674574057452694452187200071792170375883898569284551552994334672040354628110542894379941512020624672703023834051132445237400687072253185445217706611251746206259253946966321000341488626726671571627870538508087949333835163477932181121793554113280615679663202615319141725643545610642023520765600326357658736611382306011085043920556248399321474002634102736254854421570520181946454034184712023341048885251159195185620268697491034411453454322001828115214513888194537105369233165819966538745572284976335479999773967631055953089608980052424212214981991220573367316228700655485867908670049989146469494193703174502965883593603264295400798352052398028977997935073952900677209717043802066415317995501358967359101133035467074423106078397739914579655345254333280148693970533895592495741340544211217835235631757354960648385530346480850666361201936071552103586100809893646198869758916039915227744856815678402213225442456240633906125896473267706728413938666113004723423401991448583558457124100640698517036394131097774620433378167835018758847482637251482202189612658828558617905933744703105266032145118083084076101016775578613635828969337372103751031220299942056705014011758528719574241628933959018438549068667417817132463905216074609865481399528662081225926118113407331248992 > >> > >> > >> Who will be the first to decrypt this poem? > >> Good luck! > > > > I think I got it, but I need more precision! > > So far, I am getting: > > decryptingthisnumberandyo > > I must have it! Just need to continue further to complete the message! ;^) you got it! I just thought it was a novel idea using CF but in actual practice use a more safisticated and difficult number letter replacement then what I used, This was the simplest form by building the rational from actual letter count for the CF.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-20 19:07 -0700 |
| Message-ID | <60b1b5e8-8ad9-44a1-9f37-18c6deb6d386n@googlegroups.com> |
| In reply to | #515035 |
On Saturday, March 20, 2021 at 9:49:27 PM UTC-4, djoyce099 wrote: > On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > > On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > > On 3/20/2021 2:22 PM, djoyce099 wrote: > > >> The rational number below will produce a decrypted > > >> poem using number to letter plain text for a total of 129 letters. > > >> How is it done? > > >> What you see below has to be processed. > > >> A certain mathematical process to this number > > >> has to be initiated to solve this puzzle. > > >> The simple process will expose the simplicity > > >> of this cipher. > > > > > > Did you xor the plaintext with the decimal expansion of the rational? > > > > > >> > > >> The rational number below may not need to be > > >> as large a decimal expansion as it is but probably > > >> about 90% of it is necessary to complete the process > > >> of decrypting. > > >> You will need an online calculator or coding language that > > >> supports a level of 10,000 digit precision, that is what the > > >> decimal expansion of the number below has. > > >> > > >> 4.187712846814656608060732918259108770874449265728424018596029628858094844009685949860782027378038056761807604280273008996752199234546409671468770571930526274960145551358466684183719431378092648508021661601994903379878880042778032637233193496151434357216170853272412145048795658483433096110454242973389136013456073243647892721898267681525658769052795363987514092626856068608417394241541368126034205825614874919755289790774645331682765266722353822397782406215384331546350129798518449187036543244053893097980370119140144354890349541027971147890441032606005563013889342605140024268120674391339189077758108874551138891366583580369812620594057061310970506411769256065174324853423664348672485001270342524168456961407163945674172091660255779230268507929772244912821686039149597728778786776650739479486175529154050983638246389644011570693085404988027689447730276877378108108956350503246397123462302020440466460200582137355974185549004949273375829085468202464300446334477300902040227091595507124573952797530858179437842052140619594181351245847228680165097081665953689378069873327490134260691661394699534860339044640973371226650793778261002201136077263433558715339483222531899862403232085074038934911575309972063642266912244239950106487580618604355805139439582418327088643438446493398316608356324878239855373423929799927799493835397905533606094938627232686114580884895330767671506186381960248258261199388486246557309931134296744566225147789889854940626295768640232628724013184172600457079570523302080797975092334962901118345415511595982705605581216687998240580891701696576506270366394426860638758971634034111568690290564387782842866209925060839377293130940104720369140855156121125168038167482125186587881708135623072872336443182956728284858147745183404718349515192936482964688807592369626324482995923343951741743743076178553477128485564340155224751265203157413138868786397507566597668983359226565630601915430620076699524431310095455455542524484135136824320295663989521930511900734294300291446996525592566004873831762952208913396110384164194675210996047400818580613669299963851206602307073159281923254682620228106967230642649685691122950912916834909864969417965826221671506929579934642387781488238285957428281861332080930029992458352374010121152692928478675613622112164135034683689936627701340892516005696109969753603906839346026619407408889988313209021299749894557357145557731563833361347769001521151680713344325936288076883881308056040807569838830385198501101943519194497568564221392184844203772016256255949061168980215213691093076061178042509443836431461069891100340062732295299229014997253824192376917307766018557292694297906364878731694470027817514632898867906569056009337971613254127297577513353445644942122238994174636848653271561072100563407074407565435018400021268812818499439542502647060761170648813819604148599373201815509367542343406194790294462078011336743641173325813611895241915181659607722460959743060517214081558047793100082637964083379966147038106807096804083581018234104077119074486698329771372267023325247560379292588930592659782064884890314333653372639032942822999016551115308598825536912614264571520983357886610683611753760003585573610542136993268320572017937493504694038673628998102047922811578032176621913910448192314946381562799587666717802915153828071045449611216524000359907346665477965135650301485599588065972057989741345135492377363605928222591982098057768352885670379610476222820128729164068915094364300742400980405821788392619899503516324527073511596740579410578764265455319703584812773448863997595548473347652160894828244701365048084821456784571670246669414094814291475289487463733379888533766571229831534908385819128571656719551932398941278430877011512751260611235593656957088516264524709371820292915871624438041760687511801234555276426168924892469041067404842839540690654668171583444797155051071385296240435285091418771459539561777558543307410959237857058050025920055624973115174861890309017765114311021845329356952346493267623073224350247773740157952182061176275928893152730802376462002972681552474147706278480703278422385943910845652496156032975309329203303568142097852185332228727212189110760017872472420834844175388847369401616254549381581045428401267156654461868552316587103013591528124184735868732619660836463132996968324459529190363059711799707739567381948043148019978839694839509375313339972553531657471258367011960399989483500765399546457152959980383247303067826865743766278050814994918619241412955483484745064732413465854766686139518281115317123413666109789032039929075051364267217522168684338952567396924461192815165381363083675885202537423708920953173093545302608386945168747463323562349197439262536893596987899552530404234277020166495069211967326323241476971084799483327126999502088789776957999781357241591145745201806327667844516335648994009990071173225845065629555919358682552278156179751817671541736177476145432522021192151040722199437720013459166576381510205042777198072439161896600272979865368349609951735875889775487412476685544055562631284809949280758989669842465976363404368433065621027574041746834244612297008670492366050479581351995218861227537899531722985887557100101393351179477299582776247670081654741043739406163267902752067365380673237499355492247202367577401030457209355520403352213378393366740372485437165844729340032054549023009599897281192906958462265459556425704377204274408643847835024027894356023626107985660380087574493598296835012457733802432243842807908117222857130916792366382711632828375348269451407721184122834113057966808145821595999230881367614189868728338785351583402996119355120057772851834700306000943159679166345488274416931874044382462724844038686155494932121324054533976609876766308384560086871149749503075650491297404095718471544195450677934612449267256904798177989036367226936231594241611486183750206986432804337505601387862204509790394191285585139602174182063846539241573959312989398164400863963924557316971962464279224665314055451286927656040638844252419057645702037758640954038791303132293779257148274823020503608944652295467657858728734410233123768741116154374756104370601378679898018395100661744797074616768443670764763358497158333076760389206196378780242884881359260788776279845285059858919592002331612325063086839835352579590661309823705972574400759914445126802110953177252985974610524264128930591084762617490608825266077035870317650922281976893691111279185892798541690947815620415591702089510540426224809731721824826918301200351779429575308278737704915290713683364639445844323037454876415198081450713968532762938176145336544306594101466858608964686625385138178120363042122196536936567826066679164494591701614199809452143458754978067109792471807288610205360843162698180388904504835180653222046966145790324550512905254952591071062785669510152839576421893000230263648452293122062150302688141877138102351474843648638796365115169452476457339532039542575355843796615818113107493628296359735103077404383254539960682490744966958702765467795136843854460834516816526350602407646586617358681608262501356029711635069917873141592951698578042457765528231973265882837869775870788652717140080862972527589961187006634133780230807803244772768070270783066816886260024165408282100824063324929894264334099215935418638529402784730123101630899206570888674594787039708681942200155003881680175580351971743877168644945039880204274390806926867465178337477759489398035466356783928319348651643123177478912721043804717844720501754377785099273851353821472169268396832561229091799585861773088418210314168449088555389273033470650669004660346612988227319502492658224295112928175831201151980208414403345516935254503079175556668140825966511251788219413466108363194066947820078316705708123190443541989459086868532369781776341798597232047159251761263508577198500625097713414284253431634460958583191119915246175916087435520277529610345178933095482656489294619224690917424820492247068148714347322650620763521113403760187455186963606767981183946018488274727485957685951353380163705165842791975159989182823402820672070737367827740916361895152808990496538429983273819697119723152789823228788249778649121369618487333832734367133606950271409926433581144688838042160629684998796134160405342267989608324749898157957607027815984305426702934821176177060644271158496416064600839665392707173384917439856144799068845205937080131412515248602749136353267091921180100109425870852138381585416460888862649653573399271622139014331821821885909584983646008054070832417840682636097104183495191193526268299324862905463644604518531628114870495616903398854934358399087216610269344520598862763484408795410443265492077869425426351402446262069572360691749775482044270322448280631136034533540469030208516584935112062173529643330309780491315795866049037503184998982052781691675064968186121093653242741762911444419809769926419304900454149437093392647870924408914411991841962677266401674574057452694452187200071792170375883898569284551552994334672040354628110542894379941512020624672703023834051132445237400687072253185445217706611251746206259253946966321000341488626726671571627870538508087949333835163477932181121793554113280615679663202615319141725643545610642023520765600326357658736611382306011085043920556248399321474002634102736254854421570520181946454034184712023341048885251159195185620268697491034411453454322001828115214513888194537105369233165819966538745572284976335479999773967631055953089608980052424212214981991220573367316228700655485867908670049989146469494193703174502965883593603264295400798352052398028977997935073952900677209717043802066415317995501358967359101133035467074423106078397739914579655345254333280148693970533895592495741340544211217835235631757354960648385530346480850666361201936071552103586100809893646198869758916039915227744856815678402213225442456240633906125896473267706728413938666113004723423401991448583558457124100640698517036394131097774620433378167835018758847482637251482202189612658828558617905933744703105266032145118083084076101016775578613635828969337372103751031220299942056705014011758528719574241628933959018438549068667417817132463905216074609865481399528662081225926118113407331248992 > > >> > > >> > > >> Who will be the first to decrypt this poem? > > >> Good luck! > > > > > > > I think I got it, but I need more precision! > > > > So far, I am getting: > > > > decryptingthisnumberandyo > > > > I must have it! Just need to continue further to complete the message! ;^) > you got it! > I just thought it was a novel idea using CF but in actual practice use a more safisticated and > difficult number letter replacement then what I used, This was the simplest form by building > the rational from actual letter count for the CF. This has to start the rational from the letter count at the end of the message and ending at the beginning of the message in executing the CF. Last letter count =n. (1/(1/ ((1/n) +n1) )+n2) .. and so on. You could start from the beginning but then the message would start showing the last (letter(word(sentence (to the first word))) from right to left. Instead of displaying the message from left to right starting at the end of your letter count..
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-20 23:08 -0700 |
| Message-ID | <s36nt9$ou1$1@dont-email.me> |
| In reply to | #515035 |
On 3/20/2021 6:49 PM, djoyce099 wrote: > On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>> The rational number below will produce a decrypted >>>> poem using number to letter plain text for a total of 129 letters. >>>> How is it done? >>>> What you see below has to be processed. >>>> A certain mathematical process to this number >>>> has to be initiated to solve this puzzle. >>>> The simple process will expose the simplicity >>>> of this cipher. >>> >>> Did you xor the plaintext with the decimal expansion of the rational? >>> >>>> >>>> The rational number below may not need to be >>>> as large a decimal expansion as it is but probably >>>> about 90% of it is necessary to complete the process >>>> of decrypting. >>>> You will need an online calculator or coding language that >>>> supports a level of 10,000 digit precision, that is what the >>>> decimal expansion of the number below has. >>>> >>>> [...] >>>> >>>> >>>> Who will be the first to decrypt this poem? >>>> Good luck! >> >>> >> I think I got it, but I need more precision! >> >> So far, I am getting: >> >> decryptingthisnumberandyo >> >> I must have it! Just need to continue further to complete the message! ;^) > you got it! > I just thought it was a novel idea using CF but in actual practice use a more safisticated and > difficult number letter replacement then what I used, This was the simplest form by building > the rational from actual letter count for the CF. > Just a radically simple idea. Since you are already using arbitrary precision numbers, wondering if simply multiplying the ciphertext by another number would help "hide" things. This other number would be in the secret key. So, something like, starting small for proof of concept: plaintext: decrypting Alice does: 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 and sends 5.4183857957464205976790755066 to Bob. Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = 4.18771284681465660806, then gets the convergents. With high enough precision everything should stay intact?
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-21 08:00 -0700 |
| Message-ID | <368b50d1-e5e3-4ec7-a15a-a1307173c23en@googlegroups.com> |
| In reply to | #515052 |
On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > On 3/20/2021 6:49 PM, djoyce099 wrote: > > On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > >> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > >>> On 3/20/2021 2:22 PM, djoyce099 wrote: > >>>> The rational number below will produce a decrypted > >>>> poem using number to letter plain text for a total of 129 letters. > >>>> How is it done? > >>>> What you see below has to be processed. > >>>> A certain mathematical process to this number > >>>> has to be initiated to solve this puzzle. > >>>> The simple process will expose the simplicity > >>>> of this cipher. > >>> > >>> Did you xor the plaintext with the decimal expansion of the rational? > >>> > >>>> > >>>> The rational number below may not need to be > >>>> as large a decimal expansion as it is but probably > >>>> about 90% of it is necessary to complete the process > >>>> of decrypting. > >>>> You will need an online calculator or coding language that > >>>> supports a level of 10,000 digit precision, that is what the > >>>> decimal expansion of the number below has. > >>>> > >>>> [...] > >>>> > >>>> > >>>> Who will be the first to decrypt this poem? > >>>> Good luck! > >> > >>> > >> I think I got it, but I need more precision! > >> > >> So far, I am getting: > >> > >> decryptingthisnumberandyo > >> > >> I must have it! Just need to continue further to complete the message! ;^) > > you got it! > > I just thought it was a novel idea using CF but in actual practice use a more safisticated and > > difficult number letter replacement then what I used, This was the simplest form by building > > the rational from actual letter count for the CF. > > > Just a radically simple idea. Since you are already using arbitrary > precision numbers, wondering if simply multiplying the ciphertext by > another number would help "hide" things. This other number would be in > the secret key. So, something like, starting small for proof of concept: > > plaintext: decrypting > > Alice does: > > 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > > and sends 5.4183857957464205976790755066 to Bob. > > Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > 4.18771284681465660806, then gets the convergents. > > With high enough precision everything should stay intact? Yes, that process would be good to add to the already constructed CF but it also could start with more security in the cross-referencing with the letters with numbers which I didn't do just to keep it simple to just present the idea. This would deal with an extra private key along with the private key that you presented. This way the exposed rational for public viewing would not be easily decrypted through the CF method or any other possible method someone might try to employ to break the code. The latter would be impossible (other possible methods).
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-21 09:08 -0700 |
| Message-ID | <54dead3b-3eaf-49eb-a8fb-bbb285fb5a46n@googlegroups.com> |
| In reply to | #515099 |
On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > > On 3/20/2021 6:49 PM, djoyce099 wrote: > > > On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > > >> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > >>> On 3/20/2021 2:22 PM, djoyce099 wrote: > > >>>> The rational number below will produce a decrypted > > >>>> poem using number to letter plain text for a total of 129 letters. > > >>>> How is it done? > > >>>> What you see below has to be processed. > > >>>> A certain mathematical process to this number > > >>>> has to be initiated to solve this puzzle. > > >>>> The simple process will expose the simplicity > > >>>> of this cipher. > > >>> > > >>> Did you xor the plaintext with the decimal expansion of the rational? > > >>> > > >>>> > > >>>> The rational number below may not need to be > > >>>> as large a decimal expansion as it is but probably > > >>>> about 90% of it is necessary to complete the process > > >>>> of decrypting. > > >>>> You will need an online calculator or coding language that > > >>>> supports a level of 10,000 digit precision, that is what the > > >>>> decimal expansion of the number below has. > > >>>> > > >>>> [...] > > >>>> > > >>>> > > >>>> Who will be the first to decrypt this poem? > > >>>> Good luck! > > >> > > >>> > > >> I think I got it, but I need more precision! > > >> > > >> So far, I am getting: > > >> > > >> decryptingthisnumberandyo > > >> > > >> I must have it! Just need to continue further to complete the message! ;^) > > > you got it! > > > I just thought it was a novel idea using CF but in actual practice use a more safisticated and > > > difficult number letter replacement then what I used, This was the simplest form by building > > > the rational from actual letter count for the CF. > > > > > Just a radically simple idea. Since you are already using arbitrary > > precision numbers, wondering if simply multiplying the ciphertext by > > another number would help "hide" things. This other number would be in > > the secret key. So, something like, starting small for proof of concept: > > > > plaintext: decrypting > > > > Alice does: > > > > 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > > > > and sends 5.4183857957464205976790755066 to Bob. > > > > Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > > 4.18771284681465660806, then gets the convergents. > > > > With high enough precision everything should stay intact? > Yes, that process would be good to add to the already constructed CF > but it also could start with more security in the cross-referencing with the > letters with numbers which I didn't do just to keep it simple to just present > the idea. This would deal with an extra private key along with the private > key that you presented. > This way the exposed rational for public viewing would not be easily > decrypted through the CF method or any other possible method someone > might try to employ to break the code. > The latter would be impossible (other possible methods). In the cross-referencing of numbers to letters more private keys could be used like below. After your private key is initiated by the receiver then all even numbers in the CF <19, are divided by 2 at the source. The receiver would multiply all even numbers in the CF<10 by 2 using an algorithm. Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all odd numbers > 34 in the CF using an algorithm. Or somesuch scheme to confuse a codebreaker using a CF method on a rational.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-23 22:14 -0700 |
| Message-ID | <s3ehs4$vbb$1@gioia.aioe.org> |
| In reply to | #515102 |
On 3/21/2021 9:08 AM, djoyce099 wrote: > On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: >> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: >>> On 3/20/2021 6:49 PM, djoyce099 wrote: >>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>>>>> The rational number below will produce a decrypted >>>>>>> poem using number to letter plain text for a total of 129 letters. >>>>>>> How is it done? >>>>>>> What you see below has to be processed. >>>>>>> A certain mathematical process to this number >>>>>>> has to be initiated to solve this puzzle. >>>>>>> The simple process will expose the simplicity >>>>>>> of this cipher. >>>>>> >>>>>> Did you xor the plaintext with the decimal expansion of the rational? >>>>>> >>>>>>> >>>>>>> The rational number below may not need to be >>>>>>> as large a decimal expansion as it is but probably >>>>>>> about 90% of it is necessary to complete the process >>>>>>> of decrypting. >>>>>>> You will need an online calculator or coding language that >>>>>>> supports a level of 10,000 digit precision, that is what the >>>>>>> decimal expansion of the number below has. >>>>>>> >>>>>>> [...] >>>>>>> >>>>>>> >>>>>>> Who will be the first to decrypt this poem? >>>>>>> Good luck! >>>>> >>>>>> >>>>> I think I got it, but I need more precision! >>>>> >>>>> So far, I am getting: >>>>> >>>>> decryptingthisnumberandyo >>>>> >>>>> I must have it! Just need to continue further to complete the message! ;^) >>>> you got it! >>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and >>>> difficult number letter replacement then what I used, This was the simplest form by building >>>> the rational from actual letter count for the CF. >>>> >>> Just a radically simple idea. Since you are already using arbitrary >>> precision numbers, wondering if simply multiplying the ciphertext by >>> another number would help "hide" things. This other number would be in >>> the secret key. So, something like, starting small for proof of concept: >>> >>> plaintext: decrypting >>> >>> Alice does: >>> >>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 >>> >>> and sends 5.4183857957464205976790755066 to Bob. >>> >>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = >>> 4.18771284681465660806, then gets the convergents. >>> >>> With high enough precision everything should stay intact? >> Yes, that process would be good to add to the already constructed CF >> but it also could start with more security in the cross-referencing with the >> letters with numbers which I didn't do just to keep it simple to just present >> the idea. This would deal with an extra private key along with the private >> key that you presented. >> This way the exposed rational for public viewing would not be easily >> decrypted through the CF method or any other possible method someone >> might try to employ to break the code. >> The latter would be impossible (other possible methods). > > In the cross-referencing of numbers to letters more private keys could be used > like below. > After your private key is initiated by the receiver then all even numbers in > the CF <19, are divided by 2 at the source. The receiver would multiply all even > numbers in the CF<10 by 2 using an algorithm. > Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > odd numbers > 34 in the CF using an algorithm. > Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > Interesting. Now this would be good to post in sci.crypt. They can be harsh, but kind in all of their solid help. They basically have told me that one of my ciphers is too hard for them to crack, and to get it into some contests. Here is a link: http://funwithfractals.atspace.cc/ct_cipher Here is some C code for it: https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ 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.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-24 12:43 -0700 |
| Message-ID | <8e630851-9387-4d1d-8a22-f02cc08ba0a6n@googlegroups.com> |
| In reply to | #515398 |
On Wednesday, March 24, 2021 at 1:14:53 AM UTC-4, Chris M. Thomasson wrote: > On 3/21/2021 9:08 AM, djoyce099 wrote: > > On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > >> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > >>> On 3/20/2021 6:49 PM, djoyce099 wrote: > >>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > >>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > >>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > >>>>>>> The rational number below will produce a decrypted > >>>>>>> poem using number to letter plain text for a total of 129 letters. > >>>>>>> How is it done? > >>>>>>> What you see below has to be processed. > >>>>>>> A certain mathematical process to this number > >>>>>>> has to be initiated to solve this puzzle. > >>>>>>> The simple process will expose the simplicity > >>>>>>> of this cipher. > >>>>>> > >>>>>> Did you xor the plaintext with the decimal expansion of the rational? > >>>>>> > >>>>>>> > >>>>>>> The rational number below may not need to be > >>>>>>> as large a decimal expansion as it is but probably > >>>>>>> about 90% of it is necessary to complete the process > >>>>>>> of decrypting. > >>>>>>> You will need an online calculator or coding language that > >>>>>>> supports a level of 10,000 digit precision, that is what the > >>>>>>> decimal expansion of the number below has. > >>>>>>> > >>>>>>> [...] > >>>>>>> > >>>>>>> > >>>>>>> Who will be the first to decrypt this poem? > >>>>>>> Good luck! > >>>>> > >>>>>> > >>>>> I think I got it, but I need more precision! > >>>>> > >>>>> So far, I am getting: > >>>>> > >>>>> decryptingthisnumberandyo > >>>>> > >>>>> I must have it! Just need to continue further to complete the message! ;^) > >>>> you got it! > >>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > >>>> difficult number letter replacement then what I used, This was the simplest form by building > >>>> the rational from actual letter count for the CF. > >>>> > >>> Just a radically simple idea. Since you are already using arbitrary > >>> precision numbers, wondering if simply multiplying the ciphertext by > >>> another number would help "hide" things. This other number would be in > >>> the secret key. So, something like, starting small for proof of concept: > >>> > >>> plaintext: decrypting > >>> > >>> Alice does: > >>> > >>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > >>> > >>> and sends 5.4183857957464205976790755066 to Bob. > >>> > >>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > >>> 4.18771284681465660806, then gets the convergents. > >>> > >>> With high enough precision everything should stay intact? > >> Yes, that process would be good to add to the already constructed CF > >> but it also could start with more security in the cross-referencing with the > >> letters with numbers which I didn't do just to keep it simple to just present > >> the idea. This would deal with an extra private key along with the private > >> key that you presented. > >> This way the exposed rational for public viewing would not be easily > >> decrypted through the CF method or any other possible method someone > >> might try to employ to break the code. > >> The latter would be impossible (other possible methods). > > > > In the cross-referencing of numbers to letters more private keys could be used > > like below. > > After your private key is initiated by the receiver then all even numbers in > > the CF <19, are divided by 2 at the source. The receiver would multiply all even > > numbers in the CF<10 by 2 using an algorithm. > > Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > > odd numbers > 34 in the CF using an algorithm. > > Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > > > Interesting. Now this would be good to post in sci.crypt. They can be > harsh, but kind in all of their solid help. They basically have told me > that one of my ciphers is too hard for them to crack, and to get it into > some contests. Here is a link: > > http://funwithfractals.atspace.cc/ct_cipher > > Here is some C code for it: > > https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > > > 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. I will give it a go. I am now working on something different as to what table of letters will produce the most 3 letters or more words in pi. Rules for this table -- You have to use all the of the alphabet plus a,e,I,o again which creates 3 rows and 10 columns. I am starting with this table --- The index of each column is below 0,1,2,3,4,5,6,7,8,9 -= pi +1 in the algorithm creates the index below to identify zeros in the decimal expansion. 1,2,3,4,5,6,7,8,9,10 = converts what is read to this in the algorithm. ----------------------------- A B C D E F G H I J T S R Q PO N M LK V U A E WX I Y Z O This puts one vowel in each column. Therefor column one encounters a (1) on the first count for that column an "A" is printed. It really is a (0) that is read. The second (0) is read (a (2)) count for that column = a "T" is printed. The third count for that column a "V" is read and then on the 4th count, the counter is set back to 1 and prints A-T-V in order again when the 4th,5th,6th zero is read, and so on. The same is true with all the rest of the columns that all have a different order of letters. Try any order you like for each column but with the same rules, I resented above. To check my table (algorithm) there is a 3 letter word starting with the beginning of the 13th decimal expansion of pi, (not counting 3) , counting 3 it is the 14th number of pi. It prints "HOE" Then a 3 letter word starting at the 31st (decimal expansion of pi), the word FAR appears. Then on the 40th, (decimal expansion of pi), the 4 letter word "HOST" appears. If your algorithm matches with my locations and words then it is correct. Keeping with the same table layout and the same amounts of letters (all 26 of the alphabet) and the 4 repeating vowels A,E,I,O . Change each column in any order any way you like to produce the most 3,4,5,6.. letter length words in pi for up to 10,000 digits. This can be tried with any irrational like e or a rational. I am still experimenting. Just a fun exercise with an encryption possibility with numbers other than pi.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-29 16:48 -0700 |
| Message-ID | <s3tp05$772$1@gioia.aioe.org> |
| In reply to | #515455 |
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: >> On 3/21/2021 9:08 AM, djoyce099 wrote: >>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: >>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: >>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: >>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>>>>>>> The rational number below will produce a decrypted >>>>>>>>> poem using number to letter plain text for a total of 129 letters. >>>>>>>>> How is it done? >>>>>>>>> What you see below has to be processed. >>>>>>>>> A certain mathematical process to this number >>>>>>>>> has to be initiated to solve this puzzle. >>>>>>>>> The simple process will expose the simplicity >>>>>>>>> of this cipher. >>>>>>>> >>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? >>>>>>>> >>>>>>>>> >>>>>>>>> The rational number below may not need to be >>>>>>>>> as large a decimal expansion as it is but probably >>>>>>>>> about 90% of it is necessary to complete the process >>>>>>>>> of decrypting. >>>>>>>>> You will need an online calculator or coding language that >>>>>>>>> supports a level of 10,000 digit precision, that is what the >>>>>>>>> decimal expansion of the number below has. >>>>>>>>> >>>>>>>>> [...] >>>>>>>>> >>>>>>>>> >>>>>>>>> Who will be the first to decrypt this poem? >>>>>>>>> Good luck! >>>>>>> >>>>>>>> >>>>>>> I think I got it, but I need more precision! >>>>>>> >>>>>>> So far, I am getting: >>>>>>> >>>>>>> decryptingthisnumberandyo >>>>>>> >>>>>>> I must have it! Just need to continue further to complete the message! ;^) >>>>>> you got it! >>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and >>>>>> difficult number letter replacement then what I used, This was the simplest form by building >>>>>> the rational from actual letter count for the CF. >>>>>> >>>>> Just a radically simple idea. Since you are already using arbitrary >>>>> precision numbers, wondering if simply multiplying the ciphertext by >>>>> another number would help "hide" things. This other number would be in >>>>> the secret key. So, something like, starting small for proof of concept: >>>>> >>>>> plaintext: decrypting >>>>> >>>>> Alice does: >>>>> >>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 >>>>> >>>>> and sends 5.4183857957464205976790755066 to Bob. >>>>> >>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = >>>>> 4.18771284681465660806, then gets the convergents. >>>>> >>>>> With high enough precision everything should stay intact? >>>> Yes, that process would be good to add to the already constructed CF >>>> but it also could start with more security in the cross-referencing with the >>>> letters with numbers which I didn't do just to keep it simple to just present >>>> the idea. This would deal with an extra private key along with the private >>>> key that you presented. >>>> This way the exposed rational for public viewing would not be easily >>>> decrypted through the CF method or any other possible method someone >>>> might try to employ to break the code. >>>> The latter would be impossible (other possible methods). >>> >>> In the cross-referencing of numbers to letters more private keys could be used >>> like below. >>> After your private key is initiated by the receiver then all even numbers in >>> the CF <19, are divided by 2 at the source. The receiver would multiply all even >>> numbers in the CF<10 by 2 using an algorithm. >>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all >>> odd numbers > 34 in the CF using an algorithm. >>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. >>> >> Interesting. Now this would be good to post in sci.crypt. They can be >> harsh, but kind in all of their solid help. They basically have told me >> that one of my ciphers is too hard for them to crack, and to get it into >> some contests. Here is a link: >> >> http://funwithfractals.atspace.cc/ct_cipher >> >> Here is some C code for it: >> >> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ >> >> >> 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. > > I will give it a go. [...] 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.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-30 11:36 -0700 |
| Message-ID | <fd385282-b8ff-40c7-9483-d07a939aa18an@googlegroups.com> |
| In reply to | #515971 |
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: > >> On 3/21/2021 9:08 AM, djoyce099 wrote: > >>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > >>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > >>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: > >>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > >>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > >>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > >>>>>>>>> The rational number below will produce a decrypted > >>>>>>>>> poem using number to letter plain text for a total of 129 letters. > >>>>>>>>> How is it done? > >>>>>>>>> What you see below has to be processed. > >>>>>>>>> A certain mathematical process to this number > >>>>>>>>> has to be initiated to solve this puzzle. > >>>>>>>>> The simple process will expose the simplicity > >>>>>>>>> of this cipher. > >>>>>>>> > >>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? > >>>>>>>> > >>>>>>>>> > >>>>>>>>> The rational number below may not need to be > >>>>>>>>> as large a decimal expansion as it is but probably > >>>>>>>>> about 90% of it is necessary to complete the process > >>>>>>>>> of decrypting. > >>>>>>>>> You will need an online calculator or coding language that > >>>>>>>>> supports a level of 10,000 digit precision, that is what the > >>>>>>>>> decimal expansion of the number below has. > >>>>>>>>> > >>>>>>>>> [...] > >>>>>>>>> > >>>>>>>>> > >>>>>>>>> Who will be the first to decrypt this poem? > >>>>>>>>> Good luck! > >>>>>>> > >>>>>>>> > >>>>>>> I think I got it, but I need more precision! > >>>>>>> > >>>>>>> So far, I am getting: > >>>>>>> > >>>>>>> decryptingthisnumberandyo > >>>>>>> > >>>>>>> I must have it! Just need to continue further to complete the message! ;^) > >>>>>> you got it! > >>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > >>>>>> difficult number letter replacement then what I used, This was the simplest form by building > >>>>>> the rational from actual letter count for the CF. > >>>>>> > >>>>> Just a radically simple idea. Since you are already using arbitrary > >>>>> precision numbers, wondering if simply multiplying the ciphertext by > >>>>> another number would help "hide" things. This other number would be in > >>>>> the secret key. So, something like, starting small for proof of concept: > >>>>> > >>>>> plaintext: decrypting > >>>>> > >>>>> Alice does: > >>>>> > >>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > >>>>> > >>>>> and sends 5.4183857957464205976790755066 to Bob. > >>>>> > >>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > >>>>> 4.18771284681465660806, then gets the convergents. > >>>>> > >>>>> With high enough precision everything should stay intact? > >>>> Yes, that process would be good to add to the already constructed CF > >>>> but it also could start with more security in the cross-referencing with the > >>>> letters with numbers which I didn't do just to keep it simple to just present > >>>> the idea. This would deal with an extra private key along with the private > >>>> key that you presented. > >>>> This way the exposed rational for public viewing would not be easily > >>>> decrypted through the CF method or any other possible method someone > >>>> might try to employ to break the code. > >>>> The latter would be impossible (other possible methods). > >>> > >>> In the cross-referencing of numbers to letters more private keys could be used > >>> like below. > >>> After your private key is initiated by the receiver then all even numbers in > >>> the CF <19, are divided by 2 at the source. The receiver would multiply all even > >>> numbers in the CF<10 by 2 using an algorithm. > >>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > >>> odd numbers > 34 in the CF using an algorithm. > >>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > >>> > >> Interesting. Now this would be good to post in sci.crypt. They can be > >> harsh, but kind in all of their solid help. They basically have told me > >> that one of my ciphers is too hard for them to crack, and to get it into > >> some contests. Here is a link: > >> > >> http://funwithfractals.atspace.cc/ct_cipher > >> > >> Here is some C code for it: > >> > >> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > >> > >> > >> 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. > > > > I will give it a go. > [...] > > 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. I suspect exponential e. I will look into it.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-30 12:40 -0700 |
| Message-ID | <325a1d9f-f72f-45e5-b3d2-029edf3a6f17n@googlegroups.com> |
| In reply to | #516032 |
On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: > > >> On 3/21/2021 9:08 AM, djoyce099 wrote: > > >>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > > >>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > > >>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: > > >>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > > >>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > >>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > > >>>>>>>>> The rational number below will produce a decrypted > > >>>>>>>>> poem using number to letter plain text for a total of 129 letters. > > >>>>>>>>> How is it done? > > >>>>>>>>> What you see below has to be processed. > > >>>>>>>>> A certain mathematical process to this number > > >>>>>>>>> has to be initiated to solve this puzzle. > > >>>>>>>>> The simple process will expose the simplicity > > >>>>>>>>> of this cipher. > > >>>>>>>> > > >>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? > > >>>>>>>> > > >>>>>>>>> > > >>>>>>>>> The rational number below may not need to be > > >>>>>>>>> as large a decimal expansion as it is but probably > > >>>>>>>>> about 90% of it is necessary to complete the process > > >>>>>>>>> of decrypting. > > >>>>>>>>> You will need an online calculator or coding language that > > >>>>>>>>> supports a level of 10,000 digit precision, that is what the > > >>>>>>>>> decimal expansion of the number below has. > > >>>>>>>>> > > >>>>>>>>> [...] > > >>>>>>>>> > > >>>>>>>>> > > >>>>>>>>> Who will be the first to decrypt this poem? > > >>>>>>>>> Good luck! > > >>>>>>> > > >>>>>>>> > > >>>>>>> I think I got it, but I need more precision! > > >>>>>>> > > >>>>>>> So far, I am getting: > > >>>>>>> > > >>>>>>> decryptingthisnumberandyo > > >>>>>>> > > >>>>>>> I must have it! Just need to continue further to complete the message! ;^) > > >>>>>> you got it! > > >>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > > >>>>>> difficult number letter replacement then what I used, This was the simplest form by building > > >>>>>> the rational from actual letter count for the CF. > > >>>>>> > > >>>>> Just a radically simple idea. Since you are already using arbitrary > > >>>>> precision numbers, wondering if simply multiplying the ciphertext by > > >>>>> another number would help "hide" things. This other number would be in > > >>>>> the secret key. So, something like, starting small for proof of concept: > > >>>>> > > >>>>> plaintext: decrypting > > >>>>> > > >>>>> Alice does: > > >>>>> > > >>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > > >>>>> > > >>>>> and sends 5.4183857957464205976790755066 to Bob. > > >>>>> > > >>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > > >>>>> 4.18771284681465660806, then gets the convergents. > > >>>>> > > >>>>> With high enough precision everything should stay intact? > > >>>> Yes, that process would be good to add to the already constructed CF > > >>>> but it also could start with more security in the cross-referencing with the > > >>>> letters with numbers which I didn't do just to keep it simple to just present > > >>>> the idea. This would deal with an extra private key along with the private > > >>>> key that you presented. > > >>>> This way the exposed rational for public viewing would not be easily > > >>>> decrypted through the CF method or any other possible method someone > > >>>> might try to employ to break the code. > > >>>> The latter would be impossible (other possible methods). > > >>> > > >>> In the cross-referencing of numbers to letters more private keys could be used > > >>> like below. > > >>> After your private key is initiated by the receiver then all even numbers in > > >>> the CF <19, are divided by 2 at the source. The receiver would multiply all even > > >>> numbers in the CF<10 by 2 using an algorithm. > > >>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > > >>> odd numbers > 34 in the CF using an algorithm. > > >>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > > >>> > > >> Interesting. Now this would be good to post in sci.crypt. They can be > > >> harsh, but kind in all of their solid help. They basically have told me > > >> that one of my ciphers is too hard for them to crack, and to get it into > > >> some contests. Here is a link: > > >> > > >> http://funwithfractals.atspace.cc/ct_cipher > > >> > > >> Here is some C code for it: > > >> > > >> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > > >> > > >> > > >> 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. > > > > > > I will give it a go. > > [...] > > > > 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. > I suspect exponential e. > I will look into it. Feigenbaum constants? FAT? first word?
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-30 14:29 -0700 |
| Message-ID | <d386f616-8165-4d87-a057-795b12838681n@googlegroups.com> |
| In reply to | #516045 |
On Tuesday, March 30, 2021 at 3:40:24 PM UTC-4, djoyce099 wrote: > On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: > > > >> On 3/21/2021 9:08 AM, djoyce099 wrote: > > > >>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > > > >>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > > > >>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: > > > >>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > > > >>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > > >>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > > > >>>>>>>>> The rational number below will produce a decrypted > > > >>>>>>>>> poem using number to letter plain text for a total of 129 letters. > > > >>>>>>>>> How is it done? > > > >>>>>>>>> What you see below has to be processed. > > > >>>>>>>>> A certain mathematical process to this number > > > >>>>>>>>> has to be initiated to solve this puzzle. > > > >>>>>>>>> The simple process will expose the simplicity > > > >>>>>>>>> of this cipher. > > > >>>>>>>> > > > >>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? > > > >>>>>>>> > > > >>>>>>>>> > > > >>>>>>>>> The rational number below may not need to be > > > >>>>>>>>> as large a decimal expansion as it is but probably > > > >>>>>>>>> about 90% of it is necessary to complete the process > > > >>>>>>>>> of decrypting. > > > >>>>>>>>> You will need an online calculator or coding language that > > > >>>>>>>>> supports a level of 10,000 digit precision, that is what the > > > >>>>>>>>> decimal expansion of the number below has. > > > >>>>>>>>> > > > >>>>>>>>> [...] > > > >>>>>>>>> > > > >>>>>>>>> > > > >>>>>>>>> Who will be the first to decrypt this poem? > > > >>>>>>>>> Good luck! > > > >>>>>>> > > > >>>>>>>> > > > >>>>>>> I think I got it, but I need more precision! > > > >>>>>>> > > > >>>>>>> So far, I am getting: > > > >>>>>>> > > > >>>>>>> decryptingthisnumberandyo > > > >>>>>>> > > > >>>>>>> I must have it! Just need to continue further to complete the message! ;^) > > > >>>>>> you got it! > > > >>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > > > >>>>>> difficult number letter replacement then what I used, This was the simplest form by building > > > >>>>>> the rational from actual letter count for the CF. > > > >>>>>> > > > >>>>> Just a radically simple idea. Since you are already using arbitrary > > > >>>>> precision numbers, wondering if simply multiplying the ciphertext by > > > >>>>> another number would help "hide" things. This other number would be in > > > >>>>> the secret key. So, something like, starting small for proof of concept: > > > >>>>> > > > >>>>> plaintext: decrypting > > > >>>>> > > > >>>>> Alice does: > > > >>>>> > > > >>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > > > >>>>> > > > >>>>> and sends 5.4183857957464205976790755066 to Bob. > > > >>>>> > > > >>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > > > >>>>> 4.18771284681465660806, then gets the convergents. > > > >>>>> > > > >>>>> With high enough precision everything should stay intact? > > > >>>> Yes, that process would be good to add to the already constructed CF > > > >>>> but it also could start with more security in the cross-referencing with the > > > >>>> letters with numbers which I didn't do just to keep it simple to just present > > > >>>> the idea. This would deal with an extra private key along with the private > > > >>>> key that you presented. > > > >>>> This way the exposed rational for public viewing would not be easily > > > >>>> decrypted through the CF method or any other possible method someone > > > >>>> might try to employ to break the code. > > > >>>> The latter would be impossible (other possible methods). > > > >>> > > > >>> In the cross-referencing of numbers to letters more private keys could be used > > > >>> like below. > > > >>> After your private key is initiated by the receiver then all even numbers in > > > >>> the CF <19, are divided by 2 at the source. The receiver would multiply all even > > > >>> numbers in the CF<10 by 2 using an algorithm. > > > >>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > > > >>> odd numbers > 34 in the CF using an algorithm. > > > >>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > > > >>> > > > >> Interesting. Now this would be good to post in sci.crypt. They can be > > > >> harsh, but kind in all of their solid help. They basically have told me > > > >> that one of my ciphers is too hard for them to crack, and to get it into > > > >> some contests. Here is a link: > > > >> > > > >> http://funwithfractals.atspace.cc/ct_cipher > > > >> > > > >> Here is some C code for it: > > > >> > > > >> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > > > >> > > > >> > > > >> 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. > > > > > > > > I will give it a go. > > > [...] > > > > > > 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. > > I suspect exponential e. > > I will look into it. > Feigenbaum constants? FAT? first word? I have not researched this much. Still looking at my old algorithms from the 80s processed on a Commodore 64. It was using only digits 1-7 in different orders creates a public key that was created by the encryption algorithm and then processed at the decryption end algorithm using only these digits 1-7 in a string of these digits as long as needed for each message as input to decrypt a message. There are integer identifiers 1-7 in every odd position of the encrypted string. ex: 4,3, 7,6 = 4th group and the 3rd alpha. character within that group and 7,6 is the 7th group and the 6th alpha. character within that group. This is all done by parsing (49 Alpha) length strings in the encryption process creating only digits 1-7 in the public key. 26*2=52 -xyz = 49+7 =56 the total length of the string. The 7 digital group identifiers of the 1-7 groups of 7 alpha characters are placed randomly in each group. of 7 plus the leading integer group identifier randomly in the entire string. Not to mention within each group the 7 alpha characters are not in any order but distributed in a chaotic order throughout the string. The created public key would look something like -- 1,7,2,5,3,4,7,1,6,5,2,2,7...(as long as needed for the message). This would be almost impossible to crack even knowing the odd positions are the identifiers of groups of 7 randomly placed alpha Chr. within each group. And knowing the even positions of the 1-7 numbers representing one alpha Chr. within that group. Because one (T), as an example in a left to right scan of the string is needed a second repeated (T) would be found in a different group. Even if it was not a word like Little with a double T it could even land on the same group again or the other group like above adding to the complexity. Explaining it further, a scan of the string starts at the beginning then halts on a match, and continues until another match, and if no other match it rescans again. That is what adds to the complexity where two of the same alpha. characters are in the same string and can land on the same group or a different group. This excludes XYZ that is only represented once in the string whereas all the others are represented twice. I never tried this on 2 actual computers running compatible algorithms (encrypt, decrypt algorithms) only on the commodore at the time, A simple concept but a very hard cipher or impossible cipher to crack because only digits 1-7 are used in the ciphertext. An example of a typical key string embedded in both algorithms -- "3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" = 56 characters Other strings in these algorithms are involved but this is the main key string in both. A parsing nightmare.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-30 22:06 -0700 |
| Message-ID | <59751715-59b6-4dc3-996b-8b54a345bf6cn@googlegroups.com> |
| In reply to | #516058 |
On Tuesday, March 30, 2021 at 5:29:08 PM UTC-4, djoyce099 wrote: > On Tuesday, March 30, 2021 at 3:40:24 PM UTC-4, djoyce099 wrote: > > On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: > > > > >> On 3/21/2021 9:08 AM, djoyce099 wrote: > > > > >>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > > > > >>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > > > > >>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: > > > > >>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > > > > >>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > > > > >>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > > > > >>>>>>>>> The rational number below will produce a decrypted > > > > >>>>>>>>> poem using number to letter plain text for a total of 129 letters. > > > > >>>>>>>>> How is it done? > > > > >>>>>>>>> What you see below has to be processed. > > > > >>>>>>>>> A certain mathematical process to this number > > > > >>>>>>>>> has to be initiated to solve this puzzle. > > > > >>>>>>>>> The simple process will expose the simplicity > > > > >>>>>>>>> of this cipher. > > > > >>>>>>>> > > > > >>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? > > > > >>>>>>>> > > > > >>>>>>>>> > > > > >>>>>>>>> The rational number below may not need to be > > > > >>>>>>>>> as large a decimal expansion as it is but probably > > > > >>>>>>>>> about 90% of it is necessary to complete the process > > > > >>>>>>>>> of decrypting. > > > > >>>>>>>>> You will need an online calculator or coding language that > > > > >>>>>>>>> supports a level of 10,000 digit precision, that is what the > > > > >>>>>>>>> decimal expansion of the number below has. > > > > >>>>>>>>> > > > > >>>>>>>>> [...] > > > > >>>>>>>>> > > > > >>>>>>>>> > > > > >>>>>>>>> Who will be the first to decrypt this poem? > > > > >>>>>>>>> Good luck! > > > > >>>>>>> > > > > >>>>>>>> > > > > >>>>>>> I think I got it, but I need more precision! > > > > >>>>>>> > > > > >>>>>>> So far, I am getting: > > > > >>>>>>> > > > > >>>>>>> decryptingthisnumberandyo > > > > >>>>>>> > > > > >>>>>>> I must have it! Just need to continue further to complete the message! ;^) > > > > >>>>>> you got it! > > > > >>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > > > > >>>>>> difficult number letter replacement then what I used, This was the simplest form by building > > > > >>>>>> the rational from actual letter count for the CF. > > > > >>>>>> > > > > >>>>> Just a radically simple idea. Since you are already using arbitrary > > > > >>>>> precision numbers, wondering if simply multiplying the ciphertext by > > > > >>>>> another number would help "hide" things. This other number would be in > > > > >>>>> the secret key. So, something like, starting small for proof of concept: > > > > >>>>> > > > > >>>>> plaintext: decrypting > > > > >>>>> > > > > >>>>> Alice does: > > > > >>>>> > > > > >>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > > > > >>>>> > > > > >>>>> and sends 5.4183857957464205976790755066 to Bob. > > > > >>>>> > > > > >>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > > > > >>>>> 4.18771284681465660806, then gets the convergents. > > > > >>>>> > > > > >>>>> With high enough precision everything should stay intact? > > > > >>>> Yes, that process would be good to add to the already constructed CF > > > > >>>> but it also could start with more security in the cross-referencing with the > > > > >>>> letters with numbers which I didn't do just to keep it simple to just present > > > > >>>> the idea. This would deal with an extra private key along with the private > > > > >>>> key that you presented. > > > > >>>> This way the exposed rational for public viewing would not be easily > > > > >>>> decrypted through the CF method or any other possible method someone > > > > >>>> might try to employ to break the code. > > > > >>>> The latter would be impossible (other possible methods). > > > > >>> > > > > >>> In the cross-referencing of numbers to letters more private keys could be used > > > > >>> like below. > > > > >>> After your private key is initiated by the receiver then all even numbers in > > > > >>> the CF <19, are divided by 2 at the source. The receiver would multiply all even > > > > >>> numbers in the CF<10 by 2 using an algorithm. > > > > >>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > > > > >>> odd numbers > 34 in the CF using an algorithm. > > > > >>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > > > > >>> > > > > >> Interesting. Now this would be good to post in sci.crypt. They can be > > > > >> harsh, but kind in all of their solid help. They basically have told me > > > > >> that one of my ciphers is too hard for them to crack, and to get it into > > > > >> some contests. Here is a link: > > > > >> > > > > >> http://funwithfractals.atspace.cc/ct_cipher > > > > >> > > > > >> Here is some C code for it: > > > > >> > > > > >> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > > > > >> > > > > >> > > > > >> 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. > > > > > > > > > > I will give it a go. > > > > [...] > > > > > > > > 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. > > > I suspect exponential e. > > > I will look into it. > > Feigenbaum constants? FAT? first word? > I have not researched this much. Still looking at my old algorithms from the 80s processed on > a Commodore 64. > > It was using only digits 1-7 in different orders creates a public key that was > created by the encryption algorithm and then processed at the decryption end algorithm using only > these digits 1-7 in a string of these digits as long as needed for each message as input to decrypt a message. > There are integer identifiers 1-7 in every odd position of the encrypted string. ex: 4,3, 7,6 = 4th group and the 3rd > alpha. character within that group and 7,6 is the 7th group and the 6th alpha. character within that group. > > This is all done by parsing (49 Alpha) length strings in the encryption process creating only digits > 1-7 in the public key. 26*2=52 -xyz = 49+7 =56 the total length of the string. > The 7 digital group identifiers of the 1-7 groups of 7 alpha characters are placed randomly in each group. > of 7 plus the leading integer group identifier randomly in the entire string. Not to mention within each group > the 7 alpha characters are not in any order but distributed in a chaotic order throughout the string. > > The created public key would look something like -- 1,7,2,5,3,4,7,1,6,5,2,2,7...(as long as needed for the message). > This would be almost impossible to crack even knowing the odd positions are the identifiers > of groups of 7 randomly placed alpha Chr. within each group. > And knowing the even positions of the 1-7 numbers representing one alpha Chr. within that group. > Because one (T), as an example in a left to right scan of the string is needed a second repeated (T) > would be found in a different group. Even if it was not a word like Little with a double T it could > even land on the same group again or the other group like above adding to the complexity. > Explaining it further, a scan of the string starts at the beginning then halts on a match, and continues until > another match, and if no other match it rescans again. That is what adds to the complexity where two > of the same alpha. characters are in the same string and can land on the same group or a different group. > This excludes XYZ that is only represented once in the string whereas all the others are represented twice. > I never tried this on 2 actual computers running compatible algorithms (encrypt, decrypt algorithms) > only on the commodore at the time, A simple concept but a very hard cipher or impossible cipher to crack > because only digits 1-7 are used in the ciphertext. > An example of a typical key string embedded in both algorithms -- > "3KPMJNOL5VQSUWRT1KHMNJIL6IDCGHFE2BECGFDA7SOQUTRP4YAVXBWZ" = 56 characters > Other strings in these algorithms are involved but this is the main key string in both. > A parsing nightmare. The short encrypted message is taken from the production string above that's a procedure in the encryption algorithm. 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 This is produced from left to right and you will notice after group 5, 2 index numbers are the same. That means two letters were fetched from that group 1 on one pass. The same is true near the end of the ciphertext (6,2,67) You don't even need an algorithm to solve it with the giveaway info. I provided because the string of numbers and letters is the private key and the ciphertext of numbers is the public key. This is just what I remember about this that I did back in the 80s Who will be the first with the algorithms or just solving it with the slide method? I am working on it in Python now.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-30 15:42 -0700 |
| Message-ID | <s409g3$1la3$2@gioia.aioe.org> |
| In reply to | #516045 |
On 3/30/2021 12:40 PM, djoyce099 wrote: > On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: >>>>> On 3/21/2021 9:08 AM, djoyce099 wrote: >>>>>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: >>>>>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: >>>>>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: >>>>>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >>>>>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>>>>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>>>>>>>>>> The rational number below will produce a decrypted >>>>>>>>>>>> poem using number to letter plain text for a total of 129 letters. >>>>>>>>>>>> How is it done? >>>>>>>>>>>> What you see below has to be processed. >>>>>>>>>>>> A certain mathematical process to this number >>>>>>>>>>>> has to be initiated to solve this puzzle. >>>>>>>>>>>> The simple process will expose the simplicity >>>>>>>>>>>> of this cipher. >>>>>>>>>>> >>>>>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? >>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> The rational number below may not need to be >>>>>>>>>>>> as large a decimal expansion as it is but probably >>>>>>>>>>>> about 90% of it is necessary to complete the process >>>>>>>>>>>> of decrypting. >>>>>>>>>>>> You will need an online calculator or coding language that >>>>>>>>>>>> supports a level of 10,000 digit precision, that is what the >>>>>>>>>>>> decimal expansion of the number below has. >>>>>>>>>>>> >>>>>>>>>>>> [...] >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Who will be the first to decrypt this poem? >>>>>>>>>>>> Good luck! >>>>>>>>>> >>>>>>>>>>> >>>>>>>>>> I think I got it, but I need more precision! >>>>>>>>>> >>>>>>>>>> So far, I am getting: >>>>>>>>>> >>>>>>>>>> decryptingthisnumberandyo >>>>>>>>>> >>>>>>>>>> I must have it! Just need to continue further to complete the message! ;^) >>>>>>>>> you got it! >>>>>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and >>>>>>>>> difficult number letter replacement then what I used, This was the simplest form by building >>>>>>>>> the rational from actual letter count for the CF. >>>>>>>>> >>>>>>>> Just a radically simple idea. Since you are already using arbitrary >>>>>>>> precision numbers, wondering if simply multiplying the ciphertext by >>>>>>>> another number would help "hide" things. This other number would be in >>>>>>>> the secret key. So, something like, starting small for proof of concept: >>>>>>>> >>>>>>>> plaintext: decrypting >>>>>>>> >>>>>>>> Alice does: >>>>>>>> >>>>>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 >>>>>>>> >>>>>>>> and sends 5.4183857957464205976790755066 to Bob. >>>>>>>> >>>>>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = >>>>>>>> 4.18771284681465660806, then gets the convergents. >>>>>>>> >>>>>>>> With high enough precision everything should stay intact? >>>>>>> Yes, that process would be good to add to the already constructed CF >>>>>>> but it also could start with more security in the cross-referencing with the >>>>>>> letters with numbers which I didn't do just to keep it simple to just present >>>>>>> the idea. This would deal with an extra private key along with the private >>>>>>> key that you presented. >>>>>>> This way the exposed rational for public viewing would not be easily >>>>>>> decrypted through the CF method or any other possible method someone >>>>>>> might try to employ to break the code. >>>>>>> The latter would be impossible (other possible methods). >>>>>> >>>>>> In the cross-referencing of numbers to letters more private keys could be used >>>>>> like below. >>>>>> After your private key is initiated by the receiver then all even numbers in >>>>>> the CF <19, are divided by 2 at the source. The receiver would multiply all even >>>>>> numbers in the CF<10 by 2 using an algorithm. >>>>>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all >>>>>> odd numbers > 34 in the CF using an algorithm. >>>>>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. >>>>>> >>>>> Interesting. Now this would be good to post in sci.crypt. They can be >>>>> harsh, but kind in all of their solid help. They basically have told me >>>>> that one of my ciphers is too hard for them to crack, and to get it into >>>>> some contests. Here is a link: >>>>> >>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>> >>>>> Here is some C code for it: >>>>> >>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ >>>>> >>>>> >>>>> 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. >>>> >>>> I will give it a go. >>> [...] >>> >>> 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. >> I suspect exponential e. >> I will look into it. > Feigenbaum constants? FAT? first word? > No. Its only one word. The three digits after 2. are monotonically increasing.
[toc] | [prev] | [next] | [standalone]
| From | djoyce099 <hlauk.h.bogart@gmail.com> |
|---|---|
| Date | 2021-03-30 19:43 -0700 |
| Message-ID | <7128ae45-cf3f-4129-91ff-740520d1a9f5n@googlegroups.com> |
| In reply to | #516063 |
On Tuesday, March 30, 2021 at 6:42:23 PM UTC-4, Chris M. Thomasson wrote: > On 3/30/2021 12:40 PM, djoyce099 wrote: > > On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: > >>>>> On 3/21/2021 9:08 AM, djoyce099 wrote: > >>>>>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: > >>>>>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: > >>>>>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: > >>>>>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: > >>>>>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: > >>>>>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: > >>>>>>>>>>>> The rational number below will produce a decrypted > >>>>>>>>>>>> poem using number to letter plain text for a total of 129 letters. > >>>>>>>>>>>> How is it done? > >>>>>>>>>>>> What you see below has to be processed. > >>>>>>>>>>>> A certain mathematical process to this number > >>>>>>>>>>>> has to be initiated to solve this puzzle. > >>>>>>>>>>>> The simple process will expose the simplicity > >>>>>>>>>>>> of this cipher. > >>>>>>>>>>> > >>>>>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? > >>>>>>>>>>> > >>>>>>>>>>>> > >>>>>>>>>>>> The rational number below may not need to be > >>>>>>>>>>>> as large a decimal expansion as it is but probably > >>>>>>>>>>>> about 90% of it is necessary to complete the process > >>>>>>>>>>>> of decrypting. > >>>>>>>>>>>> You will need an online calculator or coding language that > >>>>>>>>>>>> supports a level of 10,000 digit precision, that is what the > >>>>>>>>>>>> decimal expansion of the number below has. > >>>>>>>>>>>> > >>>>>>>>>>>> [...] > >>>>>>>>>>>> > >>>>>>>>>>>> > >>>>>>>>>>>> Who will be the first to decrypt this poem? > >>>>>>>>>>>> Good luck! > >>>>>>>>>> > >>>>>>>>>>> > >>>>>>>>>> I think I got it, but I need more precision! > >>>>>>>>>> > >>>>>>>>>> So far, I am getting: > >>>>>>>>>> > >>>>>>>>>> decryptingthisnumberandyo > >>>>>>>>>> > >>>>>>>>>> I must have it! Just need to continue further to complete the message! ;^) > >>>>>>>>> you got it! > >>>>>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and > >>>>>>>>> difficult number letter replacement then what I used, This was the simplest form by building > >>>>>>>>> the rational from actual letter count for the CF. > >>>>>>>>> > >>>>>>>> Just a radically simple idea. Since you are already using arbitrary > >>>>>>>> precision numbers, wondering if simply multiplying the ciphertext by > >>>>>>>> another number would help "hide" things. This other number would be in > >>>>>>>> the secret key. So, something like, starting small for proof of concept: > >>>>>>>> > >>>>>>>> plaintext: decrypting > >>>>>>>> > >>>>>>>> Alice does: > >>>>>>>> > >>>>>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 > >>>>>>>> > >>>>>>>> and sends 5.4183857957464205976790755066 to Bob. > >>>>>>>> > >>>>>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = > >>>>>>>> 4.18771284681465660806, then gets the convergents. > >>>>>>>> > >>>>>>>> With high enough precision everything should stay intact? > >>>>>>> Yes, that process would be good to add to the already constructed CF > >>>>>>> but it also could start with more security in the cross-referencing with the > >>>>>>> letters with numbers which I didn't do just to keep it simple to just present > >>>>>>> the idea. This would deal with an extra private key along with the private > >>>>>>> key that you presented. > >>>>>>> This way the exposed rational for public viewing would not be easily > >>>>>>> decrypted through the CF method or any other possible method someone > >>>>>>> might try to employ to break the code. > >>>>>>> The latter would be impossible (other possible methods). > >>>>>> > >>>>>> In the cross-referencing of numbers to letters more private keys could be used > >>>>>> like below. > >>>>>> After your private key is initiated by the receiver then all even numbers in > >>>>>> the CF <19, are divided by 2 at the source. The receiver would multiply all even > >>>>>> numbers in the CF<10 by 2 using an algorithm. > >>>>>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all > >>>>>> odd numbers > 34 in the CF using an algorithm. > >>>>>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. > >>>>>> > >>>>> Interesting. Now this would be good to post in sci.crypt. They can be > >>>>> harsh, but kind in all of their solid help. They basically have told me > >>>>> that one of my ciphers is too hard for them to crack, and to get it into > >>>>> some contests. Here is a link: > >>>>> > >>>>> http://funwithfractals.atspace.cc/ct_cipher > >>>>> > >>>>> Here is some C code for it: > >>>>> > >>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ > >>>>> > >>>>> > >>>>> 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. > >>>> > >>>> I will give it a go. > >>> [...] > >>> > >>> 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. > >> I suspect exponential e. > >> I will look into it. > > Feigenbaum constants? FAT? first word? > > > No. Its only one word. The three digits after 2. are monotonically > increasing. Is it the cube root of the sqrt(2)? MAD?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-31 15:09 -0700 |
| Message-ID | <s42rum$a1e$2@gioia.aioe.org> |
| In reply to | #516081 |
On 3/30/2021 7:43 PM, djoyce099 wrote: > On Tuesday, March 30, 2021 at 6:42:23 PM UTC-4, Chris M. Thomasson wrote: >> On 3/30/2021 12:40 PM, djoyce099 wrote: >>> On Tuesday, March 30, 2021 at 2:36:13 PM UTC-4, 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: >>>>>>> On 3/21/2021 9:08 AM, djoyce099 wrote: >>>>>>>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: >>>>>>>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: >>>>>>>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: >>>>>>>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >>>>>>>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>>>>>>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>>>>>>>>>>>> The rational number below will produce a decrypted >>>>>>>>>>>>>> poem using number to letter plain text for a total of 129 letters. >>>>>>>>>>>>>> How is it done? >>>>>>>>>>>>>> What you see below has to be processed. >>>>>>>>>>>>>> A certain mathematical process to this number >>>>>>>>>>>>>> has to be initiated to solve this puzzle. >>>>>>>>>>>>>> The simple process will expose the simplicity >>>>>>>>>>>>>> of this cipher. >>>>>>>>>>>>> >>>>>>>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? >>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> The rational number below may not need to be >>>>>>>>>>>>>> as large a decimal expansion as it is but probably >>>>>>>>>>>>>> about 90% of it is necessary to complete the process >>>>>>>>>>>>>> of decrypting. >>>>>>>>>>>>>> You will need an online calculator or coding language that >>>>>>>>>>>>>> supports a level of 10,000 digit precision, that is what the >>>>>>>>>>>>>> decimal expansion of the number below has. >>>>>>>>>>>>>> >>>>>>>>>>>>>> [...] >>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> Who will be the first to decrypt this poem? >>>>>>>>>>>>>> Good luck! >>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>> I think I got it, but I need more precision! >>>>>>>>>>>> >>>>>>>>>>>> So far, I am getting: >>>>>>>>>>>> >>>>>>>>>>>> decryptingthisnumberandyo >>>>>>>>>>>> >>>>>>>>>>>> I must have it! Just need to continue further to complete the message! ;^) >>>>>>>>>>> you got it! >>>>>>>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and >>>>>>>>>>> difficult number letter replacement then what I used, This was the simplest form by building >>>>>>>>>>> the rational from actual letter count for the CF. >>>>>>>>>>> >>>>>>>>>> Just a radically simple idea. Since you are already using arbitrary >>>>>>>>>> precision numbers, wondering if simply multiplying the ciphertext by >>>>>>>>>> another number would help "hide" things. This other number would be in >>>>>>>>>> the secret key. So, something like, starting small for proof of concept: >>>>>>>>>> >>>>>>>>>> plaintext: decrypting >>>>>>>>>> >>>>>>>>>> Alice does: >>>>>>>>>> >>>>>>>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 >>>>>>>>>> >>>>>>>>>> and sends 5.4183857957464205976790755066 to Bob. >>>>>>>>>> >>>>>>>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = >>>>>>>>>> 4.18771284681465660806, then gets the convergents. >>>>>>>>>> >>>>>>>>>> With high enough precision everything should stay intact? >>>>>>>>> Yes, that process would be good to add to the already constructed CF >>>>>>>>> but it also could start with more security in the cross-referencing with the >>>>>>>>> letters with numbers which I didn't do just to keep it simple to just present >>>>>>>>> the idea. This would deal with an extra private key along with the private >>>>>>>>> key that you presented. >>>>>>>>> This way the exposed rational for public viewing would not be easily >>>>>>>>> decrypted through the CF method or any other possible method someone >>>>>>>>> might try to employ to break the code. >>>>>>>>> The latter would be impossible (other possible methods). >>>>>>>> >>>>>>>> In the cross-referencing of numbers to letters more private keys could be used >>>>>>>> like below. >>>>>>>> After your private key is initiated by the receiver then all even numbers in >>>>>>>> the CF <19, are divided by 2 at the source. The receiver would multiply all even >>>>>>>> numbers in the CF<10 by 2 using an algorithm. >>>>>>>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all >>>>>>>> odd numbers > 34 in the CF using an algorithm. >>>>>>>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. >>>>>>>> >>>>>>> Interesting. Now this would be good to post in sci.crypt. They can be >>>>>>> harsh, but kind in all of their solid help. They basically have told me >>>>>>> that one of my ciphers is too hard for them to crack, and to get it into >>>>>>> some contests. Here is a link: >>>>>>> >>>>>>> http://funwithfractals.atspace.cc/ct_cipher >>>>>>> >>>>>>> Here is some C code for it: >>>>>>> >>>>>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ >>>>>>> >>>>>>> >>>>>>> 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. >>>>>> >>>>>> I will give it a go. >>>>> [...] >>>>> >>>>> 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. >>>> I suspect exponential e. >>>> I will look into it. >>> Feigenbaum constants? FAT? first word? >>> >> No. Its only one word. The three digits after 2. are monotonically >> increasing. > Is it the cube root of the sqrt(2)? MAD? > No. Remember that 17.4016863080244085 needs to be divided by this to get the original number that contains the plaintext in its convergents.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-30 15:39 -0700 |
| Message-ID | <s409a7$1la3$1@gioia.aioe.org> |
| In reply to | #516032 |
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: >>>> On 3/21/2021 9:08 AM, djoyce099 wrote: >>>>> On Sunday, March 21, 2021 at 11:01:05 AM UTC-4, djoyce099 wrote: >>>>>> On Sunday, March 21, 2021 at 2:08:50 AM UTC-4, Chris M. Thomasson wrote: >>>>>>> On 3/20/2021 6:49 PM, djoyce099 wrote: >>>>>>>> On Saturday, March 20, 2021 at 8:39:33 PM UTC-4, Chris M. Thomasson wrote: >>>>>>>>> On 3/20/2021 2:25 PM, Chris M. Thomasson wrote: >>>>>>>>>> On 3/20/2021 2:22 PM, djoyce099 wrote: >>>>>>>>>>> The rational number below will produce a decrypted >>>>>>>>>>> poem using number to letter plain text for a total of 129 letters. >>>>>>>>>>> How is it done? >>>>>>>>>>> What you see below has to be processed. >>>>>>>>>>> A certain mathematical process to this number >>>>>>>>>>> has to be initiated to solve this puzzle. >>>>>>>>>>> The simple process will expose the simplicity >>>>>>>>>>> of this cipher. >>>>>>>>>> >>>>>>>>>> Did you xor the plaintext with the decimal expansion of the rational? >>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> The rational number below may not need to be >>>>>>>>>>> as large a decimal expansion as it is but probably >>>>>>>>>>> about 90% of it is necessary to complete the process >>>>>>>>>>> of decrypting. >>>>>>>>>>> You will need an online calculator or coding language that >>>>>>>>>>> supports a level of 10,000 digit precision, that is what the >>>>>>>>>>> decimal expansion of the number below has. >>>>>>>>>>> >>>>>>>>>>> [...] >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Who will be the first to decrypt this poem? >>>>>>>>>>> Good luck! >>>>>>>>> >>>>>>>>>> >>>>>>>>> I think I got it, but I need more precision! >>>>>>>>> >>>>>>>>> So far, I am getting: >>>>>>>>> >>>>>>>>> decryptingthisnumberandyo >>>>>>>>> >>>>>>>>> I must have it! Just need to continue further to complete the message! ;^) >>>>>>>> you got it! >>>>>>>> I just thought it was a novel idea using CF but in actual practice use a more safisticated and >>>>>>>> difficult number letter replacement then what I used, This was the simplest form by building >>>>>>>> the rational from actual letter count for the CF. >>>>>>>> >>>>>>> Just a radically simple idea. Since you are already using arbitrary >>>>>>> precision numbers, wondering if simply multiplying the ciphertext by >>>>>>> another number would help "hide" things. This other number would be in >>>>>>> the secret key. So, something like, starting small for proof of concept: >>>>>>> >>>>>>> plaintext: decrypting >>>>>>> >>>>>>> Alice does: >>>>>>> >>>>>>> 4.18771284681465660806 * 1.29387711 = 5.4183857957464205976790755066 >>>>>>> >>>>>>> and sends 5.4183857957464205976790755066 to Bob. >>>>>>> >>>>>>> Bob decrypts by computing 5.4183857957464205976790755066 / 1.29387711 = >>>>>>> 4.18771284681465660806, then gets the convergents. >>>>>>> >>>>>>> With high enough precision everything should stay intact? >>>>>> Yes, that process would be good to add to the already constructed CF >>>>>> but it also could start with more security in the cross-referencing with the >>>>>> letters with numbers which I didn't do just to keep it simple to just present >>>>>> the idea. This would deal with an extra private key along with the private >>>>>> key that you presented. >>>>>> This way the exposed rational for public viewing would not be easily >>>>>> decrypted through the CF method or any other possible method someone >>>>>> might try to employ to break the code. >>>>>> The latter would be impossible (other possible methods). >>>>> >>>>> In the cross-referencing of numbers to letters more private keys could be used >>>>> like below. >>>>> After your private key is initiated by the receiver then all even numbers in >>>>> the CF <19, are divided by 2 at the source. The receiver would multiply all even >>>>> numbers in the CF<10 by 2 using an algorithm. >>>>> Aso all odd numbers in the CF >6 multiply by 5. The receiver would divide by 5 all >>>>> odd numbers > 34 in the CF using an algorithm. >>>>> Or somesuch scheme to confuse a codebreaker using a CF method on a rational. >>>>> >>>> Interesting. Now this would be good to post in sci.crypt. They can be >>>> harsh, but kind in all of their solid help. They basically have told me >>>> that one of my ciphers is too hard for them to crack, and to get it into >>>> some contests. Here is a link: >>>> >>>> http://funwithfractals.atspace.cc/ct_cipher >>>> >>>> Here is some C code for it: >>>> >>>> https://groups.google.com/g/comp.lang.c/c/a53VxN8cwkY/m/aI96Pq3XAwAJ >>>> >>>> >>>> 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. >>> >>> I will give it a go. >> [...] >> >> 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. > I suspect exponential e. > I will look into it. > 2. followed by three digits. So, its not 2.877
[toc] | [prev] | [next] | [standalone]
| From | James Waldby <j-waldby@no.no> |
|---|---|
| Date | 2021-03-31 20:55 +0000 |
| Message-ID | <s42nk6$35e$1@dont-email.me> |
| In reply to | #516062 |
Chris M. Thomasson <chris.m.thomasson.1@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. - jiw
[toc] | [prev] | [next] | [standalone]
Page 2 of 6 — ← Prev page 1 [2] 3 4 5 6 Next page →
Back to top | Article view | sci.math
csiph-web