Encrypting Passwords in ASP

tommy skaue

Rate me:

4.40/5 (4 votes)

19 Jan 20021 min read

231.7K

A simple function to encrypt your users passwords

Introduction

Do you have a website where users need to login, and when they do you compare the password they enter with a column in a usertable? Some people do logins like this. It's easy to program and it works just fine. But what if someone got hold of the usertable and all the passwords of everyone? You may want to hide or encrypt the passwords in the usertable. Many programming languages have functions to do this. I make ASP-webpages, and I haven't found any quick functions to do this. There are plenty of components to do this, some free of charge even. But what if you cant install components on the webserver

Here is a short and neat way to encrypt your users passwords. You need two strings for it to work. Typically the username and the password.

Code

VBScript

Function encrypt(x1, x2)
    s = ""
    t = 0
    For i = 1 to len(x1)
        t = t + asc(mid(x1,i,1))
    Next
    For i = 1 to len(x2)
        y = (t + asc(mid(x2,i,1)) * asc(mid(x2,((i+1) mod len(x2)+1),1))) mod 255
        s = s & chr(y)
    Next
    For i = (len(x2) + 1) to 10
        If t>598.8 Then t = 598.8
        y = t^3*i mod 255
        s = s & chr(y)
    Next
    encrypt = s
End Function

If you want to test this function you can create an asp-page and upload it to your website. Here's my codelisting to encrypt.asp

ASP

<%
Function encrypt(x1, x2)
    s = ""
    t = 0
    For i = 1 to len(x1)
        t = t + asc(mid(x1,i,1))
    Next
    For i = 1 to len(x2)
        y = (t + asc(mid(x2,i,1)) * asc(mid(x2,((i+1) mod len(x2)+1),1))) mod 255
        s = s & chr(y)
    Next
    For i = (len(x2) + 1) to 10
        If t>598.8 Then t = 598.8
        y = t^3*i mod 255
        s = s & chr(y)
    Next
    encrypt = s
End Function
%>

<html>
<head>
 <title>Encrypt</title>
</head>

<body>
<% If request.form("name") = "" Then %>
<form action="encrypt.asp" method="post">
<input type="text" name="name"><input type="text" name="pass">
<input type="submit">
</form>
<% Else  %>
<% response.write encrypt(request.form("name"),request.form("pass")) %>
<% End If %>
</body>
</html>

Remarks

The function is not reversible, so there is no way to take the result and reverse it into the password. You will need to recreate the password with a new one (some users seem to forget their passwords and always wants it retreieved)
This is not a high-level encryption, but its good enough to hide it from lame hackers (hehe).
The password is always sent from the user inputpage to the page encrypting it. Somewhere in between a hacker can fetch it. Secure zones (SSL) can remedy this.
Feel free to use the code to whatever you like. But if you alter it make a post in the thread related to this article so we all can share the fun.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

Written By

tommy skaue

Web Developer

Norway

Tommy live in Tromsø, a city far up north in Norway. He does programming and webdevelopment for a living.

Comments and Discussions

Overflow exception

Member 304391912-Jul-16 7:00

Member 3043919

12-Jul-16 7:00

Hi,

I'm facing an issue with this algorithm. It calculates the hash value for a string of 11 characters. But it throws an overflow exception for a string with more than 11 characters. This exception occurs for 'Y'. Please tell me how to fix it.
Thanks
Abhishek

Encrypt & Decrypt string [modified]

c2love14-Nov-07 16:14

c2love

14-Nov-07 16:14

When I use the function to encrypt "023 882 211" the result is "uYcQz0Pdr+y/T7GSP+2EavUFt7NhtbjO87Hgv81vBqU=" When I decrypt it back the result is "023 882 211".

Now I don't know how get the function back

Anybody can help me to write the function that can encrypt and decrypt this example

Thank you

C2love Network

-- modified at 7:46 Friday 16th November, 2007

Re: Encrypt & Decrypt string

tommy skaue14-Nov-07 21:43

