// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: proto/rsa_ssa_pss.proto

package com.google.crypto.tink.proto;

key_type: type.googleapis.com/google.crypto.tink.RsaSsaPssPrivateKey
Protobuf type google.crypto.tink.RsaSsaPssPrivateKey
/** * <pre> * key_type: type.googleapis.com/google.crypto.tink.RsaSsaPssPrivateKey * </pre> * * Protobuf type {@code google.crypto.tink.RsaSsaPssPrivateKey} */
public final class RsaSsaPssPrivateKey extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:google.crypto.tink.RsaSsaPssPrivateKey) RsaSsaPssPrivateKeyOrBuilder { private static final long serialVersionUID = 0L; // Use RsaSsaPssPrivateKey.newBuilder() to construct. private RsaSsaPssPrivateKey(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) { super(builder); } private RsaSsaPssPrivateKey() { d_ = com.google.protobuf.ByteString.EMPTY; p_ = com.google.protobuf.ByteString.EMPTY; q_ = com.google.protobuf.ByteString.EMPTY; dp_ = com.google.protobuf.ByteString.EMPTY; dq_ = com.google.protobuf.ByteString.EMPTY; crt_ = com.google.protobuf.ByteString.EMPTY; } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance( UnusedPrivateParameter unused) { return new RsaSsaPssPrivateKey(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } private RsaSsaPssPrivateKey( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { this(); if (extensionRegistry == null) { throw new java.lang.NullPointerException(); } com.google.protobuf.UnknownFieldSet.Builder unknownFields = com.google.protobuf.UnknownFieldSet.newBuilder(); try { boolean done = false; while (!done) { int tag = input.readTag(); switch (tag) { case 0: done = true; break; case 8: { version_ = input.readUInt32(); break; } case 18: { com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder subBuilder = null; if (publicKey_ != null) { subBuilder = publicKey_.toBuilder(); } publicKey_ = input.readMessage(com.google.crypto.tink.proto.RsaSsaPssPublicKey.parser(), extensionRegistry); if (subBuilder != null) { subBuilder.mergeFrom(publicKey_); publicKey_ = subBuilder.buildPartial(); } break; } case 26: { d_ = input.readBytes(); break; } case 34: { p_ = input.readBytes(); break; } case 42: { q_ = input.readBytes(); break; } case 50: { dp_ = input.readBytes(); break; } case 58: { dq_ = input.readBytes(); break; } case 66: { crt_ = input.readBytes(); break; } default: { if (!parseUnknownField( input, unknownFields, extensionRegistry, tag)) { done = true; } break; } } } } catch (com.google.protobuf.InvalidProtocolBufferException e) { throw e.setUnfinishedMessage(this); } catch (java.io.IOException e) { throw new com.google.protobuf.InvalidProtocolBufferException( e).setUnfinishedMessage(this); } finally { this.unknownFields = unknownFields.build(); makeExtensionsImmutable(); } } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.crypto.tink.proto.RsaSsaPss.internal_static_google_crypto_tink_RsaSsaPssPrivateKey_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.crypto.tink.proto.RsaSsaPss.internal_static_google_crypto_tink_RsaSsaPssPrivateKey_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.crypto.tink.proto.RsaSsaPssPrivateKey.class, com.google.crypto.tink.proto.RsaSsaPssPrivateKey.Builder.class); } public static final int VERSION_FIELD_NUMBER = 1; private int version_;
Required.
uint32 version = 1;
Returns:The version.
/** * <pre> * Required. * </pre> * * <code>uint32 version = 1;</code> * @return The version. */
public int getVersion() { return version_; } public static final int PUBLIC_KEY_FIELD_NUMBER = 2; private com.google.crypto.tink.proto.RsaSsaPssPublicKey publicKey_;
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. */
public boolean hasPublicKey() { return publicKey_ != null; }
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. */
public com.google.crypto.tink.proto.RsaSsaPssPublicKey getPublicKey() { return publicKey_ == null ? com.google.crypto.tink.proto.RsaSsaPssPublicKey.getDefaultInstance() : publicKey_; }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder getPublicKeyOrBuilder() { return getPublicKey(); } public static final int D_FIELD_NUMBER = 3; private com.google.protobuf.ByteString d_;
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. */
public com.google.protobuf.ByteString getD() { return d_; } public static final int P_FIELD_NUMBER = 4; private com.google.protobuf.ByteString p_;
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. */
public com.google.protobuf.ByteString getP() { return p_; } public static final int Q_FIELD_NUMBER = 5; private com.google.protobuf.ByteString q_;
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. */
public com.google.protobuf.ByteString getQ() { return q_; } public static final int DP_FIELD_NUMBER = 6; private com.google.protobuf.ByteString dp_;
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. */
public com.google.protobuf.ByteString getDp() { return dp_; } public static final int DQ_FIELD_NUMBER = 7; private com.google.protobuf.ByteString dq_;
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. */
public com.google.protobuf.ByteString getDq() { return dq_; } public static final int CRT_FIELD_NUMBER = 8; private com.google.protobuf.ByteString crt_;
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. */
public com.google.protobuf.ByteString getCrt() { return crt_; } private byte memoizedIsInitialized = -1; @java.lang.Override public final boolean isInitialized() { byte isInitialized = memoizedIsInitialized; if (isInitialized == 1) return true; if (isInitialized == 0) return false; memoizedIsInitialized = 1; return true; } @java.lang.Override public void writeTo(com.google.protobuf.CodedOutputStream output) throws java.io.IOException { if (version_ != 0) { output.writeUInt32(1, version_); } if (publicKey_ != null) { output.writeMessage(2, getPublicKey()); } if (!d_.isEmpty()) { output.writeBytes(3, d_); } if (!p_.isEmpty()) { output.writeBytes(4, p_); } if (!q_.isEmpty()) { output.writeBytes(5, q_); } if (!dp_.isEmpty()) { output.writeBytes(6, dp_); } if (!dq_.isEmpty()) { output.writeBytes(7, dq_); } if (!crt_.isEmpty()) { output.writeBytes(8, crt_); } unknownFields.writeTo(output); } @java.lang.Override public int getSerializedSize() { int size = memoizedSize; if (size != -1) return size; size = 0; if (version_ != 0) { size += com.google.protobuf.CodedOutputStream .computeUInt32Size(1, version_); } if (publicKey_ != null) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(2, getPublicKey()); } if (!d_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(3, d_); } if (!p_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(4, p_); } if (!q_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(5, q_); } if (!dp_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(6, dp_); } if (!dq_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(7, dq_); } if (!crt_.isEmpty()) { size += com.google.protobuf.CodedOutputStream .computeBytesSize(8, crt_); } size += unknownFields.getSerializedSize(); memoizedSize = size; return size; } @java.lang.Override public boolean equals(final java.lang.Object obj) { if (obj == this) { return true; } if (!(obj instanceof com.google.crypto.tink.proto.RsaSsaPssPrivateKey)) { return super.equals(obj); } com.google.crypto.tink.proto.RsaSsaPssPrivateKey other = (com.google.crypto.tink.proto.RsaSsaPssPrivateKey) obj; if (getVersion() != other.getVersion()) return false; if (hasPublicKey() != other.hasPublicKey()) return false; if (hasPublicKey()) { if (!getPublicKey() .equals(other.getPublicKey())) return false; } if (!getD() .equals(other.getD())) return false; if (!getP() .equals(other.getP())) return false; if (!getQ() .equals(other.getQ())) return false; if (!getDp() .equals(other.getDp())) return false; if (!getDq() .equals(other.getDq())) return false; if (!getCrt() .equals(other.getCrt())) return false; if (!unknownFields.equals(other.unknownFields)) return false; return true; } @java.lang.Override public int hashCode() { if (memoizedHashCode != 0) { return memoizedHashCode; } int hash = 41; hash = (19 * hash) + getDescriptor().hashCode(); hash = (37 * hash) + VERSION_FIELD_NUMBER; hash = (53 * hash) + getVersion(); if (hasPublicKey()) { hash = (37 * hash) + PUBLIC_KEY_FIELD_NUMBER; hash = (53 * hash) + getPublicKey().hashCode(); } hash = (37 * hash) + D_FIELD_NUMBER; hash = (53 * hash) + getD().hashCode(); hash = (37 * hash) + P_FIELD_NUMBER; hash = (53 * hash) + getP().hashCode(); hash = (37 * hash) + Q_FIELD_NUMBER; hash = (53 * hash) + getQ().hashCode(); hash = (37 * hash) + DP_FIELD_NUMBER; hash = (53 * hash) + getDp().hashCode(); hash = (37 * hash) + DQ_FIELD_NUMBER; hash = (53 * hash) + getDq().hashCode(); hash = (37 * hash) + CRT_FIELD_NUMBER; hash = (53 * hash) + getCrt().hashCode(); hash = (29 * hash) + unknownFields.hashCode(); memoizedHashCode = hash; return hash; } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom(byte[] data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input, extensionRegistry); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseDelimitedFrom( java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input, extensionRegistry); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( com.google.protobuf.CodedInputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey parseFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input, extensionRegistry); } @java.lang.Override public Builder newBuilderForType() { return newBuilder(); } public static Builder newBuilder() { return DEFAULT_INSTANCE.toBuilder(); } public static Builder newBuilder(com.google.crypto.tink.proto.RsaSsaPssPrivateKey prototype) { return DEFAULT_INSTANCE.toBuilder().mergeFrom(prototype); } @java.lang.Override public Builder toBuilder() { return this == DEFAULT_INSTANCE ? new Builder() : new Builder().mergeFrom(this); } @java.lang.Override protected Builder newBuilderForType( com.google.protobuf.GeneratedMessageV3.BuilderParent parent) { Builder builder = new Builder(parent); return builder; }
key_type: type.googleapis.com/google.crypto.tink.RsaSsaPssPrivateKey
Protobuf type google.crypto.tink.RsaSsaPssPrivateKey
/** * <pre> * key_type: type.googleapis.com/google.crypto.tink.RsaSsaPssPrivateKey * </pre> * * Protobuf type {@code google.crypto.tink.RsaSsaPssPrivateKey} */
public static final class Builder extends com.google.protobuf.GeneratedMessageV3.Builder<Builder> implements // @@protoc_insertion_point(builder_implements:google.crypto.tink.RsaSsaPssPrivateKey) com.google.crypto.tink.proto.RsaSsaPssPrivateKeyOrBuilder { public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.crypto.tink.proto.RsaSsaPss.internal_static_google_crypto_tink_RsaSsaPssPrivateKey_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.crypto.tink.proto.RsaSsaPss.internal_static_google_crypto_tink_RsaSsaPssPrivateKey_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.crypto.tink.proto.RsaSsaPssPrivateKey.class, com.google.crypto.tink.proto.RsaSsaPssPrivateKey.Builder.class); } // Construct using com.google.crypto.tink.proto.RsaSsaPssPrivateKey.newBuilder() private Builder() { maybeForceBuilderInitialization(); } private Builder( com.google.protobuf.GeneratedMessageV3.BuilderParent parent) { super(parent); maybeForceBuilderInitialization(); } private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3 .alwaysUseFieldBuilders) { } } @java.lang.Override public Builder clear() { super.clear(); version_ = 0; if (publicKeyBuilder_ == null) { publicKey_ = null; } else { publicKey_ = null; publicKeyBuilder_ = null; } d_ = com.google.protobuf.ByteString.EMPTY; p_ = com.google.protobuf.ByteString.EMPTY; q_ = com.google.protobuf.ByteString.EMPTY; dp_ = com.google.protobuf.ByteString.EMPTY; dq_ = com.google.protobuf.ByteString.EMPTY; crt_ = com.google.protobuf.ByteString.EMPTY; return this; } @java.lang.Override public com.google.protobuf.Descriptors.Descriptor getDescriptorForType() { return com.google.crypto.tink.proto.RsaSsaPss.internal_static_google_crypto_tink_RsaSsaPssPrivateKey_descriptor; } @java.lang.Override public com.google.crypto.tink.proto.RsaSsaPssPrivateKey getDefaultInstanceForType() { return com.google.crypto.tink.proto.RsaSsaPssPrivateKey.getDefaultInstance(); } @java.lang.Override public com.google.crypto.tink.proto.RsaSsaPssPrivateKey build() { com.google.crypto.tink.proto.RsaSsaPssPrivateKey result = buildPartial(); if (!result.isInitialized()) { throw newUninitializedMessageException(result); } return result; } @java.lang.Override public com.google.crypto.tink.proto.RsaSsaPssPrivateKey buildPartial() { com.google.crypto.tink.proto.RsaSsaPssPrivateKey result = new com.google.crypto.tink.proto.RsaSsaPssPrivateKey(this); result.version_ = version_; if (publicKeyBuilder_ == null) { result.publicKey_ = publicKey_; } else { result.publicKey_ = publicKeyBuilder_.build(); } result.d_ = d_; result.p_ = p_; result.q_ = q_; result.dp_ = dp_; result.dq_ = dq_; result.crt_ = crt_; onBuilt(); return result; } @java.lang.Override public Builder clone() { return super.clone(); } @java.lang.Override public Builder setField( com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.setField(field, value); } @java.lang.Override public Builder clearField( com.google.protobuf.Descriptors.FieldDescriptor field) { return super.clearField(field); } @java.lang.Override public Builder clearOneof( com.google.protobuf.Descriptors.OneofDescriptor oneof) { return super.clearOneof(oneof); } @java.lang.Override public Builder setRepeatedField( com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value) { return super.setRepeatedField(field, index, value); } @java.lang.Override public Builder addRepeatedField( com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.addRepeatedField(field, value); } @java.lang.Override public Builder mergeFrom(com.google.protobuf.Message other) { if (other instanceof com.google.crypto.tink.proto.RsaSsaPssPrivateKey) { return mergeFrom((com.google.crypto.tink.proto.RsaSsaPssPrivateKey)other); } else { super.mergeFrom(other); return this; } } public Builder mergeFrom(com.google.crypto.tink.proto.RsaSsaPssPrivateKey other) { if (other == com.google.crypto.tink.proto.RsaSsaPssPrivateKey.getDefaultInstance()) return this; if (other.getVersion() != 0) { setVersion(other.getVersion()); } if (other.hasPublicKey()) { mergePublicKey(other.getPublicKey()); } if (other.getD() != com.google.protobuf.ByteString.EMPTY) { setD(other.getD()); } if (other.getP() != com.google.protobuf.ByteString.EMPTY) { setP(other.getP()); } if (other.getQ() != com.google.protobuf.ByteString.EMPTY) { setQ(other.getQ()); } if (other.getDp() != com.google.protobuf.ByteString.EMPTY) { setDp(other.getDp()); } if (other.getDq() != com.google.protobuf.ByteString.EMPTY) { setDq(other.getDq()); } if (other.getCrt() != com.google.protobuf.ByteString.EMPTY) { setCrt(other.getCrt()); } this.mergeUnknownFields(other.unknownFields); onChanged(); return this; } @java.lang.Override public final boolean isInitialized() { return true; } @java.lang.Override public Builder mergeFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { com.google.crypto.tink.proto.RsaSsaPssPrivateKey parsedMessage = null; try { parsedMessage = PARSER.parsePartialFrom(input, extensionRegistry); } catch (com.google.protobuf.InvalidProtocolBufferException e) { parsedMessage = (com.google.crypto.tink.proto.RsaSsaPssPrivateKey) e.getUnfinishedMessage(); throw e.unwrapIOException(); } finally { if (parsedMessage != null) { mergeFrom(parsedMessage); } } return this; } private int version_ ;
Required.
uint32 version = 1;
Returns:The version.
/** * <pre> * Required. * </pre> * * <code>uint32 version = 1;</code> * @return The version. */
public int getVersion() { return version_; }
Required.
uint32 version = 1;
Params:
  • value – The version to set.
