Name
Abstract | ||
|---|---|---|
GOST 34.10 is Russia's DSA. Like its US counterpart, GOST is an ElGamal-like signature scheme used in Schnorr mode. It is similar to NIST DSA in many aspects. In this paper we will overview COST 34.10 and discuss the three main differences between the two algorithms. (i) GOST's principal design criterion does not seem to be computational efficiency: the algorithm is 1.6 times slower than the DSA and produces 512-bit signatures. This is mainly due to the usage of the modulus q which is at least 254 bits long. During verification, modular inverses are computed by exponentiation (while the Extended Euclidian algorithm is roughly 100 times faster for this parameter size) and the generation of the public parameters is much more complicated than in the DSA. This choice of the parameters makes GOST 34.10 very secure. (ii) COST signers do not have to generate modular inverses as the basic signature equation is s = xr + mk (mod q) instead of s := (m + xr)/k (mod q). (iii) GOST's hash function (the Russian equivalent of the SHA) is the standard GOST 34.11 which uses the block cipher COST 28147 (partially classified) as a building block. The hash function will be briefly described. Copyright (C) 1996 Elsevier Science Ltd |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/S0167-4048(96)00016-8 | COMPUTERS & SECURITY |
Keywords | DocType | Volume |
cryptography, data security, digital signature schemes, hash function, standardization, Russia | Journal | 15 |
Issue | ISSN | Citations |
8 | 0167-4048 | 4 |
PageRank | References | Authors |
0.62 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Michels | 1 | 635 | 57.87 |
| David Naccache | 2 | 1920 | 213.34 |
| Holger Petersen | 3 | 4 | 0.62 |