Digital Signature Algorithm(DSA)

three public parameters:

1.160-bit prime number q is chosen;

2.prime number p is selected with a length between 512 and 1024 bits , such that q divides(p-1).

3.g is chosen to be of the form h^((p-1)/q)mod p.   1<g<p-1.

With these numbers in hand, each user selects a private key and genertes a public key. The private key x must be a number from 1 to q-1 and should be chose randomly or pseudorandomly. The public key is calculated from the private key as y=g^x mod p. The calculation of y given x is relatively straightforward. However, given the public key y, it is believed to be computationally infeasible to determine x, which is the discrete logarithm of y to the base g, mod p.

转载于:https://www.cnblogs.com/songwanzi/p/3415156.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值