By acoin
via architects.dzone.com
Published: Dec 17 2012 / 11:18
There is simple, but expnsive problem in cryptography which can be written as: "Calculate y = (p^n) mod (2^32) where p is a prime number and n is a large integer." Fortunately BigInteger has a method which is useful in the situation.
Add your comment