Make sure that the message$m$ is chunked into pieces$p_i$ such that$p_i < n,$ $\forall p_i$ (for$n=pq$ , for large primes$p, q$ ).-
Add conversions to and from ASCII strings for the typeBigInt
.-
My idea is currently to chunk each byte (b
) of theBigInt
into$2$ characters, found byc1 = (b >> 4) + 0x21
c2 = (b & 0x0F) + 0x21
-
Implement optimal asymmetric encryption padding- Add additional encryption and decryption methods which do not return the extra long
std::string
. I will choose between returning aBigInt
, writing to a byte buffer (uint8_t[]
) and only returning success status, or implementing both. Add full command line interface for encryption and decryption.