Primitive types such as int or double store numbers in exactly 4 or 8 bytes, with finite precision. This suffices for most applications, but cryptography requires arithmetic on very large numbers, without loss of precision. Therefore OpenSSL uses a bignum data type which holds arbitrary sized integers and implements all basic arithmetic and comparison operators such as +, -, *, ^, %%, %/%, ==, !=, <, <=, > and >=.

One special case, the modular exponent a^b %% m can be calculated using bignum_mod_exp, even when b is too large for calculating a^b.

# create a bignum
y <- bignum("123456789123456789")
z <- bignum("D41D8CD98F00B204E9800998ECF8427E", hex = TRUE)

# size grows
print(y * z)
## [b] 34808613111804879213872650915812112647840354642904626774
# Basic arithmetic
div <- z %/% y
mod <- z %% y
z2 <- div * y + mod
stopifnot(z2 == z)
stopifnot(div < z)

RSA involves a public key and a private key. The public key should be known by everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted in a reasonable amount of time using the private key. In RSA, this asymmetry is based on the practical difficulty of factoring the product of two large prime numbers.

### RSA key generation

An RSA key-pair is generated as follows (adapted from wikipedia):

• Choose two distinct prime numbers $$p$$ and $$q$$. Keep these secret.
• Compute the product $$n = p*q$$. This $$n$$ value is public and used as the modulus.
• Compute $$\phi(n) = (p − 1)(q − 1)$$.
• Choose an integer $$e$$ smaller than $$\phi(n)$$ such that $$e$$ and $$\phi(n)$$ are coprime. OpenSSL always uses $$65537$$.
• Compute a value for $$d$$ such that $$(d * e)\pmod{\phi(n)} = 1$$.

OpenSSL has a key generator that does these things for us.

(key <- rsa_keygen(512))
## [512-bit rsa private key]
## md5: 28688e5daf84849a51d3dd128f4a3cb5
## sha256: 7e75382db19a0cc43aa41995d5f796c0ee88aef177f3058c11a01ebb27a2b5b4
(pubkey <- key$pubkey) ## [512-bit rsa public key] ## md5: 28688e5daf84849a51d3dd128f4a3cb5 ## sha256: 7e75382db19a0cc43aa41995d5f796c0ee88aef177f3058c11a01ebb27a2b5b4 Usually we would use rsa_encrypt and rsa_decrypt to perform the encryption: msg <- charToRaw("hello world") ciphertext <- rsa_encrypt(msg, pubkey) rawToChar(rsa_decrypt(ciphertext, key)) ## [1] "hello world" Let’s look at how this works under the hood. ### How RSA encryption works The data field of the private key extracts the underlying bignum integers: key$data
## $e ## [b] 65537 ##$n
## [b] 11748747266558418041803855367568183234466390430002730605128233959705147893208447480588443342142800301177273854965286073396237176868457123259624972098356717
## $p ## [b] 112181952027871199199454445662343415634363483749740121657226734855237268614167 ##$q
## [b] 104729388766915772560670356968202508109251968202395454018070115843108506602651
## $d ## [b] 7470135932335768799334218123602944830862176926289176866742351787553801863222103053550658640065569741512907009593986209660777235312422276064817927565882473 ##$dp
## [b] 90911937594828375737098510209083741211173520079229253724414744570189458982971
## $dq ## [b] 77427229573135831852382625628627308587660044911156515221684441656320755632873 ##$qi
## [b] 33069193693192608377558671349266344051302337002218050540845327541652612456383

You can verify that the equations above hold for this key. The public key is simply a subset of the key which only contains $$n$$ and $$e$$:

pubkey$data ##$e
## [b] 65537
## $n ## [b] 11748747266558418041803855367568183234466390430002730605128233959705147893208447480588443342142800301177273854965286073396237176868457123259624972098356717 In order to encrypt a message into ciphertext we have to treat the message data as an integer. The message cannot be larger than the key size. For example convert the text hello world into an integer: m <- bignum(charToRaw("hello world")) print(m) ## [b] 126207244316550804821666916 To encrypt this message $$m$$ into ciphertext $$c$$ we calculate $$c = m^e\pmod n$$. Using the public key from above: e <- pubkey$data$e n <- pubkey$data$n c <- (m ^ e) %% n print(c) ## [b] 11599829203227804169452167990675307067049265328075623499197931847779909119241350294267740127947861080414135118691871894890142422658274896084099075012000577 This number represents our encrypted message! It is usually exchanged using base64 notation for human readability: base64_encode(c) ## [1] "3XrIuMRZBHUfOG5HC3UWG6pG/Sfe3FTiB9Vxq/1TFSrSaUL7Niwi52Gg8Al151Q3tZ/tdxGRkr5fRMV9q0d7QQ==" The ciphertext can be decrypted using $$d$$ from the corresponding private key via $$m = c^d \pmod{n}$$. Note that c^d is too large to calculate directly so we need to use bignum_mod_exp instead. d <- key$data\$d
out <- bignum_mod_exp(c, d, n)
rawToChar(out)
## [1] "hello world"

The only difference with the actual rsa_encrypt and rsa_decrypt functions is that these add some additional padding to the data.