tommy skaue

14-Nov-07 21:43

sorry mate... no decryption available, hence the articlename "Encrypting passwords..." Wink | ;-)

If I remember correctly, the code removes content from the output so in other words, reversing the process would be "impossible". Now, you may notice that I'm reluctant to say impossible, but I really don't think this script can be decrypted without guessing the missing content.

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

encrypt & decrypt password

red-apple11-Aug-07 0:04

red-apple

11-Aug-07 0:04

hi,
DO you know any way to encrypt & DECRYPT password?
thanks.

Re: encrypt & decrypt password

tommy skaue11-Aug-07 2:56

tommy skaue

11-Aug-07 2:56

Haven't seen any free encrypt & decrypt scripts for classic asp (yet). But I wouldn't be surprised if you found on if you google for it. Wink | ;-)

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

Re: encrypt & decrypt password

kenbhavin13-May-08 21:18

kenbhavin

13-May-08 21:18

i want to learn the whle proces of encrypt and decrypt password

Re: encrypt & decrypt password

kenbhavin13-May-08 21:16

kenbhavin

13-May-08 21:16

one small change

guildwyn24-Dec-06 11:17

guildwyn

24-Dec-06 11:17

As I'm writing the encrypted result out to a database enclosed in single quotes, I thought it would be best to exclude single quotes from the possible results of the algorithm. I did this with

if (chr(y) <> "'") then s = s & chr(y)

in two places.

How to decrypt??

ShunHung14-Jul-05 17:11

ShunHung

14-Jul-05 17:11

I can use this code,but I don't know how to decrypt...

Re: How to decrypt??

Christian Graus14-Jul-05 17:47

Christian Graus

14-Jul-05 17:47

To quote the article :

The function is not reversible, so there is no way to take the result and reverse it into the password. You will need to recreate the password with a new one (some users seem to forget their passwords and always wants it retreieved)

Christian Graus - Microsoft MVP - C++

modification of this code

Anonymous2-Sep-04 14:24

Anonymous

2-Sep-04 14:24

can any1 show me a modified version of this code where the encryption of the words are jus the next alphabetical character of the actual strings?

eg. website = xfctjuf

thanks

Re: modification of this code

tommy skaue2-Sep-04 21:13

tommy skaue

2-Sep-04 21:13

seriously? Eek! | :eek:

and I am pretty sure most people wont call that encryption (even some contridict the function in this article as an encryption-function).

But if thats what you need, just loop through the word/string and add 1 position in a chr()-function. In vb, something like this (untested code):

<br />
old_string = "website"<br />
for i = 0 to len(old_string)<br />
  new_String = new_String & Chr(Asc(Mid(old_string,i,1))+1)<br />
next<br />
<br />

or something (from the top of my head)

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

Re: modification of this code

kryzchek18-May-05 7:40

kryzchek

18-May-05 7:40

tommy skaue wrote:
old_string = "website"
for i = 0 to len(old_string)
new_String = new_String & Chr(Asc(Mid(old_string,i,1))+1)
next

That won't necessarily work to get the next alphabetic character though. It's not smart enough to wrap back around for "Z". Smile | :)

Re: modification of this code

tommy skaue18-May-05 10:30

tommy skaue

18-May-05 10:30

I guess things from "the top of my head" shouldnt be used in production-code Wink | ;)

I thought this article was so old and outdated that noone even would read it... I've stopped using this function years ago. MD5 and SHA works fine for me.

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

Same function ported to Perl

Scott Offen21-Nov-03 7:55

Scott Offen

21-Nov-03 7:55

Although I can't think of why I would use this in Perl, I decided on a whim to port it to Perl (as it is my programming language of choice and want to provide others with it as well). Most DB (and most particularly MySQL) provide encryption functions, and I would recommend using them over anything else, unless there are known issues with it.

