-1

I want to send a message consisting of a string of number (e.g: 124124134235235)

Then, p:125243 q:56454547

e: 2659043

d: 5261378624675

However, it will be too large...so, is there any solution to easily encrypt the message?

Or, I can divide "124124134235235" as 1 2 4 1 2 .... encrypting each number before sending the message?

It is so hard to be decrypted as well. Thank you

1 Answers1

0

You can first decide on a value for the security parameter $\lambda$ and based on that, select randomly the primes $p$ and $q$. Now, since you are bound to have your message $< n(=p.q)$, you can now split your message into chunks of bitsize $< \lfloor log_2(n)\rfloor+1$. This way you will get an optimal splitting.

Mayank
  • 447
  • 2
  • 11