com.google.crypto.tink.proto.JwtRsaSsaPkcs1PrivateKeyOrBuilder Maven / Gradle / Ivy

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

package com.google.crypto.tink.proto;

public interface JwtRsaSsaPkcs1PrivateKeyOrBuilder extends
    // @@protoc_insertion_point(interface_extends:google.crypto.tink.JwtRsaSsaPkcs1PrivateKey)
    com.google.protobuf.MessageOrBuilder {

  /**
   * uint32 version = 1;
   * @return The version.
   */
  int getVersion();

  /**
   * .google.crypto.tink.JwtRsaSsaPkcs1PublicKey public_key = 2;
   * @return Whether the publicKey field is set.
   */
  boolean hasPublicKey();
  /**
   * .google.crypto.tink.JwtRsaSsaPkcs1PublicKey public_key = 2;
   * @return The publicKey.
   */
  com.google.crypto.tink.proto.JwtRsaSsaPkcs1PublicKey getPublicKey();
  /**
   * .google.crypto.tink.JwtRsaSsaPkcs1PublicKey public_key = 2;
   */
  com.google.crypto.tink.proto.JwtRsaSsaPkcs1PublicKeyOrBuilder getPublicKeyOrBuilder();

  /**
   *    * Private exponent.
   * Unsigned big integer in big-endian representation.
   * 
   *
   * 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 big-endian representation.
   * 
   *
   * bytes p = 4;
   * @return The p.
   */
  com.google.protobuf.ByteString getP();

  /**
   *    * The prime factor q of n.
   * Unsigned big integer in big-endian representation.
   * 
   *
   * bytes q = 5;
   * @return The q.
   */
  com.google.protobuf.ByteString getQ();

  /**
   *    * d mod (p - 1).
   * Unsigned big integer in big-endian representation.
   * 
   *
   * bytes dp = 6;
   * @return The dp.
   */
  com.google.protobuf.ByteString getDp();

  /**
   *    * d mod (q - 1).
   * Unsigned big integer in big-endian representation.
   * 
   *
   * bytes dq = 7;
   * @return The dq.
   */
  com.google.protobuf.ByteString getDq();

  /**
   *    * Chinese Remainder Theorem coefficient q^(-1) mod p.
   * Unsigned big integer in big-endian representation.
   * 
   *
   * bytes crt = 8;
   * @return The crt.
   */
  com.google.protobuf.ByteString getCrt();
}