As the Perl code is intended to produce the same result as the vbscript code, I had to make a few modifications. Namely, the modulus (%) function in Perl does not round up as it appears the vbscript mod function does, so I go have to go the long way to get the remainder (rounded up as needed). Secondly, Perl strings are 0 indexed, so I had to do some tweaking there to get the letters in the same order as the vbscript. Again, all this is because the desire is to produce the same result as the vbscript.

Anyway, without further ado, the Perl script:

sub encrypt {

my $input1 = shift;
my $input2 = shift;

my $lenInput1 = length($input1);
my $lenInput2 = length($input2);

my $s = "";
my $t = 0;

#-- Loop through the first input --#
for (my $i = 0; $i < $lenInput1; $i++) {
$t += ord(substr($input1, $i, 1));
}

#-- Loop through the second input field --#
for (my $i = 0; $i < $lenInput2; $i++) {

#-- Get this character --#
my $thisChar = substr($input2, $i, 1);

#-- Get the next character --#
my $nextChar;
my $nextCharPos = ($i + 1) % $lenInput2 + 1;
if ($nextCharPos >= $lenInput2) {
$nextChar = substr($input2, 0, 1);
} else {
$nextChar = substr($input2, $nextCharPos, 1);
}

#-- Calculate the value of y --#
my $y = ($t + ord($thisChar) * ord($nextChar)) % 255;

#-- Append the chr of y to s --#
$s .= chr($y)
}

#-- Pad as needed --#
$t = 598.8 if ($t > 598.8);
for (my $i = ($lenInput2 + 1); $i <= 10; $i++) {
my $d = $t**3 * $i / 255;
$d = $1 if ($d =~ /^(\d*)\.?.*/);

my $n = ($t**3 * $i) - ($d * 255);
my $y = $1 if ($n =~ /^(\d*)\.?.*/);
my $r = $1 if ($n =~ /\d*\.(\d).*/);

$y++ if ($r > 4);
$s .= chr($y);
}

return ($s);

}

Lacking evidence of existence is not proof of non-existence.

Return value of Encrypt Function

3-Mar-03 8:54

If the return value of the encrypt function contains a null then the assignment fails. The characters following the null is ignored.
For example: I have a code like this.
newpwd = encrypt("ic","ic")
Response.Write newpwd
The above code only writes "<f3"

I have changed my code like newpwd = Replace((newpwd),chr(0),"") and got the correct result:<f3Ì™f3

v

It wont work this way

StarLite28-Jan-03 9:19

StarLite

28-Jan-03 9:19

