Wiki Menu


Home
Pix
Get Hoversnap
Use Hoversnap
Survey
Puzzles
Doodles
3 Ladies
3 Prisoners
CSG
AlphaSets
Subsets
Match Sets
Pizza Test
Truth Tables
Conditionals
16 Tables
Validity
Arguments
Pipe Game
Water Logic
Adder
Carry In
Carry Out
8-Car Adder
Number Bases
ASCII
Codes
RSA
Sequences
Staircase
Counting
ScrabbleGrams
Anagrams
Dupligrams
Amalgams
Powerball
Birthdays
Dice Rolls
BlackJack
Coin Flip
Triangle Tree

RSA


PUBLIC CODES

C = Me mod n
M = Cd mod n

1. Key Generator




2. Code Converter




3. Code Encrypter




4. Code Decrypter





Have you ever bought something online with a credit card? Have you paid a bill online? Have you logged into a website like this one? Chances are you have used a code that is part secret and part public. The most familiar of these public codes is the RSA code, invented by Rivest, Shamir, and Adleman at MIT way back in 1976. Because of the big numbers generated by the RSA code, it is a code practical only in the computer age.

Here is how the RSA code works. Suppose you want to buy a book, CD, or DVD from Amazon.com with your Master Card number 5398601234567890. Amazon's computer then publishes two big numbers; that is, Amazon's computer sends your computer two numbers. You may never see these numbers, but your computer will. The first number looks pretty big with about 64 digits, but the second number is even bigger with approximately 308 digits. The first number is generated randomly by Amazon's computer. Call it e. The second number is the product of two randomly generated prime numbers with about 155 digits each. Call them p and q. Call their product n, so that p x q = n. The numbers e and n are the public part of the RSA code. The numbers p and q are the private part of the RSA code. Hackers tapping into your phone or cable line will take a long time factoring n into p and q. Right now the fastest computers working constantly by trial and error will take an estimated billion years to find the p and q whose product is n. This is why RSA is considered relatively safe. That is, RSA is safe until someone finds a faster computer or method for factoring big numbers. Recently, there have been hacker contests to see who can crack government codes in less than a day.

So what does your computer do with the e, p, q, and n? The software that Amazon sends to your computer inputs your Master Card number and raises it to the power e. If the number is bigger than n, it continues to subtract n until it gets a number C smaller than n. Example using a very small e, p, q, and n: If e=13, p=43, q=59, then n=43x59=2537, and C = 539860123456789013 mod 2537 = 662929112708751560. The number C is then sent to Amazon.com, and you have finished your part of the transaction. This is the same as saying C = Me mod n. The mod n part means modular number n. Remember your assignment on the Caesar and Vigenere codes? The number n was 26 there. In our applet, n is about 308 digits long. But for actual internet security, n would be between 400 and 500 digits long.

So what does Amazon.com do with your Master Card number encrypted as the number C? Amazon reverses the process using this formula: M = Cd mod n, which says: raise C to the power d. If the number is bigger than n, Amazon's computer continues to subtract n until it gets a number M smaller than n. M is your Master Card number. But wait! Where did that d come from? Ah, yes, this is the math part.

Let's go back to the beginning. When Amazon's computer generates p and q, and multiplies them together to get n, it double checks to make sure that the number e is chosen so it has no factors in common with (p-1) x (q-1). For example, 13 and (43-1 x 59-1)=2436 have no factors in common with each other. Because of this fact, e has what is called an inverse number. Call it d. In modular arithmetic, when you have a mod number like (p-1) x (q-1), the product of inverse numbers, such as e and d will equal 1 mod (p-1) x (q-1). This says: if you subtract the product of (p-1) and (q-1) many times from the product of e and d, you will eventually reach 1. Call the number of subtractions k. This process is described by the formula:
ed = 1 + k(p-1)(q-1).

