powerdlz23 1.2.2 → 1.2.3

package/pto/crypto/mt19937/README.md

@@ -0,0 +1,30 @@
+MT19937-64伪随机算法代码集
+=====================
+
+MT19937-64是`梅森旋转算法`的64位实现，通用于各种编程语言的伪随机数生成算法。
+
+本代码仓库收集整理了不同语言的MT19937-64算法实现，并做了测试。
+
+可以用于客户端运算服务端验证型的游戏项目。
+
+由服务端下发随机种子，由于算法一致，所以客户端每次随机的结果都是服务端可验证的。
+
+用法
+====
+
+1. 对于Unity之类的C#项目，只需要把mt19937.cs文件放入项目中即可。
+2. 对于Go语言项目，把go目录复制到项目中，更名为mt19937，使用import用法导入包。
+
+相关链接
+=======
+
+1. [梅森旋转算法](http://zh.wikipedia.org/wiki/%E6%A2%85%E6%A3%AE%E6%97%8B%E8%BD%AC%E7%AE%97%E6%B3%95)
+2. [C语言版的实现](http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt64.html)
+3. [C#版本的实现](https://github.com/M-S-D/Team-Splitter/blob/master/mt19937.cs)
+4. [Go语言版的实现](https://github.com/seehuhn/mt19937/blob/master/mt19937.go)
+
+注1：C语言版默认是静态调用模式，本仓库收集整理时重构为实例化的方式调用。
+
+注2：C#版实现用了静态写法，本仓库收集整理时重构了命名方式并改为非静态用法。
+
+注3：Go语言版没有浮点数生成的部分，本仓库收集整理时添加了这部分代码。

package/pto/crypto/mt19937/c/mt19937-64.c

@@ -0,0 +1,180 @@
+/* 
+   A C-program for MT19937-64 (2014/2/23 version).
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   This is a 64-bit version of Mersenne Twister pseudorandom number
+   generator.
+
+   Before using, initialize the state by using init_genrand64(seed)  
+   or init_by_array64(init_key, key_length).
+
+   Copyright (C) 2004, 2014, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.                          
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote 
+        products derived from this software without specific prior written 
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   References:
+   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
+     ACM Transactions on Modeling and 
+     Computer Simulation 10. (2000) 348--357.
+   M. Matsumoto and T. Nishimura,
+     ``Mersenne Twister: a 623-dimensionally equidistributed
+       uniform pseudorandom number generator''
+     ACM Transactions on Modeling and 
+     Computer Simulation 8. (Jan. 1998) 3--30.
+
+   Any feedback is very welcome.
+   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "mt19937-64.h"
+
+mt19937* mt19937_new() {
+    mt19937* mt = (mt19937*)calloc(1, sizeof(mt19937));
+    mt->mti = NN+1;
+    return mt;
+}
+
+void mt19937_free(mt19937* this) {
+    free(this);
+}
+
+/* initializes mt[NN] with a seed */
+void mt19937_seed(mt19937* this, uint64_t seed)
+{
+    int mti;
+    uint64_t* mt = this->mt;
+
+    mt[0] = seed;
+    for (mti=1; mti<NN; mti++) 
+        mt[mti] =  (UINT64_C(6364136223846793005) * (mt[mti-1] ^ (mt[mti-1] >> 62)) + mti);
+
+    this->mti = mti;
+}
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+void mt19937_seed_by_array(mt19937* this, uint64_t init_key[], uint64_t key_length)
+{
+    unsigned int i, j;
+    uint64_t k;
+    uint64_t* mt = this->mt;
+    mt19937_seed(this, UINT64_C(19650218));
+    i=1; j=0;
+    k = (NN>key_length ? NN : key_length);
+    for (; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * UINT64_C(3935559000370003845)))
+          + init_key[j] + j; /* non linear */
+        i++; j++;
+        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
+        if (j>=key_length) j=0;
+    }
+    for (k=NN-1; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * UINT64_C(2862933555777941757)))
+          - i; /* non linear */
+        i++;
+        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
+    }
+
+    mt[0] = UINT64_C(1) << 63; /* MSB is 1; assuring non-zero initial array */ 
+}
+
+static uint64_t mag01[2]={UINT64_C(0), MATRIX_A};
+
+/* generates a random number on [0, 2^64-1]-interval */
+uint64_t mt19937_uint64(mt19937* this)
+{
+    int i;
+    uint64_t x;
+
+    int mti = this->mti;
+    uint64_t* mt = this->mt;
+
+    if (mti >= NN) { /* generate NN words at one time */
+
+        /* if init_genrand64() has not been called, */
+        /* a default initial seed is used     */
+        if (mti == NN+1)  {
+            mt19937_seed(this, UINT64_C(5489));
+            mti = this->mti;
+        }
+
+        for (i=0;i<NN-MM;i++) {
+            x = (mt[i]&UM)|(mt[i+1]&LM);
+            mt[i] = mt[i+MM] ^ (x>>1) ^ mag01[(int)(x&UINT64_C(1))];
+        }
+        for (;i<NN-1;i++) {
+            x = (mt[i]&UM)|(mt[i+1]&LM);
+            mt[i] = mt[i+(MM-NN)] ^ (x>>1) ^ mag01[(int)(x&UINT64_C(1))];
+        }
+        x = (mt[NN-1]&UM)|(mt[0]&LM);
+        mt[NN-1] = mt[MM-1] ^ (x>>1) ^ mag01[(int)(x&UINT64_C(1))];
+
+        mti = 0;
+    }
+  
+    x = mt[mti++];
+
+    x ^= (x >> 29) & UINT64_C(0x5555555555555555);
+    x ^= (x << 17) & UINT64_C(0x71D67FFFEDA60000);
+    x ^= (x << 37) & UINT64_C(0xFFF7EEE000000000);
+    x ^= (x >> 43);
+
+    this->mti = mti;
+
+    return x;
+}
+
+/* generates a random number on [0, 2^63-1]-interval */
+int64_t mt19937_int63(mt19937* this)
+{
+    return (int64_t)(mt19937_uint64(this) >> 1);
+}
+
+/* generates a random number on [0,1]-real-interval */
+double mt19937_real1(mt19937* this)
+{
+    return (mt19937_uint64(this) >> 11) * (1.0/9007199254740991.0);
+}
+
+/* generates a random number on [0,1)-real-interval */
+double mt19937_real2(mt19937* this)
+{
+    return (mt19937_uint64(this) >> 11) * (1.0/9007199254740992.0);
+}
+
+/* generates a random number on (0,1)-real-interval */
+double mt19937_real3(mt19937* this)
+{
+    return ((mt19937_uint64(this) >> 12) + 0.5) * (1.0/4503599627370496.0);
+}

