Many cryptographic algorithms require a large prime number, and in some of these cases a probable prime (i.e. a number which is prime with a high likelyhood) is sufficient, and faster to generate. Check out: http://en.wikipedia.org/wiki/Probable_prime .
- Mahmood On Thu, Feb 3, 2011 at 1:32 PM, ebresie <[email protected]> wrote: > While starting to read "Effective Java™, Second Edition", there is > mention of the method BigInteger.probablePrime() which was added in > 1.4.2 time frame... > > I understand the need to specifiy how big a number in the bit length > and maybe there is something I'm missing, but what is the purpose of > BigInteger.probablePrime? Why return a number that may or may not be > Prime? > > If anyone has any additional guidance on this I would love to hear the > details... > > Eric > > Reference: > - > http://download.oracle.com/javase/6/docs/api/java/math/BigInteger.html#probablePrime(int,%20java.util.Random) > - > http://stackoverflow.com/questions/2882147/generating-exactly-prime-number-with-java > > -- > You received this message because you are subscribed to the Google Groups > "The Java Posse" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/javaposse?hl=en. > > -- You received this message because you are subscribed to the Google Groups "The Java Posse" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/javaposse?hl=en.