To find a d for e, we solve this equation for d.
The number k may be any number that satisfies the equation.
For example: 13d = 1 + k(43-1)(59-1) = 1 + k x 2436.
If k=5, then 13d = 1 + 5 x 2436 = 12181,
and d = 12181/13 = 937.
So 937 is the inverse of 13 mod 2436.
To decode the secret Master Card number 662929112708751560, Amazon's computer applies the decrypting formula: M = 662929112708751560937 mod 2537 = 5398601234567890,

Let's try another example with relatively small numbers, and use letters rather than Master Card digits.
    The Seeker for help publishes two numbers:
  • Randomly generates an exponent e, say 13.
  • Randomly generates two prime numbers p and q, say 43 and 59.
  • Multiplies 43 and 59 to get n = 2537.
  • Publishes 13 and 2537.
    The Helper sends back an encrypted answer:
  • Encrypts the word HELP.
  • Converts each letter to its position in the alphabet: H=07, E=04, L=11, P=15.
  • Then HE equals 0704.
  • Then LP equals 1115.
  • The encryption for HE equals 070413 mod 2537 = 0981.
  • The encryption for LP equals 111513 mod 2537 = 0461.
  • Sends C = 09810461 as a secret message.
    The Seeker decrypts the message:
  • Finds d=937 from the formula 13d = 1 + (43-1)(59-1)k = 1 + 2436k.
  • Finds HE = 0981937 mod 2537 = 0704.
  • Finds LP = 0461937 mod 2537 = 1115.
  • Looks up letter positions for 07 04 11 15.
  • Receives HELP.


ASSIGNMENT 1: THE SEEKER

For 3 points: Play with the Key Generator applet to see how it works. Generate 5 numbers by pressing the Generate Public & Private Key button. An exponent e, a big number n, prime numbers p and q, and an inverse exponent d appears. Enter a sequence of only digits in the Message box. Press the Encrypt button, and a longer sequence of digits appears in the Encryption box. Press the Decrypt button, and the plain text message is recovered. After you run the applet a few times to see how it works, hilite, copy, and save your 5 key numbers to a word processor like Word or Notepad. You can hilite a long number more easily if you right click inside a box and click on Select All. Copy easily by right clicking on your hilited digits and then click on Copy. In your word processor, right click again and choose Paste. After you save your 5 numbers, hilite and copy numbers e and n to a comment on the wiki.

TO AVOID ERRORS, DO NOT ATTEMPT TO RETYPE ANY OF THESE NUMBERS!
DO NOT HIT THE ENTER KEY WHEN YOU PASTE A NUMBER. IT DESTROYS THE CODE!

When I copy a long number, I paste the number into a text editor like Notepad. I delete all the line breaks that separate my number into rows. Otherwise, I am only copying the first row of digits when I paste the number into the encrypter or decrypter applets; and the secret code will remain secret forever... Amen.

In addition to these two numbers, think of a problem you have been trying to solve. Ask a question in plain English that you need the answer to. This question may concern any problem in the course that you have not solved, or any problem later that you have trouble with. Ask the question in such a way that the responder can encode a short answer—less than 5 words should be safe. If you ask more than one question, I will delete all but your last one.

ASSIGNMENT 2: THE HELPER

For 4 points: Answer any seeker's question. You may help someone who has already been helped. Use the Code Converter applet to write your answer in the Original Text message box. Make it brief. Hilite and copy the DECIMAL conversion of your message into the Code Encrypter's Decimal Message box. [Double-clicking hilites all.] Hilite and copy the seeker's number e into the Encoding Exponent e box. Hilite and copy the seeker's number n into the Big Number pxq = n box. Press [ENTER]. If your encrypted answer does not fit in the Decimal Encryption box without scrolling, shorten it! Hilite, copy, and post this long decimal Encrypted Message as a comment on the wiki. Tell us whose question you are answering.

Note: It would be a good idea, before you send it, to test the brevity of your answer in the Key Generator applet using randomly generated keys. Paste your answer into the Decimal Message box, and click the ENCRYPT button. Then click the DECRYPT button. If you get back the same digits you encrypted, assume your answer is short enough. Do NOT send this test to the seeker! If the decryption fails to reproduce the original message, shorten your answer back in the Code Converter Applet.

