Difference between revisions of "SHA-1"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
Preforms a SHA1 Hash on the text. Similar to and MD5 hash, although (slightly) more secure. Two versions of the function are provided, one for UTF-8 Strings (all strings in LSL are UTF-8) and the other is for Base64 Strings (you need to tell it how many bits long the data is). | Preforms a SHA1 Hash on the text. Similar to and MD5 hash, although (slightly) more secure. Two versions of the function are provided, one for UTF-8 Strings (all strings in LSL are UTF-8) and the other is for Base64 Strings (you need to tell it how many bits long the data is). | ||
There is also an [[SHA2]] implementations ([[SHA2#SHA-224|224]] & [[SHA2#SHA-256|256]]). | |||
View http://en.wikipedia.org/wiki/SHA1 for more information. | View http://en.wikipedia.org/wiki/SHA1 for more information. | ||
Revision as of 15:19, 27 October 2007
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Preforms a SHA1 Hash on the text. Similar to and MD5 hash, although (slightly) more secure. Two versions of the function are provided, one for UTF-8 Strings (all strings in LSL are UTF-8) and the other is for Base64 Strings (you need to tell it how many bits long the data is).
There is also an SHA2 implementations (224 & 256).
View http://en.wikipedia.org/wiki/SHA1 for more information.
//////////////////////////////////////////////////////////////////////////////////////
//
// UTF-8 SHA1
// Version 1.1
// ESL Compiled: "Oct 25 2007", "14:35:48"
// Copyright (C) 2007 Strife Onizuka
// Based on Pseudo-code from http://en.wikipedia.org/wiki/SHA1
// https://wiki.secondlife.com/wiki/SHA1
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License
// as published by the Free Software Foundation;
// version 3 of the License.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this library. If not, see <http://www.gnu.org/licenses/>
// or write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
// Boston, MA 02111-1307 USA
//
//////////////////////////////////////////////////////////////////////////////////////
//===================================================//
// Combined Library //
// "Oct 25 2007", "14:35:48" //
// Copyright (C) 2004-2007, Strife Onizuka (cc-by) //
// http://creativecommons.org/licenses/by/3.0/ //
//===================================================//
//{
string TrimRight(string src, string chrs)//Mono Unsafe, LSO Safe
{
integer i = llStringLength(src);
do;while(~llSubStringIndex(chrs, llGetSubString(src, (i = ~-i), i)) && i);
return llDeleteSubString(src, (-~(i)), 0xFFFF);
}
string hexc="0123456789ABCDEF";
//} Combined Library
string UTF8_SHA1(string plain) {
integer H1 = 0x67452301;
integer H2 = 0xefcdab89;
integer H3 = 0x98badcfe;
integer H4 = 0x10325476;
integer H5 = 0xc3d2e1f0;
//OR on the extra bit.
integer j = llStringLength(plain) << 3;
integer b = (~-(((j + 552) & -512) >> 5));
integer T = llBase64ToInteger(TrimRight(llGetSubString(plain = llStringToBase64(plain), -4, -1),"=")+"AAAA");
string buf = "AAA";
integer i = -5;
do buf += buf; while((i = -~i));
if(j)
{
i = 0x800000;
if(T & 0xFF00)
i = 0x00000080;
else if(T & 0xFF0000)
i = 0x00008000;
}
else
T = 0x80000000;//T is corrupt because of https://jira.secondlife.com/browse/SVC-104
// llOwnerSay(llList2CSV([i,j]));
plain = llGetSubString( llDeleteSubString(plain, -4, -1) +
llGetSubString(llIntegerToBase64(T | i), 0, 5) +
buf, 0, (b << 4) / 3) +
llIntegerToBase64(j << (6 - ((b % 3) << 1)));
list x;
integer S = i = 0;
do
{
integer A = H1;
integer B = H2;
integer C = H3;
integer D = H4;
integer E = H5;
x = (list)(j = 0);//the zero gets flushed off the stack by the later loops
do
{
T = llBase64ToInteger(buf = llGetSubString(plain, T = ((i + j) << 4) / 3, T+6)) << (S = ((i + j) % 3) << 1);
if(S)
T = T | (llBase64ToInteger("A"+llDeleteSubString(buf, 0, 1)) >> (6 - S));
// llOwnerSay("W["+(string)j+"]="+hex(T));
x += T;
T += ((A << 5) | ((A >> 27) & 0x1F)) + (D ^ (B & (C ^ D))) + E + 0x5a827999;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(16 > (j = -~j));
// llOwnerSay(llList2CSV(hexm(x)));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)j+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (D ^ (B & (C ^ D))) + E + 0x5a827999;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(20 > (j = -~j));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)j+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (B ^ C ^ D) + E + 0x6ed9eba1;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(40 > (j = -~j));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)j+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + ((B & C) | (B & D) | (C & D)) + E + 0x8f1bbcdc;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(60 > (j = -~j));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)j+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (B ^ C ^ D) + E + 0xca62c1d6;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(80 > (j = -~j));
H1 += A;
H2 += B;
H3 += C;
H4 += D;
H5 += E;
}while(b > i += 16);
x = [H1, H2, H3, H4, H5];
i = -5;
buf = "";
do
{
T = llList2Integer(x,i);
j = 32;
do
buf += llGetSubString(hexc, b = ((T >> (j -= 4)) & 0xF), b);
while (j);
}while ((i = -~i));
return buf;
}
string Base64_SHA1(string plain, integer bit_length) {//$[E20009]
integer H1 = 0x67452301;
integer H2 = 0xefcdab89;
integer H3 = 0x98badcfe;
integer H4 = 0x10325476;
integer H5 = 0xc3d2e1f0;
//OR on the extra bit.
integer b = (~-(((bit_length + 552) & -512) >> 5));
integer T = llBase64ToInteger(TrimRight(llGetSubString(plain, -4, -1),"=")+"AAAA");
string buf = "AAA";
integer i = -5;
do buf += buf; while((i = -~i));
if(bit_length)
{
i = 0x800000;
if(T & 0xFF00)
i = 0x00000080;
else if(T & 0xFF0000)
i = 0x00008000;
}
else
T = 0x80000000;//T is corrupt because of https://jira.secondlife.com/browse/SVC-104
// llOwnerSay(llList2CSV([i,bit_length]));
plain = llGetSubString( llDeleteSubString(plain, -4, -1) +
llGetSubString(llIntegerToBase64(T | i), 0, 5) +
buf, 0, (b << 4) / 3) +
llIntegerToBase64(bit_length << (6 - ((b % 3) << 1)));
list x;
integer S = i = 0;
do
{
integer A = H1;
integer B = H2;
integer C = H3;
integer D = H4;
integer E = H5;
x = (list)(bit_length = 0);//the zero gets flushed off the stack by the later loops
do
{
T = llBase64ToInteger(buf = llGetSubString(plain, T = ((i + bit_length) << 4) / 3, T+6)) << (S = ((i + bit_length) % 3) << 1);
if(S)
T = T | (llBase64ToInteger("A"+llDeleteSubString(buf, 0, 1)) >> (6 - S));
// llOwnerSay("W["+(string)bit_length+"]="+hex(T));
x += T;
T += ((A << 5) | ((A >> 27) & 0x1F)) + (D ^ (B & (C ^ D))) + E + 0x5a827999;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(16 > (bit_length = -~bit_length));
// llOwnerSay(llList2CSV(hexm(x)));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)bit_length+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (D ^ (B & (C ^ D))) + E + 0x5a827999;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(20 > (bit_length = -~bit_length));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)bit_length+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (B ^ C ^ D) + E + 0x6ed9eba1;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(40 > (bit_length = -~bit_length));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)bit_length+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + ((B & C) | (B & D) | (C & D)) + E + 0x8f1bbcdc;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(60 > (bit_length = -~bit_length));
do
{
S = llList2Integer(x, -3) ^ llList2Integer(x, -8) ^ llList2Integer(x, -14) ^ llList2Integer(x, -16);
x = llList2List(x + T = ((S << 1) | !!(S & 0x80000000)), -16, -1);
// llOwnerSay("W["+(string)bit_length+"]="+hex(T));
T += ((A << 5) | ((A >> 27) & 0x1F)) + (B ^ C ^ D) + E + 0xca62c1d6;
E = D;
D = C;
C = ((B << 30) | ((B >> 2) & 0x3FFFFFFF));
B = A;
A = T;
}while(80 > (bit_length = -~bit_length));
H1 += A;
H2 += B;
H3 += C;
H4 += D;
H5 += E;
}while(b > i += 16);
x = [H1, H2, H3, H4, H5];
i = -5;
buf = "";
do
{
T = llList2Integer(x,i);
bit_length = 32;
do
buf += llGetSubString(hexc, b = ((T >> (bit_length -= 4)) & 0xF), b);
while (bit_length);
}while ((i = -~i));
return buf;
}
go(string in, string answer)
{
llOwnerSay("");
llResetTime();
string out = UTF8_SHA1(in);
float t = llGetTime();
llOwnerSay(llList2CSV([out,t,llStringLength(in)]));
if(answer)llOwnerSay(answer);
}
default
{
state_entry()
{
go("", "DA39A3EE5E6B4B0D3255BFEF95601890AFD80709");
go("abc", "A9993E364706816ABA3E25717850C26C9CD0D89D");
go("The quick brown fox jumps over the lazy dog", "2FD4E1C67A2D28FCED849EE1BB76E7391B93EB12");
go("DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF95601890AFD80709DA39A3EE5E6B4B0D3255BFEF", "");
// llOwnerSay((string)llGetTime());
}
}