Rg      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefNone+UA 'mask generation function'. The input is a bytestring, and the output is a hash of the given length. Unless you know what you're doing, you should probably use a MGF1 formulation created with generate_MGF1.8The ASN.1 DER encoding of the hash function identifier.The hash function RRandomly generate a key pair of the given modules length (in bits) to use in any of the following functions. Use of a good random number generator is of considerable importance when using this function. The input CryptoRandomGen should never be used again for any other purpose; either use the output'd generator or throw it all away.!Compute a signature for the given ByteString, using the SHA256 algorithm in the computation. This is currently defined as rsassa_pkcs1_v1_5_sign hashSHA256. If you want to use a different function, simply use the PKCS function, below; it will accept arbitrarily-length messages."Verify a signature for the given ByteString, using the SHA25 algorithm in the computation. Again, if you'd like to use a different algorithm, use the rsassa_pkcs1_v1_5_verify function.#+Encrypt an arbitrarily-sized message given the public key and reasonable options. This is equivalent to calling encryptOAEP with SHA-256 as the hash function, MGF1(SHA-256) as the mask generation function, and no label. NOTE: This hash choice means that your key size must be 1024 bits or larger.$Encrypt an arbitrarily-sized message using OAEP encoding. This is the encouraged encoding for doing RSA encryption. Note that your key size must be greater than (2 * hash length + 2) * 8. (For example, the # convenience function uses a 256 bit / 32 byte hash function. Thus, its key must be greater than (2 * 32 + 2) * 8 = 528 bits long, and we suggest 1024 as a lower bound.)%Encrypt an arbitrarily-sized message using PKCS1 v1.5 encoding. This encoding is deprecated, and should only be used when interacting with legacy software that cannot be modified.&Decrypt an arbitrarily-sized message given the public key and reasonable options. This is equivalent to calling encryptOAEP with SHA-256 as the hash function, MGF1(SHA-256) as the mask generation function, and no label.'tDecrypt an arbitrarily-sized message using OAEP encoding. This is the encouraged encoding for doing RSA encryption.(Decrypt an arbitrarily-sized message using PKCS1 v1.5 encoding. This encoding is deprecated, and should only be used when interacting with legacy software that cannot be modified.gChunk an aribitrarily-sized message into a series of chunks that can be encrypted by an OAEP encryption / decryption function.hChunk an arbitrarily-sized message into a series of chunks that can be encrypted by a PKCS1 1.5 encryption / decryption function.*qThe generalized implementation of RSAES-OAEP-ENCRYPT. Using the default instantiontion of this, provided by the #q function, is a pretty good plan if this makes no sense to you, as it is instantiated with reasonable defaults.XThe message to be encrypted may not be longer then (k - 2*hLen - 2), where k is the length of the RSA modulus in bytes and hLen is the length of a hash in bytes. Passing in a larger message will generate an error, represented by the Left constructor. Note that this means that OAEP encryption cannot be used with keys smaller than 512 bits.I have not put in a check for the length of the label, because I don't expect you to use more than 2^32 bytes. So don't make me regret that, eh?+=The generalized implementation of RSAES-OAEP-DECRYPT. Again, &q initializes this with a pretty good set of defaults if you don't understand what all of the arguments involve.The ciphertext message passed to this function must be k bytes long, where k is the size of the modulus in bytes. If it is not, this function will generate an error, represented by the Left constructor.Futher, k (the length of the ciphertext in bytes) must be greater than or equal to (2 * hLen + 2), where hLen is the length of the output of the hash function in bytes. If this equation does not hold, a (different) error will be generated.sFinally, there are any number of internal situations that may generate an error indicating that decryption failed.,Implements RSAES-PKCS1-v1.5-Encrypt, for completeness and backward compatibility. Also because I've already written everything else, so why not?This encryption / padding mechanism has several known attacks, which are described in the literature. So unless you absolutely need to use this for some historical reason, you should avoid it.The message to be encrypted must be less then or equal to (k - 11) bytes long, where k is the length of the key modulus in bytes.}Because this function uses an unknown amount of randomly-generated data, it takes an instance of RandomGen rather than taking a random number as input, and returns the resultant generator as output. You should take care that you (a) do not reuse the input generator, thus losing important randomness, and (b) choose a decent instance of RandomGen for passing to this function.-Implements RSAES-PKCS1-v1.5-Decrypt, for completeness and possible backward compatibility. Please see the notes for rsaes_pkcs_v1_5_encrypt regarding use of this function in new applications without backwards compatibility requirements.wThe ciphertext message passed to this function must be of length k, where k is the length of the key modulus in bytes..Generate a signature for the given message using the given private key, using the RSASSA-PKCS1-v1.5-Sign algorithm. Note that in researching the requirements for this project, several independent sources suggested not using the same key across signvalidate and encrypt&decrypt contexts. You've been warned.VThe output of this function is the signature only, not the message and the signature.kSIZE CONSTRAINT: The size of the public key (in bytes) must be greater than or equal to the length of the hash identifier plus the length of a hash plus 1. Thus, for example, you cannot use a 256 bit RSA key with MD5: 32 (the size of a 256-bit RSA key in bytes) is less than 18 (the size of MD5's identier) + 16 (the size of an MD5 hash in bytes) + 1, or 35.fThus, * for MD5, SHA1, and SHA256, use 512+ bit keys * for SHA384 and SHA512, use 1024+ bit keys/Validate a signature for the given message using the given public key. The signature must be exactly k bytes long, where k is the size of the RSA modulus IN BYTES.0Generate a mask generation function for the rsaes_oaep_*. As suggested by the name, the generated function is an instance of the MGF1 function. The arguments are the underlying hash function to use and the size of a hash in bytes.The bytestring passed to the generated function cannot be longer than 2^32 * hLen, where hLen is the passed length of the hash. 89Generate a large random prime of a given length in bytes.90Generate a random ByteString of the given length:ACreate a random bytestring of non-zero bytes of the given length.iTGiven a number, probabalistically find the first prime number that occurs after it.jProbabilistically test whether or not a given number is prime by first checking some obvious factors and then defaulting to the Miller-Rabin test. Should save time for numbers that are trivially composite.k[Probabilistically test whether or not a given number is prime using the Miller-Rabin test.;5Computes a^b mod c using a moderately good algorithm.<UCompute the modular inverse (d = e^-1 mod phi) via the extended euclidean algorithm.Jlmn !"The key of the signer  The message The purported signature #$The hash function to use $The mask generation function to use An optional label to include The public key to encrypt with The message to encrypt %o&'The hash function to use $The mask generation function to use An optional label to include The public key to encrypt with The message to decrypt (gThe key being used The hash function in use The ByteString to chunk h)*The hash function to use)An appropriate mask genereation function The recipient's public key fA label to associate with the message (feel free to use BS.empty) The message to encrypt +The hash function to useA mask generation function The private key to use An optional label whose association with the message should be verified. The ciphertext to decrypt ,-.The hash function to use The private key to sign with The message to sign  The signature/The hash function to use "The public key to validate againstThe message that was signed The purported signature 0123456pqr789:ija good random number generator the number to test ska good random number generator the number to test the accuracy of the test ;<e phi tu=>?@ABvwxyz{C  !"#$%&'()*+,-./0123456789:;<=>?@ABC  #$%&'(!"0*+,-./=>?@AB87)214365<;9::lm n !"#$%o&'(gh)*+,-./0123456pqr789:ijsk;<tu=>?@ABvwxyz{None+UCA 'mask generation function'. The input is a bytestring, and the output is a hash of the given length. Unless you know what you're doing, you should probably use a MGF1 formulation created with generate_MGF1.DRRandomly generate a key pair of the given modules length (in bits) to use in any of the following functions. Use of a good random number generator is of considerable importance when using this function. The input CryptoRandomGen should never be used again for any other purpose; either use the output'd generator or throw it all away.ECompute a signature for the given ByteString, using the SHA256 algorithm in the computation. This is currently defined as rsassa_pkcs1_v1_5_sign hashSHA256. If you want to use a different function, simply use the PKCS function, below; it will accept arbitrarily-length messages.FVerify a signature for the given ByteString, using the SHA25 algorithm in the computation. Again, if you'd like to use a different algorithm, use the rsassa_pkcs1_v1_5_verify function.G+Encrypt an arbitrarily-sized message given the public key and reasonable options. This is equivalent to calling encryptOAEP with SHA-256 as the hash function, MGF1(SHA-256) as the mask generation function, and no label. NOTE: This hash choice means that your key size must be 1024 bits or larger.HEncrypt an arbitrarily-sized message using OAEP encoding. This is the encouraged encoding for doing RSA encryption. Note that your key size must be greater than (2 * hash length + 2) * 8. (For example, the G convenience function uses a 256 bit / 32 byte hash function. Thus, its key must be greater than (2 * 32 + 2) * 8 = 528 bits long, and we suggest 1024 as a lower bound.)IEncrypt an arbitrarily-sized message using PKCS1 v1.5 encoding. This encoding is deprecated, and should only be used when interacting with legacy software that cannot be modified.JDecrypt an arbitrarily-sized message given the public key and reasonable options. This is equivalent to calling encryptOAEP with SHA-256 as the hash function, MGF1(SHA-256) as the mask generation function, and no label.KtDecrypt an arbitrarily-sized message using OAEP encoding. This is the encouraged encoding for doing RSA encryption.LDecrypt an arbitrarily-sized message using PKCS1 v1.5 encoding. This encoding is deprecated, and should only be used when interacting with legacy software that cannot be modified.NqThe generalized implementation of RSAES-OAEP-ENCRYPT. Using the default instantiontion of this, provided by the Gq function, is a pretty good plan if this makes no sense to you, as it is instantiated with reasonable defaults.XThe message to be encrypted may not be longer then (k - 2*hLen - 2), where k is the length of the RSA modulus in bytes and hLen is the length of a hash in bytes. Passing in a larger message will generate an error, represented by the Left constructor. Note that this means that OAEP encryption cannot be used with keys smaller than 512 bits.I have not put in a check for the length of the label, because I don't expect you to use more than 2^32 bytes. So don't make me regret that, eh?O=The generalized implementation of RSAES-OAEP-DECRYPT. Again, Jq initializes this with a pretty good set of defaults if you don't understand what all of the arguments involve.The ciphertext message passed to this function must be k bytes long, where k is the size of the modulus in bytes. If it is not, this function will generate an error, represented by the Left constructor.Futher, k (the length of the ciphertext in bytes) must be greater than or equal to (2 * hLen + 2), where hLen is the length of the output of the hash function in bytes. If this equation does not hold, a (different) error will be generated.sFinally, there are any number of internal situations that may generate an error indicating that decryption failed.PImplements RSAES-PKCS1-v1.5-Encrypt, for completeness and backward compatibility. Also because I've already written everything else, so why not?This encryption / padding mechanism has several known attacks, which are described in the literature. So unless you absolutely need to use this for some historical reason, you should avoid it.The message to be encrypted must be less then or equal to (k - 11) bytes long, where k is the length of the key modulus in bytes.}Because this function uses an unknown amount of randomly-generated data, it takes an instance of RandomGen rather than taking a random number as input, and returns the resultant generator as output. You should take care that you (a) do not reuse the input generator, thus losing important randomness, and (b) choose a decent instance of RandomGen for passing to this function.QImplements RSAES-PKCS1-v1.5-Decrypt, for completeness and possible backward compatibility. Please see the notes for rsaes_pkcs_v1_5_encrypt regarding use of this function in new applications without backwards compatibility requirements.wThe ciphertext message passed to this function must be of length k, where k is the length of the key modulus in bytes.RGenerate a signature for the given message using the given private key, using the RSASSA-PKCS1-v1.5-Sign algorithm. Note that in researching the requirements for this project, several independent sources suggested not using the same key across signvalidate and encrypt&decrypt contexts. You've been warned.VThe output of this function is the signature only, not the message and the signature.kSIZE CONSTRAINT: The size of the public key (in bytes) must be greater than or equal to the length of the hash identifier plus the length of a hash plus 1. Thus, for example, you cannot use a 256 bit RSA key with MD5: 32 (the size of a 256-bit RSA key in bytes) is less than 18 (the size of MD5's identier) + 16 (the size of an MD5 hash in bytes) + 1, or 35.fThus, * for MD5, SHA1, and SHA256, use 512+ bit keys * for SHA384 and SHA512, use 1024+ bit keysSValidate a signature for the given message using the given public key. The signature must be exactly k bytes long, where k is the size of the RSA modulus IN BYTES.TGenerate a mask generation function for the rsaes_oaep_*. As suggested by the name, the generated function is an instance of the MGF1 function. The arguments are the underlying hash function to use and the size of a hash in bytes.The bytestring passed to the generated function cannot be longer than 2^32 * hLen, where hLen is the passed length of the hash. \9Generate a large random prime of a given length in bytes.]0Generate a random ByteString of the given length^ACreate a random bytestring of non-zero bytes of the given length._5Computes a^b mod c using a moderately good algorithm.`UCompute the modular inverse (d = e^-1 mod phi) via the extended euclidean algorithm.$CDEFThe key of the signer  The message The purported signature GHThe hash function to use $The mask generation function to use An optional label to include The public key to encrypt with The message to encrypt IJKThe hash function to use $The mask generation function to use An optional label to include The public key to encrypt with The message to decrypt LMNThe hash function to use)An appropriate mask genereation function The recipient's public key fA label to associate with the message (feel free to use BS.empty) The message to encrypt OThe hash function to useA mask generation function The private key to use An optional label whose association with the message should be verified. The ciphertext to decrypt PQRThe hash function to use The private key to sign with The message to sign  The signatureSThe hash function to use "The public key to validate againstThe message that was signed The purported signature TUVWXYZ[\]^_`e phi abcdefC CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefC DGHIJKLEFCTNOPQRSabcdef\[MVUXWZY`_]^$CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefNone+UC CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef|       !"#$%&'()*+,-./0123456789:;<=>?@ABCD"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ RSA-2.1.0.3Codec.Crypto.RSA.PureCodec.Crypto.RSA.ExceptionsCodec.Crypto.RSAcrypto-pubkey-types-0.4.3Crypto.Types.PubKey.RSApublic_epublic_n public_size PublicKey private_qinv private_dQ private_dP private_q private_p private_d private_pub PrivateKeyMGFHashInfoalgorithmIdent hashFunctionRSAError RSAGenErrorRSADecryptionErrorRSAIncorrectMsgSizeRSAIncorrectSigSizeRSAMaskTooLongRSAMessageTooLongRSAMessageTooShortRSACipherRepOutOfRangeRSAMessageRepOutOfRangeRSAIntegerTooLargeToPackRSAKeySizeTooSmallgenerateKeyPairsignverifyencrypt encryptOAEP encryptPKCSdecrypt decryptOAEP decryptPKCSchunkifyrsaes_oaep_encryptrsaes_oaep_decryptrsaes_pkcs1_v1_5_encryptrsaes_pkcs1_v1_5_decryptrsassa_pkcs1_v1_5_signrsassa_pkcs1_v1_5_verify generateMGF1i2ospos2iprsa_eprsa_dprsa_sp1rsa_vp1 generatePQlargeRandomPrimerandomBS randomNZBSmodular_exponentiationmodular_inversehashMD5hashSHA1 hashSHA224 hashSHA256 hashSHA384 hashSHA512chunkBSForOAEPchunkBSForPKCS findNextPrimeisProbablyPrime millerRabinRSAKey genKeySize failOnErrormapM'emsa_pkcs1_v1_5_encodexorBSdivCeil small_primesextended_euclideanegcd$fBinaryPrivateKey$fBinaryPublicKey$fRSAKeyPrivateKey$fRSAKeyPublicKey$fShowSystemRandom$fExceptionRSAError