Note: the order of this links somewhat reflect my thought process during this project. Unfortunately (or not) I ended up closing many links before saving them.
- https://en.wikipedia.org/wiki/RSA_(cryptosystem)
- https://en.wikipedia.org/wiki/PKCS_1
- https://tools.ietf.org/html/rfc8017
- https://www.emc.com/collateral/white-papers/h11300-pkcs-1v2-2-rsa-cryptography-standard-wp.pdf
- http://www.mobilefish.com/services/rsa_key_generation/rsa_key_generation.php
- https://stackoverflow.com/questions/8417993/rsa-encryption-of-large-data-in-c-sharp
- http://crypto.stackexchange.com/questions/21102/what-is-the-ssl-private-key-file-format
- http://phpseclib.sourceforge.net/x509/asn1parse.php
- https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding
- https://stackoverflow.com/questions/5583379/what-is-the-limit-to-the-amount-of-data-that-can-be-encrypted-with-rsa
- https://stackoverflow.com/questions/5866129/rsa-encryption-problem-size-of-payload-data
- https://en.bitcoin.it/wiki/Base58Check_encoding
- http://www.mobilefish.com/services/big_number/big_number.php
- https://crypto.stackexchange.com/questions/25878/rsa-with-probable-primes
- http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf#page=82
- https://rosettacode.org/wiki/Miller–Rabin_primality_test#C.23
- https://crypto.stackexchange.com/questions/25907/how-to-calculate-rsa-crt-parameters-from-public-key-and-private-exponent
- https://crypto.stackexchange.com/questions/14/how-can-i-use-asymmetric-encryption-such-as-rsa-to-encrypt-an-arbitrary-length
- https://crypto.stackexchange.com/questions/2195/is-rsa-padding-needed-for-single-recipient-one-time-unique-random-message/2196#2196
- https://crypto.stackexchange.com/questions/22531/how-does-rsa-padding-work-exactly