Home/ Questions/Q 5848687
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-22T12:53:39+00:00

I need to implement RSA algorithm in Java. I’ve found the best solution using

  • 0

I need to implement RSA algorithm in Java. I’ve found the best solution using BigIntegers, problem is that I need to work only with ints or longs.
The encrypting is done like this: M[i]^e mod n where M[i] is an input char and e is a key value. I tried using the ASCII codes of chars, and with codes such as 115 and 116 I quickly get out of range. How can I solve the problem? Thanks in advance.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You may have a look at modular exponentiation. This way you overcome most of the overflows in your calculations.

    • 0