| Creator |
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Rights |
|
| Related DOI |
|
|
|
|
|
|
|
| Related URI |
|
|
|
|
|
|
|
| Relation |
|
|
|
|
|
|
|
| Abstract |
近年，IC カードなどの小型デバイスを用いた電子的な認証が広く行われるようになり，暗号化として処理の軽い 一方向ハッシュ関数が用いられることがある．しかし，ハッシュ化した電子的な情報による識別に必要な時間は，識 別する対象の候補の数に比例し，大規模なシステムには適用できない．本稿では，識別とそれに対する攻撃の定式化 を行い，ハッシュを用いた識別の計算時間について考察を行う．
Electronic a...uthentication with a portable device such as a smart card has been receiving increasing attention. For portable devices with a poor computation resource, one-way hash functions are used as a cryptography technology for secure authentication. However the computing time of an identification with hashed data is proportional to the number of the users, and therefore it is not practical for large-scale systems. This paper introduces a formalization of identification and two kinds of attacks, and analyzes the computing time of an identification of a user.show more
|
Export Mendeley
toru06_1