public static long powMod2_32(int prime, int number) {
int answer2 = 1;
int p = prime;
for (int n = number; n > 0; n >>>= 1) {
if ((n & 1) != 0)
...
Type: Posts; User: linzylu1190
What is this code doing?
public static long powMod2_32(int prime, int number) {
int answer2 = 1;
int p = prime;
for (int n = number; n > 0; n >>>= 1) {
if ((n & 1) != 0)
...
Dealing With Overflow?
Hi,
Does anyone know a short code that prevents overflow when using encryption? I don't understand what my professor means by this. I asked him if we could round or just cut off so many numbers...