com.google.crypto.tink.proto

Class RsaSsaPssPrivateKey.Builder

java.lang.Object

com.google.protobuf.AbstractMessageLite.Builder<MessageType,BuilderType>

com.google.protobuf.GeneratedMessageLite.Builder<RsaSsaPssPrivateKey,RsaSsaPssPrivateKey.Builder>

com.google.crypto.tink.proto.RsaSsaPssPrivateKey.Builder

All Implemented Interfaces:

RsaSsaPssPrivateKeyOrBuilder, com.google.protobuf.MessageLite.Builder, com.google.protobuf.MessageLiteOrBuilder, Cloneable

Enclosing class:

RsaSsaPssPrivateKey

public static final class RsaSsaPssPrivateKey.Builder
extends com.google.protobuf.GeneratedMessageLite.Builder<RsaSsaPssPrivateKey,RsaSsaPssPrivateKey.Builder>
implements RsaSsaPssPrivateKeyOrBuilder

 key_type: type.googleapis.com/google.crypto.tink.RsaSsaPssPrivateKey
 

Protobuf type google.crypto.tink.RsaSsaPssPrivateKey

Field Summary

Fields inherited from class com.google.protobuf.GeneratedMessageLite.Builder

instance

Method Summary

Modifier and Type	Method and Description
RsaSsaPssPrivateKey.Builder	clearCrt() Chinese Remainder Theorem coefficient q^(-1) mod p.
RsaSsaPssPrivateKey.Builder	clearD() Private exponent.
RsaSsaPssPrivateKey.Builder	clearDp() d mod (p - 1).
RsaSsaPssPrivateKey.Builder	clearDq() d mod (q - 1).
RsaSsaPssPrivateKey.Builder	clearP() The following parameters are used to optimize RSA signature computation.
RsaSsaPssPrivateKey.Builder	clearPublicKey() Required.
RsaSsaPssPrivateKey.Builder	clearQ() The prime factor q of n.
RsaSsaPssPrivateKey.Builder	clearVersion() Required.
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.
RsaSsaPssPrivateKey.Builder	mergePublicKey(RsaSsaPssPublicKey value) Required.
RsaSsaPssPrivateKey.Builder	setCrt(com.google.protobuf.ByteString value) Chinese Remainder Theorem coefficient q^(-1) mod p.
RsaSsaPssPrivateKey.Builder	setD(com.google.protobuf.ByteString value) Private exponent.
RsaSsaPssPrivateKey.Builder	setDp(com.google.protobuf.ByteString value) d mod (p - 1).
RsaSsaPssPrivateKey.Builder	setDq(com.google.protobuf.ByteString value) d mod (q - 1).
RsaSsaPssPrivateKey.Builder	setP(com.google.protobuf.ByteString value) The following parameters are used to optimize RSA signature computation.
RsaSsaPssPrivateKey.Builder	setPublicKey(RsaSsaPssPublicKey.Builder builderForValue) Required.
RsaSsaPssPrivateKey.Builder	setPublicKey(RsaSsaPssPublicKey value) Required.
RsaSsaPssPrivateKey.Builder	setQ(com.google.protobuf.ByteString value) The prime factor q of n.
RsaSsaPssPrivateKey.Builder	setVersion(int value) Required.

Methods inherited from class com.google.protobuf.GeneratedMessageLite.Builder

build, buildPartial, clear, clone, copyOnWrite, copyOnWriteInternal, getDefaultInstanceForType, internalMergeFrom, isInitialized, mergeFrom, mergeFrom, mergeFrom, mergeFrom

Methods inherited from class com.google.protobuf.AbstractMessageLite.Builder

addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

getDefaultInstanceForType, isInitialized

Method Detail

getVersion

public int getVersion()

 Required.
 

uint32 version = 1;

Specified by:

getVersion in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The version.

setVersion

public RsaSsaPssPrivateKey.Builder setVersion(int value)

 Required.
 

uint32 version = 1;

Parameters:

value - The version to set.

Returns:

This builder for chaining.

clearVersion

public RsaSsaPssPrivateKey.Builder clearVersion()

 Required.
 

uint32 version = 1;

