// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: proto/rsa_ssa_pss.proto
package com.google.crypto.tink.proto;
public interface RsaSsaPssPrivateKeyOrBuilder extends
// @@protoc_insertion_point(interface_extends:google.crypto.tink.RsaSsaPssPrivateKey)
com.google.protobuf.MessageOrBuilder {
Required.
uint32 version = 1;
Returns: The version.
/**
* <pre>
* Required.
* </pre>
*
* <code>uint32 version = 1;</code>
* @return The version.
*/
int getVersion();
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
Returns: Whether the publicKey field is set.
/**
* <pre>
* Required.
* </pre>
*
* <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code>
* @return Whether the publicKey field is set.
*/
boolean hasPublicKey();
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
Returns: The publicKey.
/**
* <pre>
* Required.
* </pre>
*
* <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code>
* @return The publicKey.
*/
com.google.crypto.tink.proto.RsaSsaPssPublicKey getPublicKey();
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/**
* <pre>
* Required.
* </pre>
*
* <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code>
*/
com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder getPublicKeyOrBuilder();
Private exponent.
Unsigned big integer in bigendian representation.
Required.
bytes d = 3;
Returns: The d.
/**
* <pre>
* Private exponent.
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes d = 3;</code>
* @return The d.
*/
com.google.protobuf.ByteString getD();
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;
Returns: The p.
/**
* <pre>
* The following parameters are used to optimize RSA signature computation.
* The prime factor p of n.
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes p = 4;</code>
* @return The p.
*/
com.google.protobuf.ByteString getP();
The prime factor q of n.
Unsigned big integer in bigendian representation.
Required.
bytes q = 5;
Returns: The q.
/**
* <pre>
* The prime factor q of n.
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes q = 5;</code>
* @return The q.
*/
com.google.protobuf.ByteString getQ();
d mod (p - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dp = 6;
Returns: The dp.
/**
* <pre>
* d mod (p - 1).
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes dp = 6;</code>
* @return The dp.
*/
com.google.protobuf.ByteString getDp();
d mod (q - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dq = 7;
Returns: The dq.
/**
* <pre>
* d mod (q - 1).
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes dq = 7;</code>
* @return The dq.
*/
com.google.protobuf.ByteString getDq();
Chinese Remainder Theorem coefficient q^(-1) mod p.
Unsigned big integer in bigendian representation.
Required.
bytes crt = 8;
Returns: The crt.
/**
* <pre>
* Chinese Remainder Theorem coefficient q^(-1) mod p.
* Unsigned big integer in bigendian representation.
* Required.
* </pre>
*
* <code>bytes crt = 8;</code>
* @return The crt.
*/
com.google.protobuf.ByteString getCrt();
}