Design of cryptographicaly nonlinear transformation based on chaos
| Project/Area Number |
25820167
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Sojo University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2013: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | カオス / 共通鍵暗号 / S-box / 公開鍵暗号 / Chebyshev多項式 / ２べき剰余環 / 暗号 / 剰余環 / チェビシェフ多項式 / 離散化 |
|---|
| Outline of Final Research Achievements |
The purpose of this study is the design of chaotic map over finite sets and its applications to cryptography. Firstly, we propose to construct one-to-one chaotic maps over integer sets. Since S-box is the most important portion in block cipher, we design low complexity S-boxes based on the chaotic maps. As a result, difference probability of the proposed S-boxes is improved by about 98% compared with that of AES. Moreover, the area and power consumption of the proposed S-box circuits are improved compared with that of AES by about 72% and 84%, respectively. We also evaluate the security of public-key cryptography based on Chebyshev polynomials modulo powers of two. Unfortunately, it is revealed that the cryptosystem is not secure by our security analysis.
|
Report
(4 results)
Research Products
(13 results)
