Darshak Parrot - Revision history

Phroon: Added second message

2008-02-17T04:52:46Z

Added second message

Phroon: Plaintext is one word.

2008-01-08T20:50:18Z

Plaintext is one word.

Phroon at 06:03, 8 January 2008

2008-01-08T06:03:25Z

Phroon: Beggining Parrot cipher information, though process.

2008-01-08T04:00:13Z

Beggining Parrot cipher information, though process.

New page

==Ciphertext==

<pre>
ns fc ao ge wl sk fy fq kp ky ow on hy hr os ro vm uk we oe
wd lr bc vo go cq xs xs mo rc mr ov bt kt al hb wn es ko mr
et ow on ii dk ys hg kv tb gc me gs ks rm fo se xd ec ea rm
ox ae tg bh ov ca tb cb nt pe sa fe sk fy yv hf kr ng ns fc
ao kq hb pa bt el pg fy sm rs ek dv ha ao sr pf fn es ko os
hd yg ec vk eg mt md qe fr or gs ep ft ro ev bc rc rs ca lz
dt or pm tb fe ao sr pf oe tr se no wf hy wf rs ca wf rs to
wo no me sr qe on nw ok se vt qe fe es rk sa xd ec hy ao sr
ke xs nx cq nk rc nk ra kc wt me co vs qb wf eo rs rc vr ha
sr rw zf ca fq wp wp ce rc rs sk sh ow fw hg qe ok tx fw tm
rm sk lr ow tv fq tb gc pw lr tw ce ar ov eo me gc me gx sx
yf qy tw ok tx fw wp ex rk ao se lk ng rk ox bc or ea ep fs
or gh bt qe cr kn sl go bc gc pm ep fo pe xy ac tg of fq kc
pr ea zk cb ep ep wp fr kx om go om gn hf or ea or so tn ym
sk fy yv ek rm wp ce ef ht cb at eo ym fc wt do pe un kr fo
ec ht cb at eo ec ft ge wl hy le ow on ht zo or so ec to wo
qp ex bq xg os hg ym kr wk ec rt ca fe bh mn ep ao fe rx es
cy pf ep wp fr ht zo or so ng ns fc ao ns tp gh or zr fw ht
cb at ka rf ea rm ox es ec wt er rc mn pf ge he cf qe fw ea
eg xs mo ex pq gb en hb ca yw qk bc qh fw ng No pw mW fw tm
nk ho qp
</pre>

==Plain Text==

<pre>
pr ie st fo un do bi in ol dk ex ep di sa sx se mb ld nr et
ur nd it xt os hi px px pt he na tx ta ck dm ai nf or ce na
tk ex ep gg ud gd si tu at io nt ox od an ge ro us to tr an
sp rt ob ia tx th at ti me no rd er do bi bu ri ed pf pr ie
st cl ai ms ta kn go bi ap ar tc au sd st ra ng ef or ce sx
sh if to ut of ba la nc ew es ox on be se tw it he ar th qu
ak es nl at er st ra ng et ea ro pe ne di ne ar th ne ar ke
xe pe nt ra nc ep fn ec ro ma nc er or de rd us to di st ra
ct px pw hi le he le ad co ve nt oe xa mi ne te ar he wa sd
ra wn wi th in xn xn ot he ar do rs ex en si nc ec ov en ab
an do nd ex am in at io nx nd ev ot da tx te nt io nt op xp
ib li ev ec ov en xn ow de st ro yd pf de sp it es tr on gr
es is ta nc eh el dp os it io nl on ge no ug ht ob eg in co
ns tr uc ti on on xn ew ou tp os tp fp ri es tr es xs em bl
do bi bu tc an xn ot re ac ti va te bl ie ve sk no wl ed ge
to ac ti va te to be fo un di nk ex ep ac xc es xs to ke xe
pn ow im po sx si bl ed ue to ae th er ia lm on st er sw or
ki ng on xn ew ac xc es xs pf pr ie st pr om is es wh en ac
ti va td we tr an sp or to ve rw he lm ng fo rc ei nc en tr
of px pt ow np fy rf ai th fu lc it iz en pf Pe nx nV en ab
le sc pn
</pre>

==Thought Process==

This is a rather normal [http://en.wikipedia.org/wiki/Playfair_cipher Playfair cipher]; as there is no <tt>j</tt>, only one repeat <tt>ii</tt> which logically maps to a <tt>j</tt>. Cryptanalysis was preformed by looking at a [http://www.characterfrequencyanalyzer.com/ character statistical distribution] and a [http://scottbryce.com/cryptograms/index.htm digraph statistical distribution] (The Cryptogram solver presents digraphs and trigraphs).

The difficulty arrises in recovering the relatively long key: <tt>darshaktheocracy</tt>. This is accomplished by guessing repeating words in the plain text; priest, keep, force, order(d), coven, examin(e), found, ect. Various Playfair solvers may also be able to recover this key.

[[Category:Cryptography]]

← Older revision		Revision as of 04:52, 17 February 2008
Line 57:		Line 57:
	The difficulty arrises in recovering the relatively long key: <tt>darshaktheocracy</tt>. This is accomplished by guessing repeating words in the plain text; priest, keep, force, order(d), coven, examin(e), found, ect. Various Playfair solvers may also be able to recover this key.		The difficulty arrises in recovering the relatively long key: <tt>darshaktheocracy</tt>. This is accomplished by guessing repeating words in the plain text; priest, keep, force, order(d), coven, examin(e), found, ect. Various Playfair solvers may also be able to recover this key.

		+	==Second Message==
		+
		+	===Ciphertext===
		+	<pre>
		+	vn yl re nv dn gp vt yq rc ba gk ub vo dz rc le ag nw ne nu ep ze zr te sw gw zo gn ub tq en tm fr ao ql mz cz dq tv eh ao np mv iu mi vk qk mp sd kr ky nv bm En sn vA nv pd gl cd ev
		+	</pre>
		+	===Plaintext===
		+	<pre>
		+	ne wc ov en sa fe ar xr iv dp fi mp er at iv ew ek ex ep px pa wa yt oa lx lo wt he mp ro pe rt im et os tu dy st ra ng et ea rp fy rf ai th fu lc it iz en pf Pe nx nV en ab le sc pn
		+	</pre>
		+	===Key===
		+	<tt>pennvenables</tt>
	[[Category:Cryptography]] [[Category:Quest Solutions]]		[[Category:Cryptography]] [[Category:Quest Solutions]]

@@ Line 25: / Line 25: @@
 </pre>
-==Plain Text==
+==Plaintext==
 <pre>

← Older revision		Revision as of 06:03, 8 January 2008
Line 57:		Line 57:
	The difficulty arrises in recovering the relatively long key: <tt>darshaktheocracy</tt>. This is accomplished by guessing repeating words in the plain text; priest, keep, force, order(d), coven, examin(e), found, ect. Various Playfair solvers may also be able to recover this key.		The difficulty arrises in recovering the relatively long key: <tt>darshaktheocracy</tt>. This is accomplished by guessing repeating words in the plain text; priest, keep, force, order(d), coven, examin(e), found, ect. Various Playfair solvers may also be able to recover this key.

−	[[Category:Cryptography]]	+	[[Category:Cryptography]] [[Category:Quest Solutions]]