RSAKey

Union of RSAPrivateKey and RSAPublicKey for methods, that do not require specific key.

RSAPrivateKey

RSAPrivateKey is PrivateKey struct for RSA. It holds all information to derive public key and make efficient calculations.

RSAPublicKey

RSAPublicKey is PublicKey struct for RSA.

It holds all neccecary information to perform public key computations, but not more.

RSAStep(::pkcs1_v1_5_t, msg::BigInt, key::RSAPublicKey)

RSA exponentiation step when only public key is available. Uses repeated squares and other fast modulo exponentiation tricks in its GMP implementation (Base.GMP.MPZ.powm).

RSAStep(::pkcs1_v1_5_t, msg::BigInt, key::RSAPrivateKey)

Fast implementation of the RSA exponentiation step when RSAPrivateKey is provided. It uses Chinese remainer theorem for very fast exp() mod n calculations.

RSASP1(::pkcs1_v1_5_t, msg::BigInt, key::RSAPrivateKey)

RSAStep(::pkcs1_v1_5_t, msg::String, key::RSAKey)

RSA exponentiation step for Strings. Only prepares the buffer for RSAStep(msg::BigInt, key::RSAPublicKey).

RSAStep(::pkcs1_v1_5_t, msg::AbstractVector{T}, key::RSAKey) where {T<:Base.BitInteger}

RSA exponentiation step for AbstractVectors (arbitrary buffers). Only prepares the buffer for RSAStep(msg::BigInt, key::RSAPublicKey).

RSAVP1(::pkcs1_v1_5_t, msg::BigInt, key::RSAPublicKey)

decrypt(::pkcs1_v1_5_t,
        msg::Vector{UInt8},
        key::RSAPrivateKey)

RSA decryption function, expects PKCS#1 v1.5.

decrypt(::pkcs1_v2_2_t,
        msg::Vector{UInt8},
        key::RSAPrivateKey)

RSA decryption function, expects PKCS#1 v2.2.

decrypt(msg::Vector{UInt8},
        key::RSAPrivateKey)

RSA decryption function, expects PKCS#1 v2.2.

encrypt(::pkcs1_v1_5_t,
        msg::Vector{UInt8},
        key::RSAPublicKey)

RSA encryption function with PKCS#1 v1.5.

encrypt(::pkcs1_v2_2_t,
        msg::Vector{UInt8},
        key::RSAPublicKey)

RSA encryption function with PKCS#1 v2.2.

encrypt(msg::Vector{UInt8},
        key::RSAPublicKey)

RSA encryption function with PKCS#1 v2.2.

generate_rsa_key_pair(::pkcs1_v1_5_t, bits::Integer)

RSA key pair constructor (hopefully) according to PKCS#1 v1.5

is_probab_prime_p(n::BigInt, n_tests::Int)

Binding for GMPlib's gmpzprobabprime_p function. Only uses probability based tests as it would equal factoring n` otherwise.

power_crt(base::BigInt, pow::BigInt, p::BigInt, q::BigInt)

Wrapper around core implementation, only for generating the parameters if they are not provided.

function power_crt(
    base::BigInt,
    p::BigInt,
    q::BigInt,
    d_p::BigInt,
    d_q::BigInt,
    q_inv::BigInt,
)

CRT for PKCS #1 based parameters.

power_crt_components(d::BigInt, p::BigInt, q::BigInt)

Utility function for calculating dth power in p*q mod CRT parameters for PKCS #1.

power_crt_components(e::BigInt, d::BigInt, primes::Vector{BigInt})

Utility function for calculating the CRT parameters for PKCS #1.

rand_prime_for_rsa(bits::Integer, no_gcd_with=big"65537")

Helper function for rsa random primes, since they should satisfy special properties.

random_bigint_from_range(bits::Integer)

Custom random big int function since core julia does not yet provide 'proper one' (in my opinion).

sign(::pkcs1_v1_5_t,
     msg::Vector{UInt8},
     key::RSAPrivateKey)

Sign string with RSA key by PKCS#1 v1.5

sign(::pkcs1_v2_2_t,
     msg::Vector{UInt8},
     key::RSAPrivateKey)

Sign string with RSA key by PKCS#1 v2.2

sign(msg::Vector{UInt8},
     key::RSAPrivateKey)

Sign string with RSA key by PKCS#1 v2.2

verify_signature(::pkcs1_v1_5_t,
                 msg::Vector{UInt8},
                 signature::Vector{UInt8},
                 key::RSAPublicKey)

Verify the signature by PKCS#1 v1.5

verify_signature(::pkcs1_v2_2_t,
                 msg::Vector{UInt8},
                 signature::Vector{UInt8},
                 key::RSAPublicKey)

Verify the signature by PKCS#1 v2.2

verify_signature(msg::Vector{UInt8},
                 signature::Vector{UInt8},
                 key::RSAPublicKey)

Verify the signature by PKCS#1 v2.2