## GOST 34.10 - A Brief Overview of Russia's DSA (1996)

### Cached

### Download Links

- [www.gemplus.com]
- [www.gemplus.com]
- [www.gemplus.com]
- [ftp.cert.dfn.de]
- [www.geocities.com]
- DBLP

### Other Repositories/Bibliography

Venue: | Computer Security |

Citations: | 2 - 0 self |

### BibTeX

@ARTICLE{Michels96gost34.10,

author = {Markus Michels and David Naccache and Holger Petersen and Gemplus Card International},

title = {GOST 34.10 - A Brief Overview of Russia's DSA},

journal = {Computer Security},

year = {1996},

volume = {15},

pages = {725--732}

}

### OpenURL

### Abstract

GOST 34.10 is Russia's DSA. Just as it's U.S. counterpart, GOST is an ElGamal like signature scheme used in Schnorr mode. It is close to NIST DSA in many aspects. In our paper we will first overview GOST 34.10 and discuss the three main di#erences between the two algorithms.

### Citations

2913 | A method for obtaining digital signatures and public-key cryptosystems
- Rivest, Shamir, et al.
- 1978
(Show Context)
Citation Context ... briefly described. 1 Introduction Since its invention by Diffie and Hellman in 1976 [3], many realizations for digital signatures have been proposed. The most famous among them are certainly the RSA =-=[19], -=-ElGamal [4], Schnorr’s [20] and the Fiat-Shamir scheme [6]. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signatur... |

2716 | New directions in cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ... 34.11 which uses the block cipher GOST 28147 (partially classified) as a building block. The hash function will be briefly described. 1 Introduction Since its invention by Diffie and Hellman in 1976 =-=[3], -=-many realizations for digital signatures have been proposed. The most famous among them are certainly the RSA [19], ElGamal [4], Schnorr’s [20] and the Fiat-Shamir scheme [6]. Several organizations ... |

1114 |
A public-key cryptosystem and a signature scheme based on discrete logarithms
- ElGamal
- 1985
(Show Context)
Citation Context ...ibed. 1 Introduction Since its invention by Diffie and Hellman in 1976 [3], many realizations for digital signatures have been proposed. The most famous among them are certainly the RSA [19], ElGamal =-=[4], -=-Schnorr’s [20] and the Fiat-Shamir scheme [6]. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signatures [14, 10], ... |

833 | How to prove yourself: Practical solutions to identification and signature problems
- Fiat, Shamir
- 1986
(Show Context)
Citation Context ...fie and Hellman in 1976 [3], many realizations for digital signatures have been proposed. The most famous among them are certainly the RSA [19], ElGamal [4], Schnorr’s [20] and the Fiat-Shamir schem=-=e [6]-=-. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signatures [14, 10], the American National Standard X9.30-199X RSA a... |

311 |
Efficient identification and signatures for smart cards
- Schnorr
- 1990
(Show Context)
Citation Context ...ction Since its invention by Diffie and Hellman in 1976 [3], many realizations for digital signatures have been proposed. The most famous among them are certainly the RSA [19], ElGamal [4], Schnorr’=-=s [20]-=- and the Fiat-Shamir scheme [6]. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signatures [14, 10], the American Nat... |

248 | New directions in cryptography - e, Hellman - 1976 |

84 | Message recovery for signature schemes based on the discrete logarithm problem - Nyberg - 1994 |

51 | Information technology – Security techniques – Digital signatures with appendix – Part 3: Certificate-based mechanisms - ISOIEC |

38 | Generating ElGamal signatures without knowing the secret key," Eurocrypt 96. Note that the version in the proceedings has an error. A revised version is available at the time of writing from /ElGamal.ps> [BLOWFISH] Schneier, B. "Description of a New Varia - Bleichenbacher - 1993 |

32 | Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem their Applications - Horster, Michels, et al. - 1994 |

13 | Meta-Multisignature schemes based on the discrete logarithm problem - Horster, Petersen - 1994 |

13 | collisions on DSS - Vaudenay - 1996 |

10 |
Precautions taken against various potential attacks
- Guillou, Quisquater, et al.
- 1991
(Show Context)
Citation Context ...lGamal [4], Schnorr’s [20] and the Fiat-Shamir scheme [6]. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signature=-=s [14, 10], -=-the American National Standard X9.30-199X RSA and the ElGamal signature scheme [1], ⋆ This work was done while visiting Gemplus PSI, Sarcelles, France.s2 Markus Michels, David Naccache, and Holger P... |

6 | The Fast Cascade Exponentiation Algorithm and its Applications on Cryptography - Yen, Laih - 1993 |

3 |
Verallgemeinerte elgamal signaturen
- Horster, Petersen
- 1994
(Show Context)
Citation Context ..., block cipher GOST 28147 – 89 [7]. The signature generation and verification procedures used by the standard are a modification of the DSA. This modification has also been proposed in the literatur=-=e [11, 17]. We-=- use the following notation which is adopted from the standard. B ∗ is the set of all finite words in the alphabet B = {0, 1} and h the hash function representing the message m in the word h(m) ∈ ... |

2 | Further comments on soviet encryption algorithm
- Charnes, O’Connor, et al.
- 1994
(Show Context)
Citation Context ...ia’s DSA 5 This block cipher is used in the Electronic Code Book Mode (ECB) during the computation of the hash function. For a description of this block cipher (in english) we refer to the literatur=-=e [2, 18]. We -=-use the following notation to describe the standard. Â is the positive integer corresponding to the binary record A (A ∈ B ∗ ), < N >k:= N (mod 2 k ), Vk(2) means the set of all binary words of l... |

2 |
Information Technology Security TechniquesDigital signature scheme giving message recovery
- ISOIEC
- 1991
(Show Context)
Citation Context ...lGamal [4], Schnorr’s [20] and the Fiat-Shamir scheme [6]. Several organizations proposed different digital signature standards. For example, the ISO/IEC 9796 specifies the RSA for digital signature=-=s [14, 10], -=-the American National Standard X9.30-199X RSA and the ElGamal signature scheme [1], ⋆ This work was done while visiting Gemplus PSI, Sarcelles, France.s2 Markus Michels, David Naccache, and Holger P... |

2 |
Soviet Encryption Algorithm
- Pieprzyk, Tombak
- 1994
(Show Context)
Citation Context ...ia’s DSA 5 This block cipher is used in the Electronic Code Book Mode (ECB) during the computation of the hash function. For a description of this block cipher (in english) we refer to the literatur=-=e [2, 18]. We -=-use the following notation to describe the standard. Â is the positive integer corresponding to the binary record A (A ∈ B ∗ ), < N >k:= N (mod 2 k ), Vk(2) means the set of all binary words of l... |

1 |
Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia
- Nyberg
- 1994
(Show Context)
Citation Context ..., block cipher GOST 28147 – 89 [7]. The signature generation and verification procedures used by the standard are a modification of the DSA. This modification has also been proposed in the literatur=-=e [11, 17]. We-=- use the following notation which is adopted from the standard. B ∗ is the set of all finite words in the alphabet B = {0, 1} and h the hash function representing the message m in the word h(m) ∈ ... |

1 | Y.Zheng, "Further comments on the Soviet Encryption Algorithm - Charnes, Pieprzyk - 1994 |

1 | S.Vanstone, "IEEE P1363 Part 6: Elliptic Curve Systems - Menezes - 1995 |