Some considerations about Java implementation of two provably secure pseudorandom bit generators
This provides practical cryptographic tools for Java developers, though it is incremental as it applies existing methods to a new implementation context.
The paper addresses the lack of Java implementations for provably secure pseudorandom bit generators (PRBGs) by developing implementations that achieve throughput rates of 0.5-7 Mbit/sec on common low-end mobile devices.
The quest for a cryptographically secure pseudorandom bit generator (PRBG) was initiated long ago, and for a long time the proposed pseudorandom generators were very slow. More recently some "provably secure" PRBG capable to achieve a throughput rate greater than 1Mbit/sec. We noticed, anyway, the absence of Java implementations of such PRBGs, provably due to poor expected values for throughput rate. In the present paper we show that it is quite easy to write down Java implementations for them, achieving a throughput rae into range $0,5÷7$ Mbit/sec on very common mobile low-end devices.