Uses of Interface gnu.java.security.sig.ISignature

The DSS (Digital Signature Standard) algorithm makes use of the following parameters:

1. p: A prime modulus, where 2L-1 < p < 2L for 512 <= L <= 1024 and L a multiple of 64.
2. q: A prime divisor of p - 1, where 2159 < q < 2160.
3. g: Where g = h(p-1)/q mod p, where h is any integer with 1 < h < p - 1 such that h (p-1)/q mod p > 1 (g has order q mod p).
4. x: A randomly or pseudorandomly generated integer with 0 < x < q.
5. y: y = gx mod p.
6. 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.

A base abstract class to facilitate implementations of concrete Signatures.

Returns an instance of a signature-with-appendix scheme given its name.

The RSA-PKCS1-V1.5 signature scheme is a digital signature scheme with appendix (SSA) combining the RSA algorithm with the EMSA-PKCS1-v1_5 encoding method.

The RSA-PSS signature scheme is a public-key encryption scheme combining the RSA algorithm with the Probabilistic Signature Scheme (PSS) encoding method.

Returns a new instance of an RSA Signature given its name.