Encryption : Low end

Hi,


Newbie here..


For an alogorithm that laways returns a fixed length encrypted key and always the same result if the sample is callled multiple times (ie. encrypt abc returns the same result if called *0 times)..how easy is it to break such an alogorithm..also.any sample code for the same ?

There's a shit load of them. Most usually do what you want. Check out the the md4, md5, ntlm, checksums, lanman, sha, etc. In between these there are like 50 different algorithms. Each one has different versions.