A conference key distribution system based on the Lagrange interpolating polynomial

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? Pub Date : 1988-03-27 DOI:10.1109/INFCOM.1988.13027

E. Lu, Wen-Yih Hwang, L. Harn, J. Lee

引用次数: 4

Abstract

A conference key distribution system (CKDS) can provide a common secret communication key to a set of M stations. A CKDS based on Lagrange interpolating polynomial is introduced. It is easy to see that breaking this system is equivalent to break the Diffie-Hellman public-key distribution system. This conference key is selected by the conference chairstation and hidden in the Lagrange interpolating polynomial. Recovering this key by each participating station only requires M-1 multiplications and M-2 additions over a finite field GF(P).<>

查看原文本刊更多论文

基于拉格朗日插值多项式的会议密钥分配系统

会议密钥分配系统(CKDS)可以为一组M个站点提供一个通用的秘密通信密钥。介绍了一种基于拉格朗日插值多项式的CKDS算法。很容易看出，破坏这个系统相当于破坏了Diffie-Hellman公钥分发系统。该会议密钥由会议主持人选择并隐藏在拉格朗日插值多项式中。在有限域GF(P)上，每个参与站点只需要M-1次乘法和M-2次加法即可恢复该密钥。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?

自引率

0.00%

发文量