Returns:

This builder for chaining.

hasPublicKey

public boolean hasPublicKey()

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

Specified by:

hasPublicKey in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

Whether the publicKey field is set.

getPublicKey

public RsaSsaPssPublicKey getPublicKey()

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

Specified by:

getPublicKey in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The publicKey.

setPublicKey

public RsaSsaPssPrivateKey.Builder setPublicKey(RsaSsaPssPublicKey value)

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

setPublicKey

public RsaSsaPssPrivateKey.Builder setPublicKey(RsaSsaPssPublicKey.Builder builderForValue)

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

mergePublicKey

public RsaSsaPssPrivateKey.Builder mergePublicKey(RsaSsaPssPublicKey value)

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

clearPublicKey

public RsaSsaPssPrivateKey.Builder clearPublicKey()

 Required.
 

.google.crypto.tink.RsaSsaPssPublicKey public_key = 2;

getD

public com.google.protobuf.ByteString getD()

 Private exponent.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes d = 3;

Specified by:

getD in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The d.

setD

public RsaSsaPssPrivateKey.Builder setD(com.google.protobuf.ByteString value)

 Private exponent.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes d = 3;

Parameters:

value - The d to set.

Returns:

This builder for chaining.

clearD

public RsaSsaPssPrivateKey.Builder clearD()

 Private exponent.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes d = 3;

Returns:

This builder for chaining.

getP

public 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;

Specified by:

getP in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The p.

setP

public RsaSsaPssPrivateKey.Builder setP(com.google.protobuf.ByteString value)

 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;

Parameters:

value - The p to set.

Returns:

This builder for chaining.

clearP

public RsaSsaPssPrivateKey.Builder clearP()

 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.

getQ

public com.google.protobuf.ByteString getQ()

 The prime factor q of n.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes q = 5;

Specified by:

getQ in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The q.

setQ

public RsaSsaPssPrivateKey.Builder setQ(com.google.protobuf.ByteString value)

 The prime factor q of n.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes q = 5;

Parameters:

value - The q to set.

Returns:

This builder for chaining.

clearQ

public RsaSsaPssPrivateKey.Builder clearQ()

 The prime factor q of n.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes q = 5;

Returns:

This builder for chaining.

getDp

public com.google.protobuf.ByteString getDp()

 d mod (p - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dp = 6;

Specified by:

getDp in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The dp.

setDp

public RsaSsaPssPrivateKey.Builder setDp(com.google.protobuf.ByteString value)

 d mod (p - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dp = 6;

Parameters:

value - The dp to set.

Returns:

This builder for chaining.

clearDp

public RsaSsaPssPrivateKey.Builder clearDp()

 d mod (p - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dp = 6;

Returns:

This builder for chaining.

getDq

public com.google.protobuf.ByteString getDq()

 d mod (q - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dq = 7;

Specified by:

getDq in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The dq.

setDq

public RsaSsaPssPrivateKey.Builder setDq(com.google.protobuf.ByteString value)

 d mod (q - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dq = 7;

Parameters:

value - The dq to set.

Returns:

This builder for chaining.

clearDq

public RsaSsaPssPrivateKey.Builder clearDq()

 d mod (q - 1).
 Unsigned big integer in bigendian representation.
 Required.
 

bytes dq = 7;

Returns:

This builder for chaining.

getCrt

public com.google.protobuf.ByteString getCrt()

 Chinese Remainder Theorem coefficient q^(-1) mod p.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes crt = 8;

Specified by:

getCrt in interface RsaSsaPssPrivateKeyOrBuilder

Returns:

The crt.

setCrt

public RsaSsaPssPrivateKey.Builder setCrt(com.google.protobuf.ByteString value)

 Chinese Remainder Theorem coefficient q^(-1) mod p.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes crt = 8;

Parameters:

value - The crt to set.

Returns:

This builder for chaining.

clearCrt

public RsaSsaPssPrivateKey.Builder clearCrt()

 Chinese Remainder Theorem coefficient q^(-1) mod p.
 Unsigned big integer in bigendian representation.
 Required.
 

bytes crt = 8;

Returns:

This builder for chaining.