#Why must the exponent be binary?
1 messages · Page 1 of 1 (latest)
Modular exponentiation is exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography, where it is used in both Diffie–Hellman key exchange and RSA public/private keys.
Modular exponentiation is the remainder when an integer b (the base) is raised to the power e (the exponent), an...
hmmmmm
what does the <- mean?
still kind of confused
if i raise a normal decimal base to a binary exponent it will be like this
say my base is 3
and my binary is 10
so in binary it is 1010
so id do 3^1010
which is way way wayyyyyyy off
<- here means assignment
why cant i just keep the exponent a decimal tho
the way i perform moduluar exponentiation on paper is i start the exponent at 1 and double it each row... and then add up the answers that have the exponents equal to what im looking for
The problem you posted doesn't say HOW you should do it. But it does allude to the using this technique when it says (so it needs to be converted to binary)
right
but i assume since it is saying to use the binary converter that, that is the best way to go
just isnt making much sense as to why
Maybe you need to just soak in it a bit. Start at the top of that article. Maybe google for some other resources now you know what technique your instructor expects.
!close