Somehow this wont work Frown | :(

I got a login page and the page I want protected with the password.
When I make this code with the function:

The login page contains a form etc like in the article with this line added:
<% Session("loginhash") = encrypt(request.form("name"),request.form("pass")) %>

And the other file contains

<%
Loginhash = Session("loginhash")
HashCheck = Instellingen("password")
If Loginhash = HashCheck then
loggedin = True
else
loggedin = False
end if
%>
Logged in: <% =loggedin %>

But the value of 'loggedin' is *ALWAYS* False even when the 2 variables match [ checked with response.write() ]

How come¿

Re: It wont work this way

tommy skaue28-Jan-03 21:14

tommy skaue

28-Jan-03 21:14

This might sounds like a really weirds answer but use the code located here instead:

http://pajhome.org.uk/crypt/md5/

Unsure | :~

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

Re: It wont work this way

Anonymous29-Jan-03 3:34

Anonymous

29-Jan-03 3:34

Hmzz, altho I rather wont use javascript I'll give it a try.
Im just wondering WHY it wont work, is it the special characters you get in this algorithm cant be compared in ASP¿ Or is there another thing why you cant compare such strings with eachother¿

Re: It wont work this way

tommy skaue29-Jan-03 20:59

tommy skaue

29-Jan-03 20:59

I think it might be the special characters in the result...

Its possible to change the function to span over only normal characters, but I dont use that function any longer.

I havent deleted the article though. Its ok for reading how it can be done and to get your own ideas.

There is MD5 for asp too...

Lets see if its pastable:

<br />
<%<br />
Private Const BITS_TO_A_BYTE=8<br />
Private Const BYTES_TO_A_WORD=4<br />
Private Const BITS_TO_A_WORD=32<br />
Private m_lOnBits(30)<br />
Private m_l2Power(30)<br />
m_lOnBits(0)=CLng(1)<br />
m_lOnBits(1)=CLng(3)<br />
m_lOnBits(2)=CLng(7)<br />
m_lOnBits(3)=CLng(15)<br />
m_lOnBits(4)=CLng(31)<br />
m_lOnBits(5)=CLng(63)<br />
m_lOnBits(6)=CLng(127)<br />
m_lOnBits(7)=CLng(255)<br />
m_lOnBits(8)=CLng(511)<br />
m_lOnBits(9)=CLng(1023)<br />
m_lOnBits(10)=CLng(2047)<br />
m_lOnBits(11)=CLng(4095)<br />
m_lOnBits(12)=CLng(8191)<br />
m_lOnBits(13)=CLng(16383)<br />
m_lOnBits(14)=CLng(32767)<br />
m_lOnBits(15)=CLng(65535)<br />
m_lOnBits(16)=CLng(131071)<br />
m_lOnBits(17)=CLng(262143)<br />
m_lOnBits(18)=CLng(524287)<br />
m_lOnBits(19)=CLng(1048575)<br />
m_lOnBits(20)=CLng(2097151)<br />
m_lOnBits(21)=CLng(4194303)<br />
m_lOnBits(22)=CLng(8388607)<br />
m_lOnBits(23)=CLng(16777215)<br />
m_lOnBits(24)=CLng(33554431)<br />
m_lOnBits(25)=CLng(67108863)<br />
m_lOnBits(26)=CLng(134217727)<br />
m_lOnBits(27)=CLng(268435455)<br />
m_lOnBits(28)=CLng(536870911)<br />
m_lOnBits(29)=CLng(1073741823)<br />
m_lOnBits(30)=CLng(2147483647)<br />
<br />
m_l2Power(0)=CLng(1)<br />
m_l2Power(1)=CLng(2)<br />
m_l2Power(2)=CLng(4)<br />
m_l2Power(3)=CLng(8)<br />
m_l2Power(4)=CLng(16)<br />
m_l2Power(5)=CLng(32)<br />
m_l2Power(6)=CLng(64)<br />
m_l2Power(7)=CLng(128)<br />
m_l2Power(8)=CLng(256)<br />
m_l2Power(9)=CLng(512)<br />
m_l2Power(10)=CLng(1024)<br />
m_l2Power(11)=CLng(2048)<br />
m_l2Power(12)=CLng(4096)<br />
m_l2Power(13)=CLng(8192)<br />
m_l2Power(14)=CLng(16384)<br />
m_l2Power(15)=CLng(32768)<br />
m_l2Power(16)=CLng(65536)<br />
m_l2Power(17)=CLng(131072)<br />
m_l2Power(18)=CLng(262144)<br />
m_l2Power(19)=CLng(524288)<br />
m_l2Power(20)=CLng(1048576)<br />
m_l2Power(21)=CLng(2097152)<br />
m_l2Power(22)=CLng(4194304)<br />
m_l2Power(23)=CLng(8388608)<br />
m_l2Power(24)=CLng(16777216)<br />
m_l2Power(25)=CLng(33554432)<br />
m_l2Power(26)=CLng(67108864)<br />
m_l2Power(27)=CLng(134217728)<br />
m_l2Power(28)=CLng(268435456)<br />
m_l2Power(29)=CLng(536870912)<br />
m_l2Power(30)=CLng(1073741824)<br />
<br />
Private Function LShift(lValue,iShiftBits)<br />
  If iShiftBits=0 Then<br />
    LShift=lValue<br />
    Exit Function<br />
  ElseIf iShiftBits=31 Then<br />
    If lValue And 1 Then<br />
      LShift=&H80000000<br />
    Else<br />
      LShift=0<br />
    End If<br />
    Exit Function<br />
  ElseIf iShiftBits<0 Or iShiftBits>31 Then<br />
    Err.Raise 6<br />
  End If<br />
<br />
  If (lValue And m_l2Power(31-iShiftBits)) Then<br />
    LShift=((lValue And m_lOnBits(31-(iShiftBits+1)))*m_l2Power(iShiftBits)) Or &H80000000<br />
  Else<br />
    LShift=((lValue And m_lOnBits(31-iShiftBits))*m_l2Power(iShiftBits))<br />
  End If<br />
End Function<br />
<br />
Private Function RShift(lValue,iShiftBits)<br />
  If iShiftBits=0 Then<br />
    RShift=lValue<br />
    Exit Function<br />
  ElseIf iShiftBits=31 Then<br />
    If lValue And &H80000000 Then<br />
      RShift=1<br />
    Else<br />
      RShift=0<br />
    End If<br />
    Exit Function<br />
  ElseIf iShiftBits<0 Or iShiftBits>31 Then<br />
    Err.Raise 6<br />
  End If<br />
  <br />
  RShift=(lValue And &H7FFFFFFE)\m_l2Power(iShiftBits)<br />
<br />
  If (lValue And &H80000000) Then<br />
    RShift=(RShift Or (&H40000000\m_l2Power(iShiftBits-1)))<br />
  End If<br />
End Function<br />
<br />
Private Function RotateLeft(lValue,iShiftBits)<br />
  RotateLeft=LShift(lValue,iShiftBits) Or RShift(lValue,(32-iShiftBits))<br />
End Function<br />
<br />
Private Function AddUnsigned(lX,lY)<br />
  Dim lX4<br />
  Dim lY4<br />
  Dim lX8<br />
  Dim lY8<br />
  Dim lResult<br />
<br />
  lX8=lX And &H80000000<br />
  lY8=lY And &H80000000<br />
  lX4=lX And &H40000000<br />
  lY4=lY And &H40000000<br />
<br />
  lResult=(lX And &H3FFFFFFF)+(lY And &H3FFFFFFF)<br />
<br />
  If lX4 And lY4 Then<br />
    lResult=lResult Xor &H80000000 Xor lX8 Xor lY8<br />
  ElseIf lX4 Or lY4 Then<br />
    If lResult And &H40000000 Then<br />
      lResult=lResult Xor &HC0000000 Xor lX8 Xor lY8<br />
    Else<br />
      lResult=lResult Xor &H40000000 Xor lX8 Xor lY8<br />
    End If<br />
  Else<br />
    lResult=lResult Xor lX8 Xor lY8<br />
  End If<br />
<br />
  AddUnsigned=lResult<br />
End Function<br />
<br />
Private Function F(x,y,z)<br />
  F=(x And y) Or ((Not x) And z)<br />
End Function<br />
<br />
Private Function G(x,y,z)<br />
  G=(x And z) Or (y And (Not z))<br />
End Function<br />
<br />
Private Function H(x,y,z)<br />
  H=(x Xor y Xor z)<br />
End Function<br />
<br />
Private Function I(x,y,z)<br />
  I=(y Xor (x Or (Not z)))<br />
End Function<br />
<br />
Private Sub FF(a,b,c,d,x,s,ac)<br />
  a=AddUnsigned(a,AddUnsigned(AddUnsigned(F(b,c,d),x),ac))<br />
  a=RotateLeft(a,s)<br />
  a=AddUnsigned(a,b)<br />
End Sub<br />
<br />
Private Sub GG(a,b,c,d,x,s,ac)<br />
  a=AddUnsigned(a,AddUnsigned(AddUnsigned(G(b,c,d),x),ac))<br />
  a=RotateLeft(a,s)<br />
  a=AddUnsigned(a,b)<br />
End Sub<br />
<br />
Private Sub HH(a,b,c,d,x,s,ac)<br />
  a=AddUnsigned(a,AddUnsigned(AddUnsigned(H(b,c,d),x),ac))<br />
  a=RotateLeft(a,s)<br />
  a=AddUnsigned(a,b)<br />
End Sub<br />
<br />
Private Sub II(a,b,c,d,x,s,ac)<br />
  a=AddUnsigned(a,AddUnsigned(AddUnsigned(I(b,c,d),x),ac))<br />
  a=RotateLeft(a,s)<br />
  a=AddUnsigned(a,b)<br />
End Sub<br />
<br />
Private Function ConvertToWordArray(sMessage)<br />
  Dim lMessageLength<br />
  Dim lNumberOfWords<br />
  Dim lWordArray()<br />
  Dim lBytePosition<br />
  Dim lByteCount<br />
  Dim lWordCount<br />
  <br />
  Const MODULUS_BITS=512<br />
  Const CONGRUENT_BITS=448<br />
  <br />
  lMessageLength=Len(sMessage)<br />
  <br />
  lNumberOfWords=(((lMessageLength+((MODULUS_BITS-CONGRUENT_BITS)\BITS_TO_A_BYTE))\(MODULUS_BITS\BITS_TO_A_BYTE))+1)*(MODULUS_BITS\BITS_TO_A_WORD)<br />
  ReDim lWordArray(lNumberOfWords-1)<br />
  <br />
  lBytePosition=0<br />
  lByteCount=0<br />
  Do Until lByteCount >=lMessageLength<br />
    lWordCount=lByteCount\BYTES_TO_A_WORD<br />
    lBytePosition=(lByteCount Mod BYTES_TO_A_WORD)*BITS_TO_A_BYTE<br />
    lWordArray(lWordCount)=lWordArray(lWordCount) Or LShift(Asc(Mid(sMessage,lByteCount+1,1)),lBytePosition)<br />
    lByteCount=lByteCount+1<br />
  Loop<br />
<br />
  lWordCount=lByteCount\BYTES_TO_A_WORD<br />
  lBytePosition=(lByteCount Mod BYTES_TO_A_WORD)*BITS_TO_A_BYTE<br />
<br />
  lWordArray(lWordCount)=lWordArray(lWordCount) Or LShift(&H80,lBytePosition)<br />
<br />
  lWordArray(lNumberOfWords-2)=LShift(lMessageLength,3)<br />
  lWordArray(lNumberOfWords-1)=RShift(lMessageLength,29)<br />
  <br />
  ConvertToWordArray=lWordArray<br />
End Function<br />
<br />
Private Function WordToHex(lValue)<br />
  Dim lByte<br />
  Dim lCount<br />
  <br />
  For lCount=0 To 3<br />
    lByte=RShift(lValue,lCount*BITS_TO_A_BYTE) And m_lOnBits(BITS_TO_A_BYTE-1)<br />
    WordToHex=WordToHex & Right("0" & Hex(lByte),2)<br />
  Next<br />
End Function<br />
<br />
Public Function MD5(sMessage)<br />
  Dim x<br />
  Dim k<br />
  Dim AA<br />
  Dim BB<br />
  Dim CC<br />
  Dim DD<br />
  Dim a<br />
  Dim b<br />
  Dim c<br />
  Dim d<br />
  <br />
  Const S11=7<br />
  Const S12=12<br />
  Const S13=17<br />
  Const S14=22<br />
  Const S21=5<br />
  Const S22=9<br />
  Const S23=14<br />
  Const S24=20<br />
  Const S31=4<br />
  Const S32=11<br />
  Const S33=16<br />
  Const S34=23<br />
  Const S41=6<br />
  Const S42=10<br />
  Const S43=15<br />
  Const S44=21<br />
<br />
  x=ConvertToWordArray(sMessage)<br />
  <br />
  a=&H67452301<br />
  b=&HEFCDAB89<br />
  c=&H98BADCFE<br />
  d=&H10325476<br />
<br />
  For k=0 To UBound(x) Step 16<br />
    AA=a<br />
    BB=b<br />
    CC=c<br />
    DD=d<br />
<br />
    FF a,b,c,d,x(k+0),S11,&HD76AA478<br />
    FF d,a,b,c,x(k+1),S12,&HE8C7B756<br />
    FF c,d,a,b,x(k+2),S13,&H242070DB<br />
    FF b,c,d,a,x(k+3),S14,&HC1BDCEEE<br />
    FF a,b,c,d,x(k+4),S11,&HF57C0FAF<br />
    FF d,a,b,c,x(k+5),S12,&H4787C62A<br />
    FF c,d,a,b,x(k+6),S13,&HA8304613<br />
    FF b,c,d,a,x(k+7),S14,&HFD469501<br />
    FF a,b,c,d,x(k+8),S11,&H698098D8<br />
    FF d,a,b,c,x(k+9),S12,&H8B44F7AF<br />
    FF c,d,a,b,x(k+10),S13,&HFFFF5BB1<br />
    FF b,c,d,a,x(k+11),S14,&H895CD7BE<br />
    FF a,b,c,d,x(k+12),S11,&H6B901122<br />
    FF d,a,b,c,x(k+13),S12,&HFD987193<br />
    FF c,d,a,b,x(k+14),S13,&HA679438E<br />
    FF b,c,d,a,x(k+15),S14,&H49B40821<br />
<br />
    GG a,b,c,d,x(k+1),S21,&HF61E2562<br />
    GG d,a,b,c,x(k+6),S22,&HC040B340<br />
    GG c,d,a,b,x(k+11),S23,&H265E5A51<br />
    GG b,c,d,a,x(k+0),S24,&HE9B6C7AA<br />
    GG a,b,c,d,x(k+5),S21,&HD62F105D<br />
    GG d,a,b,c,x(k+10),S22,&H2441453<br />
    GG c,d,a,b,x(k+15),S23,&HD8A1E681<br />
    GG b,c,d,a,x(k+4),S24,&HE7D3FBC8<br />
    GG a,b,c,d,x(k+9),S21,&H21E1CDE6<br />
    GG d,a,b,c,x(k+14),S22,&HC33707D6<br />
    GG c,d,a,b,x(k+3),S23,&HF4D50D87<br />
    GG b,c,d,a,x(k+8),S24,&H455A14ED<br />
    GG a,b,c,d,x(k+13),S21,&HA9E3E905<br />
    GG d,a,b,c,x(k+2),S22,&HFCEFA3F8<br />
    GG c,d,a,b,x(k+7),S23,&H676F02D9<br />
    GG b,c,d,a,x(k+12),S24,&H8D2A4C8A<br />
        <br />
    HH a,b,c,d,x(k+5),S31,&HFFFA3942<br />
    HH d,a,b,c,x(k+8),S32,&H8771F681<br />
    HH c,d,a,b,x(k+11),S33,&H6D9D6122<br />
    HH b,c,d,a,x(k+14),S34,&HFDE5380C<br />
    HH a,b,c,d,x(k+1),S31,&HA4BEEA44<br />
    HH d,a,b,c,x(k+4),S32,&H4BDECFA9<br />
    HH c,d,a,b,x(k+7),S33,&HF6BB4B60<br />
    HH b,c,d,a,x(k+10),S34,&HBEBFBC70<br />
    HH a,b,c,d,x(k+13),S31,&H289B7EC6<br />
    HH d,a,b,c,x(k+0),S32,&HEAA127FA<br />
    HH c,d,a,b,x(k+3),S33,&HD4EF3085<br />
    HH b,c,d,a,x(k+6),S34,&H4881D05<br />
    HH a,b,c,d,x(k+9),S31,&HD9D4D039<br />
    HH d,a,b,c,x(k+12),S32,&HE6DB99E5<br />
    HH c,d,a,b,x(k+15),S33,&H1FA27CF8<br />
    HH b,c,d,a,x(k+2),S34,&HC4AC5665<br />
<br />
    II a,b,c,d,x(k+0),S41,&HF4292244<br />
    II d,a,b,c,x(k+7),S42,&H432AFF97<br />
    II c,d,a,b,x(k+14),S43,&HAB9423A7<br />
    II b,c,d,a,x(k+5),S44,&HFC93A039<br />
    II a,b,c,d,x(k+12),S41,&H655B59C3<br />
    II d,a,b,c,x(k+3),S42,&H8F0CCC92<br />
    II c,d,a,b,x(k+10),S43,&HFFEFF47D<br />
    II b,c,d,a,x(k+1),S44,&H85845DD1<br />
    II a,b,c,d,x(k+8),S41,&H6FA87E4F<br />
    II d,a,b,c,x(k+15),S42,&HFE2CE6E0<br />
    II c,d,a,b,x(k+6),S43,&HA3014314<br />
    II b,c,d,a,x(k+13),S44,&H4E0811A1<br />
    II a,b,c,d,x(k+4),S41,&HF7537E82<br />
    II d,a,b,c,x(k+11),S42,&HBD3AF235<br />
    II c,d,a,b,x(k+2),S43,&H2AD7D2BB<br />
    II b,c,d,a,x(k+9),S44,&HEB86D391<br />
<br />
    a=AddUnsigned(a,AA)<br />
    b=AddUnsigned(b,BB)<br />
    c=AddUnsigned(c,CC)<br />
    d=AddUnsigned(d,DD)<br />
  Next<br />
  <br />
  MD5=LCase(WordToHex(a) & WordToHex(b) & WordToHex(c) & WordToHex(d))<br />
End Function<br />
%><br />

------------------------------------------
Hey! Stop reading my signature... stop it!
hmm... you're still reading it...

its a pretty good article

Horatiu CRISTEA31-Jan-02 23:30

Horatiu CRISTEA

31-Jan-02 23:30

from what i see this is a pretty good artible about password encription.

usualy a good security is done almost like this. the most popular way is using a one way hash function on a string which is composed from the password and another randomly generated string.

for example u have the strPassword = "password" and the strRandom = "JHG23HG42L" the method is doing an encrypt on (strPassword & strRandom) and the resulting lets say 64 characters encrypted string is written in the DB.

if a hacker got ur DB he probably got ur .asp file where u have implemented ur encrypt function. Poke tongue | ;-P

so he could get an huge dictionary and run ur encrypt function on each dictionary word and look for a match and this is something that u cant prevent only by making it longer for him to find the match Smile | :)

