SRP（远程密码安全）在网游登录服的应用

1.关于SRP的资源

SRP协议是由斯坦福大学计算机科学系的Thomas wu等开发的,英文全称是Security Remote Password(远程密码安全),经过严密的数学论证,SRP被证明是一种非常安全的算法,我们可以在获取到SRP的协议的官方文档 http://srp.stanford.edu/ .当下流行的网络游戏魔兽世界采用的就是SRP6协议.

 

2.原理，设计

原理具体讲解可参看上面的官方文档，设计在http://srp.stanford.edu/design.html。

 

3.代码

附上一个SRP6的C语言简单实现。

#include <stdlib.h> #include <stdio.h> #include <memory.h> #include <string.h> // Multiple-precision modular arithmetic // package to support SRP-6 server and clients // Author: Karl Malbrain, malbrain@yahoo.com // configure package for 1024 bit operations #define SIZE (1024 / 32) #ifdef unix #define __int64 long long #else typedef unsigned int uint; typedef unsigned long ulong; #endif typedef unsigned char uchar; typedef unsigned __int64 uint64; // 1024 bit modulus taken from IETF // draft-ietf-tls-srp-10 unsigned long DHmod[SIZE] = { 0xEEAF0AB9, 0xADB38DD6, 0x9C33F80A, 0xFA8FC5E8, 0x60726187, 0x75FF3C0B, 0x9EA2314C, 0x9C256576, 0xD674DF74, 0x96EA81D3, 0x383B4813, 0xD692C6E0, 0xE0D5D8E2, 0x50B98BE4, 0x8E495C1D, 0x6089DAD1, 0x5DC7D7B4, 0x6154D6B6, 0xCE8EF4AD, 0x69B15D49, 0x82559B29, 0x7BCF1885, 0xC529F566, 0x660E57EC, 0x68EDBC3C, 0x05726CC0, 0x2FD4CBF4, 0x976EAA9A, 0xFD5138FE, 0x8376435B, 0x9FC61D2F, 0xC0EB06E3 }; // return 1 if multiple precision number is zero // used to verify A & B are non-zero int mpzero (ulong *a) { int idx = SIZE; while( idx-- ) if( *a++ ) return 0; return 1; } // return remainder of double sized product u/DHmod in u void mpmod (ulong *u) { int i, j, n = SIZE, m = SIZE * 2; uint64 quot, rem, nxt, prod; __int64 cry; while( m ) if( !u[0] ) m--, u++; else break; nxt = 0; for( i = 0; i <= m - n; i++ ) { nxt <<= 32; nxt |= u[i]; rem = nxt % DHmod[0]; quot = nxt / DHmod[0]; while( quot == 0x100000000 || rem < 0x100000000 && (quot * DHmod[1]) > (rem << 32 | u[i + 1]) ) quot -= 1, rem += DHmod[0]; prod = cry = 0; if( quot ) for( j = n; j--; ) { prod += quot * DHmod[j]; cry += (uint64)u[i + j] - (ulong)prod; u[i + j] = (ulong)cry; prod >>= 32; cry >>= 32; } nxt = u[i]; if( !i ) if( cry - prod ) quot++; else continue; else if( u[i - 1] += cry - prod ) quot++; else continue; cry = 0; for( j = n; j--; ) { cry += (uint64)u[i + j] + DHmod[j]; u[i + j] = (ulong)cry; cry >>= 32; } if( i ) u[i - 1] += (ulong)cry; nxt = u[i]; } } // multiply two SIZE numbers into double SIZED result void mpmult (ulong *dest, ulong *what, ulong *by) { int m, n = SIZE; uint64 fact; uint64 cry; memset (dest, 0, SIZE * 2 * sizeof(ulong)); while( n-- ) { cry = 0; if( fact = what[n] ) for( m = SIZE; m--; ) { cry += fact * by[m] + dest[n + m + 1]; dest[n + m + 1] = (ulong)cry; cry >>= 32; } dest[n] = (ulong)cry; } } // exponentiate SIZE base by SIZE exponent // to SIZE result, modulo DHmod void mpexp (ulong *result, ulong *base, ulong *exponent) { ulong prod[SIZE * 2], term[SIZE]; int idx = SIZE * 32; memset (result, 0, SIZE * sizeof(ulong)); memcpy (term, base, SIZE * sizeof(ulong)); result[SIZE - 1] = 1; while( idx ) if( *exponent ) break; else exponent++, idx -= 32; while( idx-- ) { if( exponent[idx / 32] & (1 << (31 - (idx & 0x1f))) ) { mpmult (prod, result, term); mpmod(prod); memcpy (result, prod + SIZE, SIZE * sizeof(ulong)); } mpmult (prod, term, term); mpmod(prod); memcpy (term, prod + SIZE, SIZE * sizeof(ulong)); } } // multiply a by b (single precision multiplier) // and add to dest void mpmpyadd (ulong *dest, ulong *a, ulong b) { ulong result[SIZE * 2]; __int64 cry = 0; int idx = SIZE; while( idx-- ) { cry += dest[idx]; cry += a[idx] * (uint64)b; result[idx + SIZE] = cry; result[idx] = 0; cry >>= 32; } // normalize result result[SIZE - 1] = cry; mpmod (result); memcpy (dest, result + SIZE, SIZE * sizeof(ulong)); } // multiply a by b (single precision multiplier) // and subtract from dest void mpmpysub (ulong *dest, ulong *a, ulong b) { ulong result[SIZE * 2]; __int64 cry = 0; int idx = SIZE; // multiply a by b while( idx-- ) { cry += a[idx] * (uint64)b; result[idx + SIZE] = cry; result[idx] = 0; cry >>= 32; } // normalize result result[SIZE - 1] = cry; mpmod (result); // subtract result from dest for( cry = 0, idx = SIZE; idx--; ) { cry += dest[idx]; cry -= result[idx + SIZE]; dest[idx] = cry; cry >>= 32; } // normalize result if( cry < 0 ) for( cry = 0, idx = SIZE; idx--; ) { cry += dest[idx]; cry += DHmod[idx]; dest[idx] = cry; cry >>= 32; } } // SHA 256 routines // taken from Wikipedia pseudo code //2^32 times the cube root of the first 64 primes 2..311 static ulong k[64] = { 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 }; // store 64 bit integer void putlonglong (uint64 what, uchar *where) { *where++ = what >> 56; *where++ = what >> 48; *where++ = what >> 40; *where++ = what >>