Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/a-new-generic-digital-signature-algorithm-ZFf7cbMrQP
- Publisher
- de Gruyter
- Copyright
- © de Gruyter 2011
- ISSN
- 1867-1144
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc.2011.008
- Publisher site
- See Article on Publisher Site
Abstract
Abstract. In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have become NIST standard and have been widely used in almost all commercial applications. We will show that the two algorithms are actually `the same' algebraically and propose a generic algorithm such that both DSA and ECDSA are instances of it. By looking at this special angle through the generic algorithm, we gain a new insight into the two algorithms DSA and ECDSA. Our new proposed digital signature algorithm is described generically using a group G and a map 𝚝𝚘𝙽𝚞𝚖𝚋𝚎𝚛 : G →→ ℤℤ . As an illustration, we choose G to be a group of non-singular circulant matrices over finite field and describe a totally new concrete digital signature algorithm.
Journal
Groups - Complexity - Cryptology – de Gruyter
Published: Dec 1, 2011
Keywords: Digital signature; discrete log problem; circulant matrices group