Studies on High-Speed Encryption-/Signature-Schemes Based on Obscure Representations

基于模糊表示的高速加密/签名方案研究

• 批准号: 60460128
• 负责人: IMAI Hideki
• 金额: $ 4.48万
• 依托单位: Yokohama National University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (B)
• 财政年份: 1985
• 资助国家: 日本
• 起止时间: 1985 至 1986
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-60460128/
• 关键词: Public key cryptosystems; Public key signature systems; Multivariate-polynomial-tuple asymmetric cryptosystems; Occam; Transputer; Obscure representation; Algorithm composition method; 暗号装置

This project was performed during the 1985-1986 fiscal years for developing and realizing a high-speed encryption/signature system. We have obtained the following results:1) We have proposed a novel asymmetric cryptosystem C(m,n), which is a kind of asymmetric bijective cryptosystems and has multivariate-polynomial-tuples as its public keys. The system C(m,n) is constructed by the "algorithm composition method" born from our deep study on the "obscure representations" of functions. One of the greatest advantages is its processing speed. This comes from the fact that its structure is suitable for highly parallel processing. The security of C(m,n) is essentially determined by the difficulty of solving a system of multivariate algebraic equations corresponding to its public key.2) We have developed a set of algorithms for C(m,n) using several techniques including the normal basis multiplier, pipeline and array architectures. The algorithms are described in occam2, a programming language oriented to parallel processing.3) By some experiments of implementing these algorithms on a machine consists of 10 transputers, we have confirmed the high-speed nature of C(m,n). Here, a transputer is a general-purpose 32-bit microprocessor having four communication links to others. In a 527-bit block cryptosystem C(31,17), our experiments shows that the public- [secret-, resp.] transformation runs about 8.1 kbps [4.6 kbps, resp.].4) Finally, by evaluating the above theoretical and experimental experiences, we have proposed some essential requirements for the practical realization of C(m,n). In particular, we have designed a hardware architecture which can be expected to achieve around 1 Mbps with relatively small scale hardware.

该项目是在1985-1986财政年度为开发和实现高速加密/签名系统而实施的。1)提出了一种新的非对称双射密码体制C(m，n)，它是一种以多元多项式元组为公钥的非对称双射密码体制。系统C(m，n)是由我们对函数的“模糊表示”的深入研究而产生的“算法合成法”构造的。最大的优势之一是它的处理速度。这是因为它的结构适合于高度并行处理。C(m，n)的安全性本质上取决于求解与其公钥对应的多元代数方程组的难度。2)我们利用正规基乘法器、流水线和阵列结构等多种技术开发了一套计算C(m，n)的算法。用面向并行处理的程序设计语言occam2对算法进行了描述。3)通过在一台由10台Transputer组成的机器上实现这些算法的实验，我们证实了C(m，n)的高速特性。这里，Transputer是一个通用的32位微处理器，与其他微处理器之间有四条通信链路。在一个527位的分组密码体制C(31，17)中，我们的实验表明公开的-[秘密-，分别是.]变换运行约8.1kbps[分别为4.6kbps]。4)最后，通过对上述理论和实验经验的评估，我们提出了C(m，n)的实际实现的一些基本要求。特别是，我们设计了一种硬件架构，可以在相对较小的硬件规模下实现约1 Mbps的速度。

项目成果

Hideki Iwai: Proceedings of the 3rd International Conference on Applied Algebra,Algebraic Algorithms and Symbolic Computation,Error Corrocting Codes(Grenoble). (1985)

岩井英树：第三届应用代数、代数算法和符号计算、纠错码国际会议论文集（格勒诺布尔）。

Hideki IMAI: "Algebraic Methods for Constructing Asymmetric Cryptosystems" Proceedings of the 3rd International Conference on Applied Algebra, Algebraic Algorithms and Symbolic Computation, Error Correcting Codes (Grenoble). (1985)

Hideki IMAI：“构造非对称密码系统的代数方法”第三届应用代数、代数算法和符号计算、纠错码国际会议论文集（格勒诺布尔）。

Tsutomu MATSUMOTO: "On Multivariate-Polynomial-Tuple Asymmetric Cryptosystems" Paper of Technical Group, TGIT85-88 (or TGAL85-82), The Institute of Electronics and Communication Engineers of Japan. 85-318. 55-60 (1986)

Tsutomu MATSUMOTO：日本电子通信工程师学会技术组 TGIT85-88（或 TGAL85-82）的“论多元多项式元组非对称密码系统”论文。

松本勉: 電子通信学会技術研究報告(IT85-88又はAL85-82). 85-318. 55-60 (1986)

Tsutomu Matsumoto：IEICE 技术研究报告（IT85-88 或 AL85-82）。

松本勉: 電子通信学会技術研究報告(IT86-6). 86-29. 29-33 (1986)

Tsutomu Matsumoto：IEICE 技术研究报告 (IT86-6)。 29-33 (1986)。