ur article is good Smile | :)

---------------
Horatiu CRISTEA

Re: its a pretty good article

tommy skaue1-Feb-02 0:18

tommy skaue

1-Feb-02 0:18

Thank you! Glad to see its appreciated Poke tongue | ;-P

You might say its only a step into a more secure userlogin procedure, but there are several thing you would want to implement to make your login even more secure.

I like to think of this function as a security-solution for us newbie-programmers who wants to make a wanna-be-secure website Wink | ;)

Its better than no encryption, and its quite easy to implement...

------------------------
This is my signature...

Re: its a pretty good article

Horatiu CRISTEA1-Feb-02 2:18

Horatiu CRISTEA

1-Feb-02 2:18

u can say its secure in a way but for professional websites u need to do the security in a professional way.
Anyway this is a free source learning site Smile | :)

so this article worth more than posting an article how to use a crypto component Smile | :)

---------------
Horatiu CRISTEA

Re: its a pretty good article

tommy skaue1-Feb-02 2:18

tommy skaue

1-Feb-02 2:18

exactly...
and most of those components cost $'s Cry | :((

I like free code better Roll eyes | :rolleyes:

This is my signature...

Tommy's son (off-topic)

22-Jan-02 3:29

" Tommy live in Tromsø, a city far up north in Norway. He does programming and webdevelopment for a living. He is married and has one son (as of february 2002).
"

As of February 2002? Have I been stuck in some time warp? Aren't we still in January 2002??

Sorry, I had to ask...

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.