首页> 外文期刊>Computers & Security >GOST 34.10—a brief overview of Russia's DSA
【24h】

GOST 34.10—a brief overview of Russia's DSA

机译:GOST 34.10-俄罗斯DSA的简要概述

获取原文
获取原文并翻译 | 示例

摘要

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 GOST 34.10 and discuss the three main differences between the two algorithms, (ⅰ) 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, (ⅱ) GOST 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). (ⅲ) GOST's hash function (the Russian equivalent of the SHA) is the standard GOST 34.11 which uses the block cipher GOST 28147 (partially classified) as a building block. The hash function will be briefly described.
机译:GOST 34.10是俄罗斯的DSA。与美国同类产品一样,GOST是在Schnorr模式下使用的类似ElGamal的签名方案。它在许多方面类似于NIST DSA。在本文中,我们将概述GOST 34.10并讨论这两种算法之间的三个主要区别:(ⅰ)GOST的主要设计准则似乎并不是计算效率:该算法比DSA慢1.6倍,并产生512位签名。这主要是由于使用了至少254位长的模数q。在验证期间,通过取幂来计算模逆(而对于该参数大小,扩展Euclidian算法的速度大约快100倍),并且公共参数的生成比DSA中的复杂得多。参数的选择使GOST 34.10非常安全,(ⅱ)GOST签名者不必生成模逆,因为基本签名方程是s = xr + mk(mod q)而不是s:=(m + xr)/ k (mod q)。 (ⅲ)GOST的哈希函数(相当于SHA的俄语)是标准GOST 34.11,它使用分组密码GOST 28147(部分分类)作为构造块。将简要描述哈希函数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号