A signature scheme based on the intractability of computing roots

被引：13

作者：

Biehl, I ^{[1
]}

Buchmann, J ^{[1
]}

Hamdy, S ^{[1
]}

Meyer, A ^{[1
]}

机构：

[1] Tech Univ Darmstadt, Fachbereich Informat, D-64283 Darmstadt, Germany

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2002年 / 25卷 / 03期

关键词：

signature schemes; RDSA; DSA; root problem; class groups;

D O I：

10.1023/A:1014927327846

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present RDSA, a variant of the DSA signature scheme, whose security is based on the intractability of extracting roots in a finite abelian group. We prove that RDSA is secure against an adaptively chosen message attack in the random oracle model if and only if computing roots in the underlying group is intractable. We report on a very efficient implementation of RDSA in the class group of imaginary quadratic orders. We also show how to construct class groups of algebraic number fields of degree > 2 in which RDSA can be implemented.

引用

页码：223 / 236

页数：14

共 27 条

[1] [Anonymous], THESIS TU DARMSTADT
[2] Bellare M., 1993, CCS 93 P 1 ACM C COM, P62, DOI DOI 10.1145/168588.168596
[3] Borevich Z.I., 1966, Number Theory
[4] Brickell E, 2000, LECT NOTES COMPUT SC, V1751, P276
[5] Buchmann J., 1988, Journal of Cryptology, V1, P107, DOI 10.1007/BF02351719
[6] Buchmann J, 1997, LECT NOTES COMPUT SC, V1294, P385
[7] COHEN H, 1987, MATH COMPUT, V48, P123, DOI 10.1090/S0025-5718-1987-0866103-4
[8] COHEN H, 1984, LECT NOTES MATH, V1068, P33
[9] COHEN H, 1984, LECT NOTES MATH, V1052, P26
[10] COX DA, 1989, PRIMES FORM X2 PLUS

← 1 2 3 →