Research of hash functions based on algorithm of nonrecursive pseudorandom number generator
| Project/Area Number |
23500086
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Mie University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | ハッシュ関数 / ネットワーク / セキュリティ / アルゴリズム / 乱数 / ベータ変換 / 代数方程式 / 超越数 / 安全性 |
|---|
| Research Abstract |
In this research, developing the algorithm of recently introduced nonrecursive pseudorandom number generator SSI32, we constructed, by repeating multiplication of integers and shift, the hash function MBnhash whose hash values are 160, 192, ..., 4092. Mathematically we can regard the algorithm of MBnhash as repetition of beta-transformation M(t)=bt-[bt]+1 (b=beta) on [1,2), which is quite different from other algebraic hash functions. We also showed the security of MBnhash based on the fact that we have no general algorithm of solving algebraic equations whose degrees are higher than 4.
|
Report
(4 results)
Research Products
(13 results)
