排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Ingrid Biehl Johannes Buchmann Safuat Hamdy Andreas Meyer 《Designs, Codes and Cryptography》2002,25(3):223-236
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. 相似文献
1