A signature scheme based on the intractability of computing roots

被引：14
作者：
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 条
[11]   A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS [J].
ELGAMAL, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :469-472
[12]  
*FED INF PROC, FED INF PROC STAND P, V1862
[13]  
GIRAULT M, 1991, LECT NOTES COMPUT SC, V473, P481
[14]  
Hamdy S, 2000, LECT NOTES COMPUT SC, V1976, P234
[15]  
Horster P., 1994, 2nd ACM Conference on Computer and Communications Security, P96, DOI 10.1145/191177.191197
[16]  
Lang S., 2003, GRADUATE TEXTS MATH, V110
[17]  
Menezes A. J, 1997, HDB APPL CRYPTOGRAPH
[18]  
NEIS S, 2000, THESIS TU DARMSTADT
[19]   Security arguments for digital signatures and blind signatures [J].
Pointcheval, D ;
Stern, J .
JOURNAL OF CRYPTOLOGY, 2000, 13 (03) :361-396
[20]  
Pointcheval D, 1996, LECT NOTES COMPUT SC, V1070, P387
123