A signature scheme based on the intractability of computing roots
type: Item
instance of: scholarly article
title: A signature scheme based on the intractability of computing roots
zbMATH Open document ID: 1024.94009
DOI: 10.1023/A:1014927327846
author: Ingrid Biehl
author: Safuat Hamdy
author: Andreas Meyer
author: Johannes Buchmann
published in: Designs, Codes and Cryptography
publication date: 2003-03-19T00:00:00Z
review text: The authors introduce RDSA, a variant of the DSA signature scheme. The security of RDSA is based upon the intractability of extracting roots in a finite Abelian group. In fact, they 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. At the end of the paper they present an efficient implementation of RDSA in class groups of imaginary quadratic orders, which they call IQ-RDSA. They also give a table of timings in milliseconds for IQ-RDSA, as well as public key sizes given in bits.
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11R29
zbMATH DE Number: 1884808
zbMATH Keywords: signature schemes
zbMATH Keywords: RDSA
zbMATH Keywords: DSA
zbMATH Keywords: root problem
zbMATH Keywords: class groups
reviewed by: Richard A. Mollin
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1884808