Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm looking for some PRNGs and – as I have been using Java for a long period of time – I thought that the BitInteger class, together with the Random class, could both generate some large pseudo random numbers.

Are the algorithms behind those generations cryptographically secure, or is it just some sort of a + (b - c) mod d or similar operation?

share|improve this question
Exactly what algorithms are you considering in the phrase of the question ending in a question mark? – fgrieu Mar 24 '12 at 9:01
Just use the SecureRandom class. – CodesInChaos Mar 24 '12 at 9:49
I was considering the algorithms behind the Random and BigInteger class. – Andre Mar 30 '12 at 11:18
@vlad you were considering wrong :) – Maarten Bodewes Apr 5 '12 at 1:27
BigInteger does not contain PRNG code at all. It uses RNGs only. Btw, the statement to use SecureRandom is even in the JavaDoc of the Random class. Last sentence of the first paragraph – tylo Jun 12 '14 at 10:53
up vote 6 down vote accepted

Presuming this documentation is correct, the answer is no, these numbers are not cryptographically secure. The Random class uses a linear congruential formula with a 48 bit seed. For most purposes it is not enough even if you only require 48 bit security. Given a fairly low number of outputs from a LCG, it is possible to derive the seed, even if only a few bits of each seed iteration are used. That question has been answered here.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.