@ -1,52 +1,124 @@
/ *
* js - sha1 v0 . 3.0
* https : //github.com/emn178/js-sha1
* [ js - sha1 ] { @ link https : //github.com/emn178/js-sha1}
*
* Copyright 2014 - 2015 , emn178 @ gmail . com
*
* Licensed under the MIT license :
* http : //www.opensource.org/licenses/MIT
* @ version 0.4 . 0
* @ author Chen , Yi - Cyuan [ emn178 @ gmail . com ]
* @ copyright Chen , Yi - Cyuan 2014 - 2016
* @ license MIT
* /
; ( function ( root , undefined ){
( function ( root {
'use strict' ;
var NODE _JS = typeof ( module ) != 'undefined' ;
if ( NODE _JS ) {
var NODE _JS = typeof process == 'object' && process . versions && process . versions . node ;
if ( NODE _JS ) {
root = global ;
}
var COMMON _JS = ! root . JS _SHA1 _TEST && typeof module == 'object' && module . exports ;
var AMD = typeof define == 'function' && define . amd ;
var HEX _CHARS = '0123456789abcdef' . split ( '' ) ;
var EXTRA = [ - 2147483648 , 8388608 , 32768 , 128 ] ;
var SHIFT = [ 24 , 16 , 8 , 0 ] ;
var OUTPUT _TYPES = [ 'hex' , 'array' , 'digest' , 'arrayBuffer' ] ;
var blocks = [ ] ;
var sha1 = function ( messag e) {
var notString = typeof ( message ) != 'string' ;
if ( notString && message . constructor == ArrayBuffer ) {
message = new Uint8Array ( message ) ;
}
var createOutputMethod = function ( outputTyp e) {
return function ( message ) {
return new Sha1 ( true ) . update ( message ) [ outputType ] ( ) ;
} ;
} ;
var h0 , h1 , h2 , h3 , h4 , block = 0 , code , end = false , t , f ,
i , j , index = 0 , start = 0 , bytes = 0 , length = message . length ;
var createMethod = function ( ) {
var method = createOutputMethod ( 'hex' ) ;
if ( NODE _JS ) {
method = nodeWrap ( method ) ;
}
method . create = function ( ) {
return new Sha1 ( ) ;
} ;
method . update = function ( message ) {
return method . create ( ) . update ( message ) ;
} ;
for ( var i = 0 ; i < OUTPUT _TYPES . length ; ++ i ) {
var type = OUTPUT _TYPES [ i ] ;
method [ type ] = createOutputMethod ( type ) ;
}
return method ;
} ;
h0 = 0x67452301 ;
h1 = 0xEFCDAB89 ;
h2 = 0x98BADCFE ;
h3 = 0x10325476 ;
h4 = 0xC3D2E1F0 ;
var nodeWrap = function ( method ) {
var crypto , Buffer ;
try {
if ( root . JS _SHA1 _TEST ) {
throw 'JS_SHA1_TEST' ;
}
crypto = require ( 'crypto' ) ;
Buffer = require ( 'buffer' ) . Buffer ;
} catch ( e ) {
console . log ( e ) ;
return method ;
}
var nodeMethod = function ( message ) {
if ( typeof message == 'string' ) {
return crypto . createHash ( 'sha1' ) . update ( message , 'utf8' ) . digest ( 'hex' ) ;
} else if ( message . constructor == ArrayBuffer ) {
message = new Uint8Array ( message ) ;
} else if ( message . length === undefined ) {
return method ( message ) ;
}
return crypto . createHash ( 'sha1' ) . update ( new Buffer ( message ) ) . digest ( 'hex' ) ;
} ;
return nodeMethod ;
} ;
do {
blocks [ 0 ] = block ;
blocks [ 16 ] = blocks [ 1 ] = blocks [ 2 ] = blocks [ 3 ] =
function Sha1 ( sharedMemory ) {
if ( sharedMemory ) {
blocks [ 0] = blocks [ 16] = blocks [ 1 ] = blocks [ 2 ] = blocks [ 3 ] =
blocks [ 4 ] = blocks [ 5 ] = blocks [ 6 ] = blocks [ 7 ] =
blocks [ 8 ] = blocks [ 9 ] = blocks [ 10 ] = blocks [ 11 ] =
blocks [ 12 ] = blocks [ 13 ] = blocks [ 14 ] = blocks [ 15 ] = 0 ;
this . blocks = blocks ;
} else {
this . blocks = [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] ;
}
this . h0 = 0x67452301 ;
this . h1 = 0xEFCDAB89 ;
this . h2 = 0x98BADCFE ;
this . h3 = 0x10325476 ;
this . h4 = 0xC3D2E1F0 ;
this . block = this . start = this . bytes = 0 ;
this . finalized = this . hashed = false ;
this . first = true ;
}
Sha1 . prototype . update = function ( message ) {
if ( this . finalized ) {
return ;
}
var notString = typeof ( message ) != 'string' ;
if ( notString && message . constructor == root . ArrayBuffer ) {
message = new Uint8Array ( message ) ;
}
var code , index = 0 , i , length = message . length || 0 , blocks = this . blocks ;
while ( index < length ) {
if ( this . hashed ) {
this . hashed = false ;
blocks [ 0 ] = this . block ;
blocks [ 16 ] = blocks [ 1 ] = blocks [ 2 ] = blocks [ 3 ] =
blocks [ 4 ] = blocks [ 5 ] = blocks [ 6 ] = blocks [ 7 ] =
blocks [ 8 ] = blocks [ 9 ] = blocks [ 10 ] = blocks [ 11 ] =
blocks [ 12 ] = blocks [ 13 ] = blocks [ 14 ] = blocks [ 15 ] = 0 ;
}
if ( notString ) {
for ( i = start ; index < length && i < 64 ; ++ index ) {
for ( i = this . start ; index < length && i < 64 ; ++ index ) {
blocks [ i >> 2 ] |= message [ index ] << SHIFT [ i ++ & 3 ] ;
}
} else {
for ( i = start ; index < length && i < 64 ; ++ index ) {
for ( i = this . start ; index < length && i < 64 ; ++ index ) {
code = message . charCodeAt ( index ) ;
if ( code < 0x80 ) {
blocks [ i >> 2 ] |= code << SHIFT [ i ++ & 3 ] ;
@ -66,138 +138,172 @@
}
}
}
bytes += i - start ;
start = i - 64 ;
if ( index == length ) {
blocks [ i >> 2 ] |= EXTRA [ i & 3 ] ;
++ index ;
}
block = blocks [ 16 ] ;
if ( index > length && i < 56 ) {
blocks [ 15 ] = bytes << 3 ;
end = true ;
}
for ( j = 16 ; j < 80 ; ++ j ) {
t = blocks [ j - 3 ] ^ blocks [ j - 8 ] ^ blocks [ j - 14 ] ^ blocks [ j - 16 ] ;
blocks [ j ] = ( t << 1 ) | ( t >>> 31 ) ;
this . lastByteIndex = i ;
this . bytes += i - this . start ;
if ( i >= 64 ) {
this . block = blocks [ 16 ] ;
this . start = i - 64 ;
this . hash ( ) ;
this . hashed = true ;
} else {
this . start = i ;
}
}
return this ;
} ;
var a = h0 , b = h1 , c = h2 , d = h3 , e = h4 ;
for ( j = 0 ; j < 20 ; j += 5 ) {
f = ( b & c ) | ( ( ~ b ) & d ) ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e + 1518500249 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = ( a & b ) | ( ( ~ a ) & c ) ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d + 1518500249 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = ( e & a ) | ( ( ~ e ) & b ) ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c + 1518500249 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = ( d & e ) | ( ( ~ d ) & a ) ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b + 1518500249 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = ( c & d ) | ( ( ~ c ) & e ) ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a + 1518500249 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
Sha1 . prototype . finalize = function ( ) {
if ( this . finalized ) {
return ;
}
this . finalized = true ;
var blocks = this . blocks , i = this . lastByteIndex ;
blocks [ 16 ] = this . block ;
blocks [ i >> 2 ] |= EXTRA [ i & 3 ] ;
this . block = blocks [ 16 ] ;
if ( i >= 56 ) {
if ( ! this . hashed ) {
this . hash ( ) ;
}
blocks [ 0 ] = this . block ;
blocks [ 16 ] = blocks [ 1 ] = blocks [ 2 ] = blocks [ 3 ] =
blocks [ 4 ] = blocks [ 5 ] = blocks [ 6 ] = blocks [ 7 ] =
blocks [ 8 ] = blocks [ 9 ] = blocks [ 10 ] = blocks [ 11 ] =
blocks [ 12 ] = blocks [ 13 ] = blocks [ 14 ] = blocks [ 15 ] = 0 ;
}
blocks [ 15 ] = this . bytes << 3 ;
this . hash ( ) ;
} ;
for ( ; j < 40 ; j += 5 ) {
f = b ^ c ^ d ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e + 1859775393 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = a ^ b ^ c ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d + 1859775393 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = e ^ a ^ b ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c + 1859775393 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = d ^ e ^ a ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b + 1859775393 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = c ^ d ^ e ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a + 1859775393 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
Sha1 . prototype . hash = function ( ) {
var a = this . h0 , b = this . h1 , c = this . h2 , d = this . h3 , e = this . h4 ;
var f , j , t , blocks = this . blocks ;
for ( ; j < 60 ; j += 5 ) {
f = ( b & c ) | ( b & d ) | ( c & d ) ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e - 1894007588 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = ( a & b ) | ( a & c ) | ( b & c ) ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d - 1894007588 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = ( e & a ) | ( e & b ) | ( a & b ) ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c - 1894007588 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = ( d & e ) | ( d & a ) | ( e & a ) ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b - 1894007588 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = ( c & d ) | ( c & e ) | ( d & e ) ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a - 1894007588 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
for ( j = 16 ; j < 80 ; ++ j ) {
t = blocks [ j - 3 ] ^ blocks [ j - 8 ] ^ blocks [ j - 14 ] ^ blocks [ j - 16 ] ;
blocks [ j ] = ( t << 1 ) | ( t >>> 31 ) ;
}
for ( ; j < 80 ; j += 5 ) {
f = b ^ c ^ d ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e - 899497514 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = a ^ b ^ c ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d - 899497514 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = e ^ a ^ b ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c - 899497514 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = d ^ e ^ a ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b - 899497514 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = c ^ d ^ e ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a - 899497514 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
for ( j = 0 ; j < 20 ; j += 5 ) {
f = ( b & c ) | ( ( ~ b ) & d ) ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e + 1518500249 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = ( a & b ) | ( ( ~ a ) & c ) ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d + 1518500249 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = ( e & a ) | ( ( ~ e ) & b ) ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c + 1518500249 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = ( d & e ) | ( ( ~ d ) & a ) ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b + 1518500249 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = ( c & d ) | ( ( ~ c ) & e ) ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a + 1518500249 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
for ( ; j < 40 ; j += 5 ) {
f = b ^ c ^ d ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e + 1859775393 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = a ^ b ^ c ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d + 1859775393 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = e ^ a ^ b ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c + 1859775393 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = d ^ e ^ a ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b + 1859775393 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = c ^ d ^ e ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a + 1859775393 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
for ( ; j < 60 ; j += 5 ) {
f = ( b & c ) | ( b & d ) | ( c & d ) ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e - 1894007588 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = ( a & b ) | ( a & c ) | ( b & c ) ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d - 1894007588 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = ( e & a ) | ( e & b ) | ( a & b ) ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c - 1894007588 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
f = ( d & e ) | ( d & a ) | ( e & a ) ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b - 1894007588 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = ( c & d ) | ( c & e ) | ( d & e ) ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a - 1894007588 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
for ( ; j < 80 ; j += 5 ) {
f = b ^ c ^ d ;
t = ( a << 5 ) | ( a >>> 27 ) ;
e = t + f + e - 899497514 + blocks [ j ] << 0 ;
b = ( b << 30 ) | ( b >>> 2 ) ;
f = a ^ b ^ c ;
t = ( e << 5 ) | ( e >>> 27 ) ;
d = t + f + d - 899497514 + blocks [ j + 1 ] << 0 ;
a = ( a << 30 ) | ( a >>> 2 ) ;
f = e ^ a ^ b ;
t = ( d << 5 ) | ( d >>> 27 ) ;
c = t + f + c - 899497514 + blocks [ j + 2 ] << 0 ;
e = ( e << 30 ) | ( e >>> 2 ) ;
h0 = h0 + a << 0 ;
h1 = h1 + b << 0 ;
h2 = h2 + c << 0 ;
h3 = h3 + d << 0 ;
h4 = h4 + e << 0 ;
} while ( ! end ) ;
f = d ^ e ^ a ;
t = ( c << 5 ) | ( c >>> 27 ) ;
b = t + f + b - 899497514 + blocks [ j + 3 ] << 0 ;
d = ( d << 30 ) | ( d >>> 2 ) ;
f = c ^ d ^ e ;
t = ( b << 5 ) | ( b >>> 27 ) ;
a = t + f + a - 899497514 + blocks [ j + 4 ] << 0 ;
c = ( c << 30 ) | ( c >>> 2 ) ;
}
this . h0 = this . h0 + a << 0 ;
this . h1 = this . h1 + b << 0 ;
this . h2 = this . h2 + c << 0 ;
this . h3 = this . h3 + d << 0 ;
this . h4 = this . h4 + e << 0 ;
} ;
Sha1 . prototype . hex = function ( ) {
this . finalize ( ) ;
var h0 = this . h0 , h1 = this . h1 , h2 = this . h2 , h3 = this . h3 , h4 = this . h4 ;
return HEX _CHARS [ ( h0 >> 28 ) & 0x0F ] + HEX _CHARS [ ( h0 >> 24 ) & 0x0F ] +
HEX _CHARS [ ( h0 >> 20 ) & 0x0F ] + HEX _CHARS [ ( h0 >> 16 ) & 0x0F ] +
@ -221,20 +327,47 @@
HEX _CHARS [ ( h4 >> 4 ) & 0x0F ] + HEX _CHARS [ h4 & 0x0F ] ;
} ;
if ( ! root . JS _SHA1 _TEST && typeof ( module ) != 'undefined' ) {
var crypto = require ( 'crypto' ) ;
var Buffer = require ( 'buffer' ) . Buffer ;
Sha1 . prototype . toString = Sha1 . prototype . hex ;
module . exports = function ( message ) {
if ( typeof ( message ) == 'string' ) {
return crypto . createHash ( 'sha1' ) . update ( message , 'utf8' ) . digest ( 'hex' ) ;
}
if ( message . constructor == ArrayBuffer ) {
message = new Uint8Array ( message ) ;
}
return crypto . createHash ( 'sha1' ) . update ( new Buffer ( message ) ) . digest ( 'hex' ) ;
} ;
} else if ( root ) {
root . sha1 = sha1 ;
Sha1 . prototype . digest = function ( ) {
this . finalize ( ) ;
var h0 = this . h0 , h1 = this . h1 , h2 = this . h2 , h3 = this . h3 , h4 = this . h4 ;
return [
( h0 >> 24 ) & 0xFF , ( h0 >> 16 ) & 0xFF , ( h0 >> 8 ) & 0xFF , h0 & 0xFF ,
( h1 >> 24 ) & 0xFF , ( h1 >> 16 ) & 0xFF , ( h1 >> 8 ) & 0xFF , h1 & 0xFF ,
( h2 >> 24 ) & 0xFF , ( h2 >> 16 ) & 0xFF , ( h2 >> 8 ) & 0xFF , h2 & 0xFF ,
( h3 >> 24 ) & 0xFF , ( h3 >> 16 ) & 0xFF , ( h3 >> 8 ) & 0xFF , h3 & 0xFF ,
( h4 >> 24 ) & 0xFF , ( h4 >> 16 ) & 0xFF , ( h4 >> 8 ) & 0xFF , h4 & 0xFF
] ;
} ;
Sha1 . prototype . array = Sha1 . prototype . digest ;
Sha1 . prototype . arrayBuffer = function ( ) {
this . finalize ( ) ;
var buffer = new ArrayBuffer ( 20 ) ;
var dataView = new DataView ( buffer ) ;
dataView . setUint32 ( 0 , this . h0 ) ;
dataView . setUint32 ( 4 , this . h1 ) ;
dataView . setUint32 ( 8 , this . h2 ) ;
dataView . setUint32 ( 12 , this . h3 ) ;
dataView . setUint32 ( 16 , this . h4 ) ;
return buffer ;
} ;
var exports = createMethod ( ) ;
if ( COMMON _JS ) {
module . exports = exports ;
} else {
root . sha1 = exports ;
if ( AMD ) {
define ( function ( ) {
return exports ;
} ) ;
}
}
} ( this ) ) ;
Chen, Yi-Cyuan
9 years ago