public interface RsaSsaPssPrivateKeyOrBuilder
extends com.google.protobuf.MessageLiteOrBuilder
| Modifier and Type | Method and Description |
|---|---|
com.google.protobuf.ByteString |
getCrt()
Chinese Remainder Theorem coefficient q^(-1) mod p.
|
com.google.protobuf.ByteString |
getD()
Private exponent.
|
com.google.protobuf.ByteString |
getDp()
d mod (p - 1).
|
com.google.protobuf.ByteString |
getDq()
d mod (q - 1).
|
com.google.protobuf.ByteString |
getP()
The following parameters are used to optimize RSA signature computation.
|
RsaSsaPssPublicKey |
getPublicKey()
Required.
|
com.google.protobuf.ByteString |
getQ()
The prime factor q of n.
|
int |
getVersion()
Required.
|
boolean |
hasPublicKey()
Required.
|
int getVersion()
Required.
uint32 version = 1;boolean hasPublicKey()
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;RsaSsaPssPublicKey getPublicKey()
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;com.google.protobuf.ByteString getD()
Private exponent. Unsigned big integer in bigendian representation. Required.
bytes d = 3;com.google.protobuf.ByteString getP()
The following parameters are used to optimize RSA signature computation. The prime factor p of n. Unsigned big integer in bigendian representation. Required.
bytes p = 4;com.google.protobuf.ByteString getQ()
The prime factor q of n. Unsigned big integer in bigendian representation. Required.
bytes q = 5;com.google.protobuf.ByteString getDp()
d mod (p - 1). Unsigned big integer in bigendian representation. Required.
bytes dp = 6;com.google.protobuf.ByteString getDq()
d mod (q - 1). Unsigned big integer in bigendian representation. Required.
bytes dq = 7;com.google.protobuf.ByteString getCrt()
Chinese Remainder Theorem coefficient q^(-1) mod p. Unsigned big integer in bigendian representation. Required.
bytes crt = 8;