Name
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 toNumber : G -> Z. 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1515/GCC.2011.008 | GROUPS COMPLEXITY CRYPTOLOGY |
Keywords | Field | DocType |
Digital signature, discrete log problem, circulant matrices group | Elliptic Curve Digital Signature Algorithm,KCDSA,ElGamal signature scheme,Theoretical computer science,Digital signature,Digital Signature Algorithm,Genetic algorithm,Mathematics,Schnorr signature,Discrete logarithm | Journal |
Volume | Issue | ISSN |
3 | 2 | 1867-1144 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jennifer Seberry | 1 | 987 | 250.36 |
| Vinhbuu To | 2 | 0 | 0.34 |
| Dongvu Tonien | 3 | 84 | 9.91 |