Design and analysis of public-key encryption algorithms from computationally intractable problems.

从计算上棘手的问题来设计和分析公钥加密算法。

• 批准号: 10205220
• 负责人: SAKURAI Kouichi
• 金额: $ 0.77万
• 依托单位: Kyushu University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research on Priority Areas (B)
• 财政年份: 1998
• 资助国家: 日本
• 起止时间: 1998 至 2000
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-10205220/
• 关键词: public-key encryption; digital signature; information security; number theory; algorithm; computational complexity; elliptic-curve; lattice-based cryptosystems; 暗号; ハッシュ関数; RSA; 格子; 暗号プロトコル; 分散暗号; 閾値暗号; 秘密分散; ユークリッド法; 公開カギ暗号; 格子問題; NP困難

(1) Survey recent results on the gap between the average-case complexity and the worst-case complexity on computationally intractable problems, then consider the cryptographic application of these problem.(2) Design (hyper) elliptic-curve cryptosystems, and report their practical performances from software-implementation.(3) Develop new techniques of provable security in public-key encryption schemes, and clarify advantages of applied schemes over the existing schemes.(4) The investigator, Okamoto organized the international cryptographic conference. ASIACRYPTO2000 (Dec. 2000, Kyoto) as the Program-Chair and the head investigator, SAKURAI worked as a member of the Program-comittee. More than 250-people attended with successful conference.(5) The investigator, Okamoto opened the 1st workshop, "number-theoretic algorithms and their applications. " More than 100-researchers including mathematicans and computer-scientists attended for discussing. The head investigator, SAKURAI gave a talk as a result of this research-project.

（1）调查的最新结果关于平均案例复杂性与计算上棘手问题的最差复杂性之间的差距之间的差距，然后考虑这些问题的加密应用程序。（2）设计（超）椭圆形曲线加密系统的设计（超级）椭圆形的加密系统，并报告其在软件象征中的实践表演，并在软件实现中进行了新的应用程序。计划。（4）冈本调查员组织了国际加密会议。 Asiacrypto2000（2000年12月，京都）担任计划主持人和首席调查员，Sakurai曾担任该计划仪式的成员。超过250人参加了成功的会议。（5）冈本调查员开设了第一届研讨会，“数字理论算法及其应用程序。”超过100多名研究人员，包括数学家和计算机科学家参加了讨论。首席调查员樱木是由于这项研究项目的演讲。

项目成果

M.Shingo,K.Sakurai,and M.Yung: "On distributed RSA-signing/encryption with no dealer"Ieice Trans.Special section of discrete math.and ts applications. (To appear). (2001)

M.Shingo、K.Sakurai 和 M.Yung：“关于无经销商的分布式 RSA 签名/加密”Ieice Trans. 离散数学和 ts 应用程序的特殊部分。

T. Itoh, M. Burmester, Y. Desmdet, K. SAKURAI, and H. Shizuya: "Divertible and subliminal-free zero-knowledge proofs for languages"J. of Cryptology. Vol. 12. 197-223 (1999)

T. Itoh、M. Burmester、Y. Desmdet、K. SAKURAI 和 H. Shizuya：“语言的可转换且无潜意识的零知识证明”J.

M.Abe and T.Okamoto: "Provably secure partially blind signatures"Proc.CRYPTO2000, Springer. LNCS 1880. 271-286 (2000)

M.Abe 和 T.Okamoto：“可证明安全的部分盲签名”Proc.CRYPTO2000，Springer。

Okamoto T., Uchiyama S.: "A new public-key cryptosystem as secure as factoring"Advances in Cryptology-Eurocrypt 98 Proceedings,LNCS. Vol.1403. 308-318 (1998)

Okamoto T.、Uchiyama S.：“一种与保理一样安全的新公钥密码系统”密码学进展 - Eurocrypt 98 论文集，LNCS。

T.Okammoto: "Provable Security of Practical Public-key Encryption Schene" Joint Workshop Proc. Information Security (JWIS‘98). 67-79 (1998)

T. Okammoto：“实用公钥加密方案的可证明安全性”联合研讨会信息安全 (JWIS’98) (1998)。