ASSIGNMENT 3: THE ANSWER

Use the Code Decrypter applet to decode your answer. Hilite and copy the helper's secret message into the Code Decrypter's Encrypted Message box. Hilite and copy the number d you saved somewhere into the Decoding Exponent d box. Hilite and copy the number n you saved somewhere into the Big Number n box. Press [ENTER]. Hilite, copy, and save the long decimal Encrypted Message as a comment on the wiki. Use the ASCII tables to convert the Decrypted Message into letters. Remember: 32 is a blank space, 65 is 'A', three digit numbers beginning with 1 are lowercase letters.

Hopefully, You will receive some points when you send me the answer you were helped on. You may receive answers from more than one helper. You need only send one of them.
DO NOT POST YOUR DECRYPTED ANSWER ON THE WIKI!!!

Click here for a RSA Video Demo.

Comments:

From wHolt - 12/14/06 11:40 AM

7Iron - someone probably put a line break in their code. That would garble it.

From 7Iron - 12/13/06 5:20 PM

Answer to Fro's question:

67549491902270713287812095399742052852530847771637652292545252004341819127251744001957085939704044778299072341003671685655065431229193241129582420063427351448962400948337227176471971680629032550720592779553155734127706280973974339607528130617660403819882734083496120172578611873231682851043528889365326758070

Sunshines answer to my question:

67908414319433583310465485881315751644315278778759223204112757584936416071478131319273545186293553119077517081603210441367699798398143325559261468147284777166452048525261209766500669322704167421971788157707640438144926268905781401220992295921710407896472246715515352049922703377145987032760835316720061401337 

Mr Holt/Sunshine - I am only getting garbled text to my answer. Can you verify that this is correct?

From wHolt - 12/1/06 5:41 PM

Draco - try this:

79798548787410236883147012763047002034001524254115416365443845716614346426974787853954967620247580587641340302170629262841703646921183757859910757534470028287972238214931858280627714431341466070384166932471248427633708018753988733068290193402368122922922050693302262469818417174990872366531110222672409779598

From Cheana - 12/1/06 5:19 PM

Answer to Sunshine's qt. If the Looloolos wish to double their vocabulary, what would their maximum word length need to be?

102649008812267555144633927140316124119543687514246224144110140820151938694829647197155107240634852986692180918880303542348670406505116946325350794990684683232834750389001867189700052321306553077312822552589627368750460964287062611806464393579095072597212550078919985273819211462017564378447197798627821417778

From Cheana - 12/1/06 5:09 PM

e= 6502396223244618342318019014641078418103840213657072668505731463

n=

105115112266320548500856207109394723117455590331280000288602970247345573147150496498665771931852293202957386835896157550574650396563135976890084800167588231060706281316245360455159260658915897705230629733407166287951781216893614400154972088656403958542083948707959429278150243772061132327528160606034017660537

Which one of the 3 ladies likes to lie?

From Fro - 11/8/06 7:02 PM

e: 4680814999049346741517365587777894113952198209417756875860595523
n: 127597006895577780486329740297439215235444005124837273649235885001683204216906853894332562377873149772854676292376711499558188613404591191399240269698908180919977645212193427504235425639149974130313996980264132660293331829579234534127626114328221579663159236875215409720953307076916404967372130294498969589459

How many words are in the Looloolo dictionary?  

 For Kathi:

33542869867303277517474329462058762016595059477695415301349933105657851456558012606064163031907801636674225792773310330758697751722857356289836389036352593848261828579720493640813727393250874197224553593925668107989083157646410757933313221611756804100942977805722075599225607267231128584863510096365560125174

 

From Butterfly - 11/7/06 12:56 PM

e=

4213745544480594278716020983184828933938097428827429457861575333

n=

87804213957004053770014664444686498318653796740974835361485820467276867893057746418416064499495947815095936368213113509599476129287987356011504544407105678234493984329127633474793381927648355971901808002094525974337539758850749028775858989993001887089450450595944501637420442996697014200141916475869608016539

Can 8 blocks be used in Carry In?

