Public key exchange using matrices over group rings

被引：48

作者：

Kahrobaei, Delaram ^{[1
]}

Koupparis, Charalambos ^{[1
]}

Shpilrain, Vladimir ^{[2
]}

机构：

[1] CUNY, CUNY Grad Ctr, 365 Fifth Ave, New York, NY 10016 USA

[2] CUNY, Dept Math, New York, NY 10031 USA

来源：

GROUPS COMPLEXITY CRYPTOLOGY | 2013年 / 5卷 / 01期

基金：

美国国家科学基金会;

关键词：

Public key exchange; Diffie-Hellman; group ring;

D O I：

10.1515/gcc-2013-0007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This "nested structure" of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) and Computational Diffie-Hellman (CDH) problems for our platform.

引用

页码：97 / 115

页数：19

共 7 条

[1]

Boneh D., 1998, Algorithmic Number Theory. Third International Symposium, ANTS-III. Proceedings, P48, DOI 10.1007/BFb0054851

[2] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654

[3]

Gibbons J., 1992, NONPARAMETRIC STAT I

[4]

Kasper E., 2011, FINANCIAL CRYPTOGRAP, V7126, P27, DOI [10.1007/978-3-642-29889-9_4, DOI 10.1007/978-3-642-29889-9_4]

[5]

Menezes A. J., 1997, HDB APPL CRYPTOGRAPH

[6]

Pollard J., 1978, MATH COMPUT, V32, P331

[7]

Shanks D., 1971, ANAL NUMBER THEORY, V20, P415

← 1 →