Uncode(1) Another Form of Fun!
TinyWanda
UnCode One is the First generation of a Encryption scheme that Encrypts a
String in such a way so that it appears to be in code; but in fact--is
not.
The Value of such a method is so obvious that i wouldn't dare shrink to
expounding on it's industrial uses & global applications...!!!
To operate the program: simply install a "string" of PlainText on 1: and
hit UnC.1.
It may be considerably easier type or extract some document from your
computer and load it into the 48 for encryption, and then transfer the
seemingly encoded document back to your computer.
To do this; place String Delimiters at the very "beginning and very end"
of the Document to be transferred, then attach an official looking HP
header thinger at the very very beginning of the document:
i.e., ( or is it e.g., (???))
%%HP: T(0)A(D)F(.);
If you're using a Macintosh with 256 possible characters, be sure and use
TransferCode (0) with the 48 so that meta128 characters are returned to
the Mac intact.
This is a sample of an UnCoded(1) Document:
---------------------------
%%HP: T(0)A(D)F(.);
"z9i?i67 ylloH
99?+ ylloH 6 9vol z9i?i6? ,HO
?oo? 6 z9>6m 9g6ilo? 9HT
,z9lgniHz yb?u+z ?o
n99?g zy6wl6
.?oo?q?9H+69w bn6 w9n bn6
z9i>z ?9+niw ?9bnu n9v9 bnA
+Hgi?d oz n?ud z9i??9d 9H+
9>il >ool y9H+
,zqm6l y?i6? 9l++il
.+Hgil nozmi?) ?o zdlud H+iw
y6?qz ylloH 6 9vol z9i?i6? ,HO
,9v69l o+ ?6? yd H)um oo+
+i wollo? bn6 qu y9H+ oz bn6
.9v3 z6m+zi?H) no ,z?oobni
9zuoH H)69 yHw zi +6H+ bnA
b9zz9ld zi
,n99z 9?6 zgi?qz ylloH 9?9Hw
z9i?i6? 9H+ 9zu6)9d
9?9H+ 9?6 lli+z
.n99?g bn6 b9? 9H+ H+69n9d
?9Hzi7 n99liA"
---------------------------
if you need assistance in decrypting UnCoded(1) Documents, just send me a
fun, dreadful, epic, brawdy or educational poem, and i'll tell you how to
read them.
-[ Tiny...@aol.com ]-
UnC.1
Checksum: #A26Ah
Size: 762.5
INPUT:
1: "String"
%%HP: T(3)A(D)F(.);
\<< DUP SIZE { } 0 0 @ by Wanda Louise Campbell
13 CHR 10 CHR + \-> $
\162 \GW \GD z \|v
\<< CLLCD "" 1 \162
FOR \Ga \162 \Ga - 2
DISP $ \Ga \Ga SUB NUM
\-> \pi
\<<
CASE \pi 32
==
THEN " "
SWAP + 'z' 1 STO+ z
'\GD' STO
END \pi 126
>
THEN \pi
CHR SWAP + 'z' 1
STO+
END \pi 32
>
THEN
C$ 95
!"#$%&')(*+,-.\\01SEP2d<8P:;>=<f@Ad)G37DHI(>lMNOqQ9ZTUVWXYS]/[^_\1806d)b9?
gHit>lmnoqp?z+uvwxys}|{~
\pi 31 - DUP SUB SWAP
+ 'z' 1 STO+
END
END z 61 ==
\pi 10 == OR
\<< \pi 10 == \pi
32 == OR
\<< '\GW'
STO+ 0 'z' STO ""
\>>
\<< z \GD -
DUP2 2 + z SUB '\GW'
STO+ 1 SWAP SUB DUP
SIZE 'z' STO
\>> IFTE 0
'\GD' STO
\>> IFT
\>>
NEXT \GW + ""
OVER SIZE 1
FOR \Gb OVER \Gb
GET \|v + + \Gb 4 DISP
-1
STEP SWAP DROP
\>>
\>>
--
.........................
What if there were No Hypothetical Questions?