package/pto/crypto/mt19937/c/mt19937-64.h

@@ -0,0 +1,96 @@
+/* 
+   A C-program for MT19937-64 (2014/2/23 version).
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   This is a 64-bit version of Mersenne Twister pseudorandom number
+   generator.
+
+   Before using, initialize the state by using init_genrand64(seed)  
+   or init_by_array64(init_key, key_length).
+
+   Copyright (C) 2004, 2014, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.                          
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote 
+        products derived from this software without specific prior written 
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   References:
+   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
+     ACM Transactions on Modeling and 
+     Computer Simulation 10. (2000) 348--357.
+   M. Matsumoto and T. Nishimura,
+     ``Mersenne Twister: a 623-dimensionally equidistributed
+       uniform pseudorandom number generator''
+     ACM Transactions on Modeling and 
+     Computer Simulation 8. (Jan. 1998) 3--30.
+
+   Any feedback is very welcome.
+   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
+*/
+
+#include <inttypes.h>
+
+#define NN 312
+#define MM 156
+#define MATRIX_A UINT64_C(0xB5026F5AA96619E9)
+#define UM UINT64_C(0xFFFFFFFF80000000) /* Most significant 33 bits */
+#define LM UINT64_C(0x7FFFFFFF) /* Least significant 31 bits */
+
+typedef struct mt19937 {
+    /* The array for the state vector */
+    uint64_t mt[NN]; 
+    /* mti==NN+1 means mt[NN] is not initialized */
+    int mti;
+} mt19937;
+
+mt19937* mt19937_new();
+void mt19937_free(mt19937* this);
+
+/* initializes mt[NN] with a seed */
+void mt19937_seed(mt19937* this, uint64_t seed);
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+void mt19937_seed_by_array(mt19937* this, uint64_t init_key[], uint64_t key_length);
+
+/* generates a random number on [0, 2^64-1]-interval */
+uint64_t mt19937_uint64(mt19937*);
+
+
+/* generates a random number on [0, 2^63-1]-interval */
+int64_t mt19937_int63(mt19937*);
+
+/* generates a random number on [0,1]-real-interval */
+double mt19937_real1(mt19937*);
+
+/* generates a random number on [0,1)-real-interval */
+double mt19937_real2(mt19937*);
+
+/* generates a random number on (0,1)-real-interval */
+double mt19937_real3(mt19937*);