| Project/Area Number |
15K16004
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Information security
|
|---|
| Research Institution | Japan Advanced Institute of Science and Technology |
|---|
Principal Investigator |
CHEN Jiageng 北陸先端科学技術大学院大学, 情報科学研究科, 助教 (90640748)
|
|---|
| Project Period (FY) |
2015-04-01 – 2016-03-31
|
| Project Status |
Discontinued (Fiscal Year 2015)
|
| Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2018: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2017: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2016: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | cryptanalysis / lightweight block cipher |
|---|
| Outline of Annual Research Achievements |
1. To implement robust and secure pseudo-random number generators (PRNG) is a challenging issue for low-cost Radio-frequency identification (RFID) tags. In this first research, we study the security of LFSR-based PRNG implemented on EPC Gen2 tags and exploit LFSR-based PRNG to provide a better constructions. We provide a cryptanalysis against the J3Gen which is LFSR-based PRNG and proposed by Sugei et al. for EPC Gen2 tags using distinguish attack and make observations on its input using NIST randomness test. We also test the PRNG in EPC Gen2 RFID Tags by using the NIST SP800-22. As a counter-measure, we propose two modified models based on the security analysis results. We show that our results perform better than J3Gen in terms of computational and statistical property.
2. Integral attack can be considered as the deterministic version of the statistical saturation attack,
which works by tracing the properties of the integral sets after certain rounds of encryption.
In this second research, we provide the first study on how to take advantage of the integral attack and apply it to cryptanalysis by using statistical approach. One of our contributions is to firstly apply the internal collision of a set as the evaluated statistics and show how this property can be efficiently propagated in the General Feistel Structure (GFS) with bijective map S-Box. Secondly, we provide a simple statistical framework to evaluate the data complexity. Finally, we evaluate several GFS and find out for some of the designs, our approach provide a better result compared with other statistical attack.
|
Report
(1 results)
Research Products
(1 results)