Returns:This builder for chaining.
/** * <pre> * Required. * </pre> * * <code>uint32 version = 1;</code> * @param value The version to set. * @return This builder for chaining. */
public Builder setVersion(int value) { version_ = value; onChanged(); return this; }
Required.
uint32 version = 1;
Returns:This builder for chaining.
/** * <pre> * Required. * </pre> * * <code>uint32 version = 1;</code> * @return This builder for chaining. */
public Builder clearVersion() { version_ = 0; onChanged(); return this; } private com.google.crypto.tink.proto.RsaSsaPssPublicKey publicKey_; private com.google.protobuf.SingleFieldBuilderV3< com.google.crypto.tink.proto.RsaSsaPssPublicKey, com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder, com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder> publicKeyBuilder_;
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. */
public boolean hasPublicKey() { return publicKeyBuilder_ != null || publicKey_ != null; }
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. */
public com.google.crypto.tink.proto.RsaSsaPssPublicKey getPublicKey() { if (publicKeyBuilder_ == null) { return publicKey_ == null ? com.google.crypto.tink.proto.RsaSsaPssPublicKey.getDefaultInstance() : publicKey_; } else { return publicKeyBuilder_.getMessage(); } }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public Builder setPublicKey(com.google.crypto.tink.proto.RsaSsaPssPublicKey value) { if (publicKeyBuilder_ == null) { if (value == null) { throw new NullPointerException(); } publicKey_ = value; onChanged(); } else { publicKeyBuilder_.setMessage(value); } return this; }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public Builder setPublicKey( com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder builderForValue) { if (publicKeyBuilder_ == null) { publicKey_ = builderForValue.build(); onChanged(); } else { publicKeyBuilder_.setMessage(builderForValue.build()); } return this; }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public Builder mergePublicKey(com.google.crypto.tink.proto.RsaSsaPssPublicKey value) { if (publicKeyBuilder_ == null) { if (publicKey_ != null) { publicKey_ = com.google.crypto.tink.proto.RsaSsaPssPublicKey.newBuilder(publicKey_).mergeFrom(value).buildPartial(); } else { publicKey_ = value; } onChanged(); } else { publicKeyBuilder_.mergeFrom(value); } return this; }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public Builder clearPublicKey() { if (publicKeyBuilder_ == null) { publicKey_ = null; onChanged(); } else { publicKey_ = null; publicKeyBuilder_ = null; } return this; }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder getPublicKeyBuilder() { onChanged(); return getPublicKeyFieldBuilder().getBuilder(); }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
public com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder getPublicKeyOrBuilder() { if (publicKeyBuilder_ != null) { return publicKeyBuilder_.getMessageOrBuilder(); } else { return publicKey_ == null ? com.google.crypto.tink.proto.RsaSsaPssPublicKey.getDefaultInstance() : publicKey_; } }
Required.
.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;
/** * <pre> * Required. * </pre> * * <code>.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;</code> */
private com.google.protobuf.SingleFieldBuilderV3< com.google.crypto.tink.proto.RsaSsaPssPublicKey, com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder, com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder> getPublicKeyFieldBuilder() { if (publicKeyBuilder_ == null) { publicKeyBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< com.google.crypto.tink.proto.RsaSsaPssPublicKey, com.google.crypto.tink.proto.RsaSsaPssPublicKey.Builder, com.google.crypto.tink.proto.RsaSsaPssPublicKeyOrBuilder>( getPublicKey(), getParentForChildren(), isClean()); publicKey_ = null; } return publicKeyBuilder_; } private com.google.protobuf.ByteString d_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getD() { return d_; }
Private exponent.
Unsigned big integer in bigendian representation.
Required.
bytes d = 3;
Params:
  • value – The d to set.
