Subversion
Written by: Lorna Jane Mitchell
Featured Refcardz: Top Refcardz:
  1. Git
  2. DNS
  3. Data Mining
  4. Spring Data
  5. Subversion
  1. Spring Data
  2. Subversion
  3. Spring Config.
  4. Spring Annotations
  5. Data Mining

Link Details

Link 892697 thumbnail
User 1059807 avatar

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.
  • 5
  • 0
  • 202
  • 500

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (5)



Voters Against This Link (0)