APPENDIX 5. EXAMPLE OF THE DSA
This appendix is for informational purposes only and is not required to meet the standard. Let L = 512 (size of p). The values in this example are expressed in hexadecimal notation. The p and q given here were generated by the prime generation standard described in appendix 2 using the 160-bit SEED:
- d5014e4b 60ef2ba8 b6211b40 62ba3224 e0427dd3
With this SEED, the algorithm found p and q when the counter was at 105. x was generated by the algorithm described in appendix 3, section 3.1, using the SHA-1 to construct G (as in appendix 3, section 3.3) and a 160-bit XKEY: X
KEY =
- bd029bbe 7f51960b cf9edb2b 61f06f0f eb5a38b6
t =
- 67452301 EFCDAB89 98BADCFE 10325476 C3D2E1F0
x = G(t,XKEY) mod q
k was generated by the algorithm described in appendix 3, section 3.2, using the SHA-1 to construct G (as in appendix 3, section 3.3) and a 160-bit KKEY:
KKEY =
- 687a66d9 0648f993 867e121f 4ddf9ddb 01205584
t =
- EFCDAB89 98BADCFE 10325476 C3D2E1F0 67452301
k = G(t,KKEY) mod q
Finally:
h = 2
p =
- 8df2a494 492276aa 3d25759b b06869cb eac0d83a fb8d0cf7 cbb8324f 0d7882e5 d0762fc5 b7210eaf c2e9adac 32ab7aac
21
