08-18-2005, 05:57 AM
Quote:.......
Post source here, easier to see, and gives ideas to others, which keeps it interessting.
Ok, Z!re, here's a short but pretty powerful algorithm by Ethan Winer.
Code:
rem X$ is the string to be encrypted/decrypted.
rem Password$ is the password.
L=len(Password$)
for X = 1 to len(X$)
Pass = asc(mid$(Password$, (X mod L) - L * ((X mod L) = 0), 1))
mid$(X$,X,1) = chr$(asc(mid$(X$,X,1)) xor Pass)
next X
PS: I have used the assembly language version of the above
using a call to the Quickpak Professional library in several of
my programs, and it works fine.
*****