Returns:This builder for chaining.
/** * <pre> * Private exponent. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes d = 3;</code> * @param value The d to set. * @return This builder for chaining. */
public Builder setD(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } d_ = value; onChanged(); return this; }
Private exponent.
Unsigned big integer in bigendian representation.
Required.
bytes d = 3;
Returns:This builder for chaining.
/** * <pre> * Private exponent. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes d = 3;</code> * @return This builder for chaining. */
public Builder clearD() { d_ = getDefaultInstance().getD(); onChanged(); return this; } private com.google.protobuf.ByteString p_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getP() { return p_; }
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;
Params:
  • value – The p to set.
Returns:This builder for chaining.
/** * <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> * @param value The p to set. * @return This builder for chaining. */
public Builder setP(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } p_ = value; onChanged(); return this; }
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:This builder for chaining.
/** * <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 This builder for chaining. */
public Builder clearP() { p_ = getDefaultInstance().getP(); onChanged(); return this; } private com.google.protobuf.ByteString q_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getQ() { return q_; }
The prime factor q of n.
Unsigned big integer in bigendian representation.
Required.
bytes q = 5;
Params:
  • value – The q to set.
Returns:This builder for chaining.
/** * <pre> * The prime factor q of n. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes q = 5;</code> * @param value The q to set. * @return This builder for chaining. */
public Builder setQ(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } q_ = value; onChanged(); return this; }
The prime factor q of n.
Unsigned big integer in bigendian representation.
Required.
bytes q = 5;
Returns:This builder for chaining.
/** * <pre> * The prime factor q of n. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes q = 5;</code> * @return This builder for chaining. */
public Builder clearQ() { q_ = getDefaultInstance().getQ(); onChanged(); return this; } private com.google.protobuf.ByteString dp_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getDp() { return dp_; }
d mod (p - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dp = 6;
Params:
  • value – The dp to set.
Returns:This builder for chaining.
/** * <pre> * d mod (p - 1). * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes dp = 6;</code> * @param value The dp to set. * @return This builder for chaining. */
public Builder setDp(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } dp_ = value; onChanged(); return this; }
d mod (p - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dp = 6;
Returns:This builder for chaining.
/** * <pre> * d mod (p - 1). * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes dp = 6;</code> * @return This builder for chaining. */
public Builder clearDp() { dp_ = getDefaultInstance().getDp(); onChanged(); return this; } private com.google.protobuf.ByteString dq_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getDq() { return dq_; }
d mod (q - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dq = 7;
Params:
  • value – The dq to set.
Returns:This builder for chaining.
/** * <pre> * d mod (q - 1). * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes dq = 7;</code> * @param value The dq to set. * @return This builder for chaining. */
public Builder setDq(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } dq_ = value; onChanged(); return this; }
d mod (q - 1).
Unsigned big integer in bigendian representation.
Required.
bytes dq = 7;
Returns:This builder for chaining.
/** * <pre> * d mod (q - 1). * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes dq = 7;</code> * @return This builder for chaining. */
public Builder clearDq() { dq_ = getDefaultInstance().getDq(); onChanged(); return this; } private com.google.protobuf.ByteString crt_ = com.google.protobuf.ByteString.EMPTY;
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. */
public com.google.protobuf.ByteString getCrt() { return crt_; }
Chinese Remainder Theorem coefficient q^(-1) mod p.
Unsigned big integer in bigendian representation.
Required.
bytes crt = 8;
Params:
  • value – The crt to set.
Returns:This builder for chaining.
/** * <pre> * Chinese Remainder Theorem coefficient q^(-1) mod p. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes crt = 8;</code> * @param value The crt to set. * @return This builder for chaining. */
public Builder setCrt(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } crt_ = value; onChanged(); return this; }
Chinese Remainder Theorem coefficient q^(-1) mod p.
Unsigned big integer in bigendian representation.
Required.
bytes crt = 8;
Returns:This builder for chaining.
/** * <pre> * Chinese Remainder Theorem coefficient q^(-1) mod p. * Unsigned big integer in bigendian representation. * Required. * </pre> * * <code>bytes crt = 8;</code> * @return This builder for chaining. */
public Builder clearCrt() { crt_ = getDefaultInstance().getCrt(); onChanged(); return this; } @java.lang.Override public final Builder setUnknownFields( final com.google.protobuf.UnknownFieldSet unknownFields) { return super.setUnknownFields(unknownFields); } @java.lang.Override public final Builder mergeUnknownFields( final com.google.protobuf.UnknownFieldSet unknownFields) { return super.mergeUnknownFields(unknownFields); } // @@protoc_insertion_point(builder_scope:google.crypto.tink.RsaSsaPssPrivateKey) } // @@protoc_insertion_point(class_scope:google.crypto.tink.RsaSsaPssPrivateKey) private static final com.google.crypto.tink.proto.RsaSsaPssPrivateKey DEFAULT_INSTANCE; static { DEFAULT_INSTANCE = new com.google.crypto.tink.proto.RsaSsaPssPrivateKey(); } public static com.google.crypto.tink.proto.RsaSsaPssPrivateKey getDefaultInstance() { return DEFAULT_INSTANCE; } private static final com.google.protobuf.Parser<RsaSsaPssPrivateKey> PARSER = new com.google.protobuf.AbstractParser<RsaSsaPssPrivateKey>() { @java.lang.Override public RsaSsaPssPrivateKey parsePartialFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return new RsaSsaPssPrivateKey(input, extensionRegistry); } }; public static com.google.protobuf.Parser<RsaSsaPssPrivateKey> parser() { return PARSER; } @java.lang.Override public com.google.protobuf.Parser<RsaSsaPssPrivateKey> getParserForType() { return PARSER; } @java.lang.Override public com.google.crypto.tink.proto.RsaSsaPssPrivateKey getDefaultInstanceForType() { return DEFAULT_INSTANCE; } }