com.google.crypto.tink.proto.RsaSsaPkcs1PrivateKeyOrBuilder Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of tink-android Show documentation
Show all versions of tink-android Show documentation
Tink is a small cryptographic library that provides a safe, simple, agile and fast way to accomplish some common cryptographic tasks.
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// NO CHECKED-IN PROTOBUF GENCODE
// source: proto/rsa_ssa_pkcs1.proto
// Protobuf Java Version: 4.28.2
package com.google.crypto.tink.proto;
public interface RsaSsaPkcs1PrivateKeyOrBuilder extends
// @@protoc_insertion_point(interface_extends:google.crypto.tink.RsaSsaPkcs1PrivateKey)
com.google.protobuf.MessageLiteOrBuilder {
/**
*
* Required.
*
*
* uint32 version = 1;
* @return The version.
*/
int getVersion();
/**
*
* Required.
*
*
* .google.crypto.tink.RsaSsaPkcs1PublicKey public_key = 2;
* @return Whether the publicKey field is set.
*/
boolean hasPublicKey();
/**
*
* Required.
*
*
* .google.crypto.tink.RsaSsaPkcs1PublicKey public_key = 2;
* @return The publicKey.
*/
com.google.crypto.tink.proto.RsaSsaPkcs1PublicKey getPublicKey();
/**
*
* Private exponent.
* Unsigned big integer in bigendian representation.
* Required.
*
*
* bytes d = 3;
* @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;
* @return The p.
*/
com.google.protobuf.ByteString getP();
/**
*
* The prime factor q of n.
* Unsigned big integer in bigendian representation.
* Required.
*
*
* bytes q = 5;
* @return The q.
*/
com.google.protobuf.ByteString getQ();
/**
*
* d mod (p - 1).
* Unsigned big integer in bigendian representation.
* Required.
*
*
* bytes dp = 6;
* @return The dp.
*/
com.google.protobuf.ByteString getDp();
/**
*
* d mod (q - 1).
* Unsigned big integer in bigendian representation.
* Required.
*
*
* bytes dq = 7;
* @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;
* @return The crt.
*/
com.google.protobuf.ByteString getCrt();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy