A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups

被引：3

作者：

Blaney, Kenneth R. ^{[1
]}

Nikolaev, Andrey ^{[1
]}

机构：

[1] Stevens Inst Technol, Dept Math Sci, Hoboken, NJ 07030 USA

来源：

GROUPS COMPLEXITY CRYPTOLOGY | 2016年 / 8卷 / 01期

关键词：

Anshel-Anshel-Goldfeld protocol; key establishment; conjugacy problem; generalized Heisenberg group;

D O I：

10.1515/gcc-2016-0003

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We examine the Anshel-Anshel-Goldfeld key exchange protocol with a generalized Heisenberg group, H-m, as a platform. We show that subgroup-restricted simultaneous conjugacy search problem in H-m can be solved in quasi-quintic time, which allows the computation of the private keys of the parties.

引用

页码：69 / 74

页数：6

共 14 条

[1] Anshel I, 1999, MATH RES LETT, V6, P287
[2] HERMITE NORMAL-FORM COMPUTATION USING MODULO DETERMINANT ARITHMETIC
DOMICH, PD
KANNAN, R
TROTTER, LE
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) : 50 - 59
[3] Eick B., 2004, PREPRINT
[4] Hofheinz D, 2003, LECT NOTES COMPUT SC, V2567, P187
[5] Heisenberg Groups as Platform for the AAG key-exchange protocol
Kahrobaei, Delaram
Lam, Ha T.
[J]. 2014 IEEE 22ND INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP), 2014, : 660 - 664
[6] Ko KH, 2000, LECT NOTES COMPUT SC, V1880, P166
[7] Lee SJ, 2002, LECT NOTES COMPUT SC, V2332, P14
[8] Macdonald J., 2015, PREPRINT
[9] Micciancio D., 2000, 74 U CAL DEP COMP SC
[10] Myasnikov AD, 2007, LECT NOTES COMPUT SC, V4450, P76

← 1 2 →