TY - JOUR
T1 - A new generic digital signature algorithm
AU - Seberry, Jennifer
AU - To, Vinhbuu
AU - Tonien, Dongvu
PY - 2011/12
Y1 - 2011/12
N2 - 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 toNumber: 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.
AB - 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 toNumber: 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.
KW - Circulant matrices group
KW - Digital signature
KW - Discrete log problem
UR - http://www.scopus.com/inward/record.url?scp=84858406802&partnerID=8YFLogxK
U2 - 10.1515/GCC.2011.008
DO - 10.1515/GCC.2011.008
M3 - Article
SN - 1867-1144
VL - 3
SP - 221
EP - 237
JO - Groups, Complexity, Cryptology
JF - Groups, Complexity, Cryptology
IS - 2
ER -