Basic Research for Realizing and Applying the Key Predistribution System

密钥预分配系统实现与应用的基础研究

• 批准号: 62460123
• 负责人: IMAI Hideki
• 金额: $ 4.54万
• 依托单位: Yokohama National University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (B)
• 财政年份: 1987
• 资助国家: 日本
• 起止时间: 1987 至 1988
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-62460123/
• 关键词: Key Predistribution System; KPS; Cryptography; Key-Sharing; Key-Distribution; IC Card; Linear Scheme; Secret Algorithm; Identity Transformer; 線形スキーム; 情報セキュリティ; 電子メール; トランスピュータ

In large and complicated modern open network systems, cryptography can be a significant means for secure communication with partners which are not given a priori. However, since the common-key cryptography is still dominant for practical purposes, the largest problem has been how to share a common key among the partners beforehand. Recently proposed notion of Key Predistribution System (KPS) is a novel candidate technology to remove the problem.This research project has been performed from 1987 to 1988 fiscal year, (1) to verify the realizability of KPS by the use of presently available electronics technology and (2) to confirm the basis of applications of KPS to various information systems. The main result for goal(l) is that a kind of realization scheme of KPS called the linear scheme is efficiently and securely realizable using IC cards. This conclusion is based on a deep theoretical and constructive and experimental study of the central part of the algorithm for each participant in a KPS. In particular we obtained a number of valuable insights into the structure of a kind of one-way random function which transforms the name of each participant into a long vector. The main results for goal(2) include demonstrations of the facts that any function of any common-key system can be utilized in any large network supported by KPS, and that KPS can realize one-way cryptographic communication, and so on. Moreover, we have been convinced that the linear scheme will be a very practical and useful tool for broad-sense networks through an examination of a plan of constructing a prototype KPS consisting of IC cards for each participant, interface devices for IC cards and non-cryptographic communication equipments, and devices for the management centers. Developing practical KPS based on these results will be a strongly recommended research theme.

在大型且复杂的现代开放网络系统中，密码学可能是与没有先验的合作伙伴进行安全沟通的重要手段。但是，由于普通键密码学仍然是实际目的的主导地位，因此最大的问题是如何事先在合作伙伴中共享一个共同的钥匙。最近提出的关键序列系统（KPS）的概念是一种新的候选技术，可以消除该问题。该研究项目是从1987年到1988财年进行的，（1）通过使用当前可用的电子技术和（2）确认KPS对各种信息系统的依据来验证KPS的可变性。目标（L）的主要结果是使用IC卡有效且可牢固地实现的KPS实现方案。该结论基于对KPS中每个参与者的算法中心部分的深刻理论，建设性和实验研究。特别是，我们获得了对单向随机函数的结构的许多有价值的见解，该函数将每个参与者的名称转换为长向量。目标（2）的主要结果包括证明以下事实：任何普通密钥系统的任何功能都可以在KPS支持的任何大型网络中使用，并且KP可以实现单向加密通信，依此类推。此外，我们已经确信，线性方案将是一个非常实用且有用的工具，可以通过检查为每个参与者构建由IC卡组成的原型KP的计划，IC卡和非元素通信设备的接口设备，以及用于管理中心的设备。基于这些结果开发实用的KP将是强烈推荐的研究主题。

项目成果

松本勉、今井秀樹: 電子情報通信学会論文誌. J71-A. 2046-2053 (1988)

Tsutomu Matsumoto，Hideki Imai：《电子、信息和通信工程师学会学报》J71-2053 (1988)。

T.Matsumoto: Lecture Notes on Computer Science Springer. 293. 185-193 (1988)

T.Matsumoto：《施普林格计算机科学讲义》。

高嶋洋一、松本勉、今井秀樹: 1989年暗号と情報セキュリティシンポジウム資料. (1989)

Yoichi Takashima、Tsutomu Matsumoto、Hideki Imai：1989 年密码学和信息安全研讨会材料 (1989)。

松本勉、高嶋洋一、今井秀樹: "暗号鍵の共有に役立つID変換アルゴリズムの構成とその評価" 電子情報通信学会論文誌(投稿中).

Tsutomu Matsumoto、Yoichi Takashima、Hideki Imai：“用于共享加密密钥的 ID 转换算法的配置和评估”电子、信息和通信工程师学会期刊（进行中）。

T.Matsumoto: Proceeding of 10th Symposium on Information Theory and Its Applications. 101-106 (1987)

T.Matsumoto：第十届信息论及其应用研讨会论文集。