From Zonino - 11/5/06 9:51 PM

e=4220900087194511989188627452029229910200209184105730806595597083

n=64884513325217094934527074773221977747343020445119807709974167304220170043255674371699556487566421563178372192070498020796134416647618599352029276396225656525644260147838482850118441792751952923387247011755981072293645300084012748007299691880463863096861182700929956124705311898697241603791133816403288351847

What previous problem does the 16 tables problem relate to?

Lexiowen's answer:

5606624969679544240590122363489680391765234196344716061615763270328421404422132912644006160189083449876143713408339669664258123622186990375301844063279460939574909638434037387374595498979401808306178618051508362072143472616121738935321076101808425310212014552888579583256304273069435573412584303023984355767

From Pac - 11/5/06 9:11 PM

I posted everything but my question...

Q: How do you Carry In with only eight boxes?

From CenterField - 11/5/06 8:21 PM

e:3933941297731017172024112252520913839185170842511227853674875939 

n:95462704977042107120146183443898368648552978597019047373522389036927066762129265682228954379356109531274633603410210411523817158900065988705657391376645498437176818349558433940946435073219729244729158098169663473740240246428013841768844424817657022573171132758773087097541575806430933574686980409425657783307

My question: What secret message did little LooLooLoo send to her pen pal? (#7)

From Lexiowen - 11/5/06 8:15 PM

 

e=4640687931182966555711212523934693725203853078529570834921045613

n=79539954756418422723463771447738165732844954657641536242519030529945608853091553011790362234740432943473594279888015717449196498683984684739910101731100912801638460529379676211989870595211909938312870736639272874774000139971434010022626232379046609907603839199128468372598139701399807443643964833455853277799

Question: Who shaves the barber?

Slicks answer:73243596314922413072442012292380746277549955702611653172703697044582217889883157761171646656772253890632632950358521915643210643233346587012900652276056943577931676406411097544621995309640517799998969255958524754649950922479882136753184500323323097789912803018010800603203267638199998998452970269497184003748

From Bubba - 11/5/06 7:08 PM

e=

6567746079512740883732828016722509783785833859738120577537925903

N=

79608387032758341029643271682804770213229033587899294795147010697274336623273334624246217472804625648924298258336319713186459494695175509462755160959980719419226762724886664270121004557165715735376978693624720708421748104186671587768275483230358994269357038261320124296196096890280651313046415241759782743163

From Tiger - 11/5/06 4:30 PM

The answer to catseyes question.

2258499785293370077477320757540727727058722032933835586855146535186641942404766968628024676235020974494138420457450850645420050048489515998220436965181095901041330630287620715703124104892213071096578054946590605285714896345960550494480061077031416938272161424501473924042516141161943755536967625491314817354

From Tiger - 11/5/06 4:07 PM

e=6010094494273418422354356799572495164475033805463436035590250791
n=104547090594855806872295729679345221356594754317408398964944348405521276796353594751473070650984930045833449350439579152236873551879358845267881825381169346927758021810302868143752495468156540099776595155207492982708425934749789865935717467789532764358075235148845200344596074929260336399497736024092651734603

What is the rule for one-stroke doodles?

From Bravo - 11/5/06 3:25 PM

Question:  What is the formula for the staircases?

Answer to Slick's question:

73243596314922413072442012292380746277549955702611653172703697044582217889883157761171646656772253890632632950358521915643210643233346587012900652276056943577931676406411097544621995309640517799998969255958524754649950922479882136753184500323323097789912803018010800603203267638199998998452970269497184003748

e: 4302004909635355564153007437354576252703033245641539936312613307

n:  125084206019495493525458317053221305611308316290376681326659874655091838079286635679862730589479612569586364373312730936153340409885721333459502134287083744902860027203640286825409392793129210216195626820399467748682552752624305292431988595098974087725298521900497515241825041677826331948562889352046427456803

From wHolt - 11/5/06 1:49 PM

GolfGirl and Bravo - you need to ask a question. You might find out something.
Edit your comments.

From Draco - 11/5/06 1:33 PM

e=

34522074514259210723028765843600328468955509984733177415087428409237670434870261004660847610475233936021074992203469394964620727582236787169651021594901437449352610097549764754500077317567299787830325578655257545070880027758779847626434433719639107992897781448342135227697455477856212250691168384788197317497

n=

84340883923677142359306808134657459373205992156288611540343722420497363917591096980501016576643022108818511987864078253136041896779316024756199862329943925671546786727095970684067891931167991708359630758443283248914889240510748166214498337173791621219936110258934165366048954150125546810441861011947584501883

What is the difference between one-stroke returnable doodles and multistroke doodles?

Answer for CatsEyes:

22763257555291023269316673912513604932353809646232617819815204150479891438560125006691152676608123941292889116721241660188793500780143015180541220136105447650293622261855884109658202895079942647805385622284140247671090884227731603793165150395743692636988813181172685791569292811309417120566396314984185571092

 

From CatsEyes - 11/5/06 10:46 AM

3772060100011473939477130218634902623053484898403579519577305771

n 157288088799246074688991380176547336273684161385936670352816606501807618073729890962457450789566476200545792275336132050138862724645009416239650601466885699558378385045918104525627365567955049294899407189090391884993366377568963519812362498740309249442556120185045396194351588357233245726755977695885226280221

Question: How does the Barber get shaved?

From David - 11/4/06 3:54 PM

LaughingThanks BassLady, Trixie, and SuperDuke for the help.

From GolfGirl - 11/4/06 1:46 PM

E=5757654170531420357112162258268937930186344297384598426304088547

 

N=78322095667990564692370072118017002961786453480134520248210849021848956504551547590545780332429403469390438495036069867877755472080017582566408417164700448310805220519616513216585158803534740163071113768692806574678257654659825539976902419518383331308972024467824938930660827389142782212841299951056607592737

From SuperDuke - 11/4/06 10:32 AM

David wants to know "Who shaved the Barber?"

6811668490101842511452003754164662695982166765093979361091981574577251081221039629155774708182280124439400584779759121547015375795084537810049125097014775692698293109258219317711839187836569387991782164941415561948856489459819514639565201410715348723393854866848319136735562784222955822831214463285157100269191517991844462615350116531599440657681898238455211064982503539067529616458265486940652876968198729436071456940027418319968262567736101

From Trixie - 11/4/06 12:29 AM

E: 5870807307658540357627553148150119078103081820782106417314326587

N: 84680665349299509352137977818658707595279713750495849559061008067612422335831097839724143963362581235402076058088156422242059422396521022362314241090922603567468458366558409010018218372698839914477659410632996033107590600501324235977139483180473889245717993723736180519174851242894506015046168176419302714263

Question: If the Looloolos wish to join the 21st century, how long with they need to make their longest word (#3)?

David's answer is: 56403267068572341110824852950415095282365391380062198852123152320020085522559352237592531611383916784064842924223907561522497782000522400164668135884854247836652070079125829435092109249287691843166957766869190373068497461374648013888541396082223840385110418651125621274104876920971248514748357418530405380797

From JooJoo - 11/4/06 12:23 AM

 

e: 4483061685884178324410885577233780060567092376143821022039877551

n:79548751791799387293273652759099494246320036295014645589278364307100335016286538634265534440537126753940134039068003509851360515645035188616286356236927794092167758224058865880686177532889004428831896662533782451259365066595519322631830480889653345030156982598808341322011880575886688208879805554719898613329

 What is the expression for the CAB with the AND OR NOT symbols for Carry in?

The answer to SuperDuke question How many tables can be made with 3 inputs? is:

8158108905067901041612928699766754711389046459974851051528540981067069322136808839120218942295719004978252010260280457697648512919671049727940265108350155771210832639745242259705460663617015997893061660644724162259027710194496811842325962643819998335445287001364473056045861286802629536475632266926251926399

From BassLady - 11/3/06 7:48 PM

Here you go David.  I hope I did this right. 

23818509323875731175707278492128421311158930581896560253030056330028496503379547233746599166057597805894800158895573942852602129730260038901471187825779505382124996779469220292434010382699712858696528410393664881901371587055753682446807246604914185233745275621341598375536403126148871371847704779846396842103

From BassLady - 11/3/06 7:39 PM

E

4165930900119629467244692024476497844282585004973262215883235889

N

91719539378643938089200192366311940952106722601247466939464464342356578296723791678956971683409919519076720464015734145623981410619486618420852852001663572095682001049536405093699894222241051596388750971174246374445742720314198809960846160648360823901702794813421101612014729792944640278589782525373815388509

 

From wHolt - 11/3/06 11:36 AM

When answering a question, be sure to use the seeker's e and n ,
and not your own.

Also be sure to ask a question.

From David - 11/3/06 8:20 AM

Here you go sunshine.
63253842524972858926314273853738015648402690276095632082730037359417211167792718870603584835373162238229426407429596877061555563971496404050895363863823904221876310806924349811878784745527480673692656947246141767641919783825504311120596713095559624497045518922835498598957008242905092836687240557135998732595

From David - 11/3/06 8:05 AM

e=3491522705890437208276869116487390736916229037340373335636621881
n=75986589493922385983956822578106426152925572287331013891080019172492490714565592932045455297128009977313369810790888029061960663732340546187275873619565322788579151339169532600432862035123915108184407172681085970240695002590464234914982612201015701075989188082227231922549432808188424938003941875649553840377
Who shaved the barber?

From DirtyBird - 11/2/06 5:32 PM

E

5313911723982962999969650214882759683237513229164740365643432361

N

68500579638286226898782838503665231389240496692899324237677994792892289413523208428385959499335164930189515435575828178909105855057636162156793001184253544575879087340875397448113844519818854859813726511250641359473186869265546799564684722057765646687918595269839801261156246433673751357893120934803079887989

How do you design a system of blocks and pipes that implement the XOR truth table?

Answer to Slick's Question:

47342244470396186533900338375009847516764573837253042020130586145236451468731301087633819511350928750249361632709499396695832808003287053399043202161905683259812148095464920039332328344024081224207714333350650854711809063554879104661524039719582146686383845640910201602014343033668912582549554962722725857379

From Pac - 11/2/06 1:52 PM

e = 5033165692532640090837226362652797024776541729683934288568085527

n = 106188709309757311282340894284472610866667148957608252403488062950022431007816199180580475745007239449309381646929665707129837837575167094878388067695632038109175430867143039794510098566318404529923532619100521660551151951348701837360535996644704348923431109605449869747290400374927268004121542654180572022507

Answer to Pod's question:

2741465075366817492166272660836792112491432081597050151755082210929529883962832760007197723301031156906623043041548203473016651329326465604528376787165354299333195285641720911464976776196394566127805194648984252421056539775541739656344854946713525075722243084393998764915499004467455800461651793468760656593

From Pod - 11/1/06 10:24 PM

e = 5649056438208781837510492013105938229460950422875866412578114041

n = 80164391300952234629360343791566710616348926512529463257073839716608371001988767722313724206023164258516479943092910124918473235988925757930525187901260029462654953366969457074178702314295730492346126215654279431925365614329314498831177046593269965915870637621080793219673440009122518750499315968436112928737

Q:  How many 7 letter words can you make out of lololoo?

Answer to Poovey's question:

3557032739882729378629269270929820634572856884739944052483915800673324548066665529402883293494843045844659208846795983861402438070337907818843883647898360811305677962565223315715956296987971022572279758674616813331139186664902345602364426428228723713751547048912853215709915910794045134430754957470863817152

 

From Poovey - 11/1/06 7:58 PM

7Iron encrypted answer:

2969857174862675723378044437912355501043930159767086007081152479158677652684694950460829430266659924080288895129393920938296064602314659529707023216320595672401729433081834403223585843428015342712327467073443466279279145778487328865392504881448171205369012062913133292084247167187790821671963919453387163905469639284957999138816402815358598614193514849422052568665837051740221368309619567093114869682841633580835706458912299061913012351319623638152649238488554891593392238125298459948930372256302405924923482548323821977627435907298063819520254482561645865128234873690578273398836864320290612490735685397787552842591

From Poovey - 11/1/06 5:38 PM

E=

4640328069949959400864008804266606409632593877498722974416735873

N=

47723164684899790624650520091484722397486055637495933285767037041743700135116995976076372842439576475132989556230345292220230350914458328903840164280937968960930578763962166136498066818951868298364036451405481693326651829737375525975489727216688258129825229507688338796708816802176021223660982451897375341483

How many words are in the Looloolo dictionary?

 

Slicks answer:

47342244470396186533900338375009847516764573837253042020130586145236451468731301087633819511350928750249361632709499396695832808003287053399043202161905683259812148095464920039332328344024081224207714333350650854711809063554879104661524039719582146686383845640910201602014343033668912582549554962722725857379

From Melewen - 11/1/06 4:49 PM

Encoding exponent e =
4230020881375949523028266925998246222346595673385511263117541719
Big number pxq=n =
133658108453070279369938901900714683268232283647630589019085266643631858565060528210970235704378160538005453039423911354729705506555051636058687546740409798730592675377733646393888995660373490611473182076481546783719961519980233477288380728167296686838558334587227411761006160181849993353919609061034938289403
Question: What's the difference between one-stroke returnable doodles
and multistroke doodles?
Answer to Harkar's question =
87844864038567795231316752315703977355962554720622442530377876500429917584412488848903088647875595352296958979923811430543907876389494164101030358748990103647110558999221212054597876611014696593545013622994159162101977532390705687840716247826102770405330701642286315632083762497286689128166016556702823238696

From Harkar - 11/1/06 3:57 PM

SuperDuke's encrypted:

27027068260380219795638750746540871139967554269315067210116945764512569456134674725968652834316336814172893365798653517874754345947845671705238532129828958329185006725661444748038943893600387239553263700244952253799339650887740872418830488104607886294883321972626256644685652206981522630259338334665345367429

From Sunshine - 11/1/06 12:58 PM

7irons encrypted :

 

464650917636156856383324016199774259695280912068302875352049760302401917291994690389570555344709840123611215560817927407449113865566339777484110207805777208300607653503137966458362251369612982506995249921992324836924329573156810520201614566332334702506448407192442476133820639581155295790867836125922905793489313009661630650874647322824994318759040888391589473645494767563851916294857244556159763986176651267348302703466259972498382562352046296124031955678425733147205294136279391575458959601273504995554858237173517007035216328995533691094915479906870522372622181201996201894194030839840154360109316095048428908291

From Sunshine - 11/1/06 12:46 PM

e - 4599777242468846708407200938946529921821704897087518717429223281

n - 113254714551566589729842245452889554584241229007386304984194006364162836828269103726757268191124947226442650237621883853946845587100577469327826152403773507066566624506522353384107475830589288035710368560209463521268453940347252845057958864757194591754419273671450908940861670250317992128511080170393485542049

If the Looloolos wish to double their vocabulary, what would their maximum word length need to be?

 

From SuperDuke - 10/31/06 2:19 PM

E: 5277616642970337282946941623385825430622609095798664881540526149

N: 90374140738276723393535540096516084280343981885430053821068917615352136235441820973662235177210968597980774474741740804847492093558828249325821494290260229207307760175271316291176188773207507187680842435845803228326720259962670024900027280372263450233097091551868445020172151462792111264254469854510897007079

How many tables can be made with 3 inputs?

From Kathi - 10/30/06 5:41 AM

Slicks question:

73243596314922413072442012292380746277549955702611653172703697044582217889883157761171646656772253890632632950358521915643210643233346587012900652276056943577931676406411097544621995309640517799998969255958524754649950922479882136753184500323323097789912803018010800603203267638199998998452970269497184003748

question: what is the formula for the blocks?

From Houdini - 10/29/06 2:36 PM

Answer to Slick's Question:

77026726836042229187406296548070440799215169457066233593197451648558954216149795268320252234941974800381534439880785024709058540038257986467313952808715591882003037538154477248555753815552900880723738332455597525778048709279813801404596476493842100363001462569887793581606811127900924346408454212915096388245

From Houdini - 10/29/06 2:27 PM

e:4747255684661646856456329902106159329881324634742660375956449657

n:104503436239030423946140824520639023184515061302656566356873296248206153192247672384072648825512229680998960065484311812118005446084333350205298592265100130116140869899559933791740288850726109841374862553374933861137325562642881125883562269526446435595628493177853491309881413746941969208178170634561855176687

What is the color of the X on my forehead?

From 7Iron - 10/26/06 7:38 PM

E =
6529268125965473190878324673131050734705504179818563541469201111
N = 12813749604594963091625328295386150928311642755283982655623215205190131007960486088167740835822212186460565181827613146687564278180211120336569545747923886202707224071991373362600910852909687679128366665713503574513616913612658352181859591814475445527132475383916302550485696683537765455808795323747149851161328137496045949630916253282953861509283116427552839826556232152051901310079604860881677408358222121864605651818276131466875642781802111203365695457479238862027072240719913733626009108529096876791283666657135035745136169136126583521818595918144754455271324753839163025504856966835377654558087953237471498511613

What is Little LooLooLo's secret message?

From Slick - 10/26/06 9:14 AM

 

Question: Puzzles #5 What was the name of the third child?

E=6133586942096471247117222738042799537003646866848977879206222511

N=81963547183201557680017931251678228920181140976598226327193468278463788321262208667718935892450676423919607428495038002528266325330201001642468430341415480058452903016996535046885944884392197095936559035785480036261732358323860334048756414312167448200592884268324356771004714972885128563181341853828032552843

From Boki - 10/25/06 8:32 AM

ASSIGNMENT 1:

E=5816457464923499772236705777591392077457056820955422382125580119

N=83178542712848183985234689844908376637673055544310889172128153505788988539319845170077116564708634841206688522039658821215405258216300410141985452056981836109717255069357904932491222010992374229221965050558443442865776147762646858556580097594902055265199218535151275515313645748188457583405135880608099176839

 ASSIGNMENT 2:

 

Answer to the Harkar’s question:

 

Encrypted Message:

99663455306053280595912815606624256098812974470673408670369165773312946754443982230260241093738597050239118177611468344057985875662893645380932883341714535376751548241754507952919703374214213225091758339276910798475745591220501192328604354618024570087854437691239170298983618740329270948241336390825241216025

From wHolt - 10/25/06 12:27 AM

Everyone notice how Harkar and Kathi entered their number n on one long line.
Make sure that you do not break the numbers up into lines!

Boki - Harkar may not be able to decode your answer because it looks like the lines are broken.
That means invisible carriage returns are embedded and will mess up the decryption.
This also goes for those tryng to help you by using your long number.
Better re-enter your numbers each on only one line like this:

N=83178542712848183985234689844908376637673055544310889172128153505788988539319845170077116564708634841206688522039658821215405258216300410141985452056981836109717255069357904932491222010992374229221965050558443442865776147762646858556580097594902055265199218535151275515313645748188457583405135880608099176839

From Kathi - 10/23/06 12:29 AM

e: 3703654801825882823749304349439678770800089980999648159406294793
n: 74261323470593266918697222914832903316467014095188986925697926464020389558154879668344310799429628309334352573343181387782155863013111435347140711530051977490094812922369077139352278514744311211709913903760658347658430046356651363580767622523701281694091445230673896818999038586500991870553180924406169691689

 

From Harkar - 10/22/06 6:31 PM

E= 5500710656044848514043629078187132213060980597859379921826805599

N= 124038666746029160369048711442909190091970882257479345023323753327803861975124967681318077731675071092745692852037485135244413204310552343102983705676114331609713663896097315530745609817602651646559444244606751425890765506881064151131518176052814337411626194826932100997874803106528813421960112978521430737819

Question: How many words are in the Looloolo dictionary?



Last Modified 11/8/06 10:39 AM

Hide Tools