Prev Package | Next Package | Frames | No Frames |

## Class Summary

DSSSignature The DSS (Digital Signature Standard) algorithm makes use of the following parameters: - p: A prime modulus, where
`2`

for^{L-1}< p < 2^{L}`512 <= L <= 1024`

and`L`

a multiple of`64`

. - q: A prime divisor of
`p - 1`

, where`2`

.^{159}< q < 2^{160} - g: Where
`g = h`

, where^{(p-1)}/q mod p`h`

is any integer with`1 < h < p - 1`

such that`h`

(^{ (p-1)}/q mod p > 1`g`

has order`q mod p`

). - x: A randomly or pseudorandomly generated integer with
`0 < x < q`

. - y:
`y = g`

.^{x}mod p - k: A randomly or pseudorandomly generated integer with
`0 < k < q`

.

The integers

`p`

,`q`

, and`g`

can be public and can be common to a group of users.DSSSignatureRawCodec An object that implements the `ISignatureCodec`

operations for the*Raw*format to use with DSS signatures.DSSSignatureX509Codec An implementation of an `ISignatureCodec`

that knows to encode and decode DSS signatures into the raw bytes which would constitute a DER-encoded form of the ASN.1 structure defined in RFC-2459, and RFC-2313 as described in the next paragraphs.- p: A prime modulus, where