this is how it works.

if we have an encrypted message like:

aettea lnotev a teers bark.

you would decode something like this:

words pulled out must use each letter only once and all the letters must make a word, no leftovers.

aettea lnotev a teers bark.

tea lnotev a teers bark. eat

lnotev a teers bark. eat tea

not teer bark. eat tea leaves

teer bark. eat tea leaves not

bark. eat tea leaves not tree

.eat tea leaves not tree bark

eat tea leaves not tree bark.

each letter is used only once and there are none leftover.

we can apply this to a few lines in the following Quintrain.

-27-
2012-09-14-02:26 UT
Pray another time, there is much to run in form.
Jepset trown in frohef, louve untre hiel.
Easy epstray unill thun so one.
prodigy venunbreadth pules zelhecktrovemt.
jesuten widdle hundred nemicso plorcent.


Easy epstray unill thun so one.

becomes

easy lie lure patsy on son hunt.


and


prodigy venunbreadth pules zelhecktrovemt.

becomes

testy public government lever dupe dzhokhar.


it's not easy as you might think.

we will leave the others to decode.


http://www.jadexcode.com/jehocifer.aspx