I think that Montgomery and sliding window techniques are applied within java.math.BigInteger.modPow
(and more specifically oddModPow
). The sliding window technique is known to be vulnerable to RSA timing attacks as an adversary can distinguish between 0
and 1
.
So if I implement RSA using java.math.BigInteger.modPow
, is it vulnerable to RSA timing attack?
If it is not vulnerable to RSA timing attack, why?