---

[SSI32 Random Number Generator]
　
--- SSI32 is now in ISMLIB( http://www.ism.ac.jp/ismlib/jpn/ismlib/soft.html#ssi32).
　
SSI32 generates random numbers non-recursively (= generates the k-th random number directly),
and is suitable for parallel computations. For details, see
　
H. Yaguchi and I. Kubo : A new nonrecursive pseudorandom number generator based on chaos mappings.
Monte Carlo Methods Appl. Vol. 14 No. 1 (2008), pp. 87-102.
　
--- Sample code of using SSI32
............... Using SSI32 on MPI (we recommend mpisize>=4)
............... Using SSI32 on a single PC (for Visual C++) (not recommended)
　
--- Appearance of hexadecimal characters in successive 211,106,232,532,992 SSI32 random numbers The result
　

---

　
[SSI64 Random Number Generator]
　
SSI64 generates 64-bit random numbers non-recursively. (Use a compiler Icl(64-bit) or gcc(64-bit))
............... SSI64rand.c
............... About SSI64rand 　

---

　
[Presentation at the rump session of ASIACRYPT 2011]
　
Construction and security of a non-algebraic tiny and extensible hash function
　
( ASIACRYPT 2011 Rump Session)
　

---

　
[科研費報告書資料] (Document for Kakenhi Research Report)
　
新しい非再帰型擬似乱数生成法とハッシュ関数への応用
(New nonrecursive pseudo-random number generator and its application to hash function) (in Japanese)
　

---

　
[Academic product : MBnhash hash function] 　
　
Modified Beta n-bit hash function (n=160, 192, 256, 512, 1024, 2048, 4096)
............... About MBnhash ( -> see the appendix in English)
............... Source code of MBnhash (academic code)
............... High speed version (academic code)( Use Intel's icl(64-bit) or gcc(64bit))
　
............... Source code of SSInhash (academic code)
............... About SSInhash
　

---

　
[講義]〜 無限粒子系，乱数生成とハッシュ関数 〜
　

---