[QUOTE=yurigomes;440603]Our goal is to build a client that could help PrimeNet find new primes. The whole implementation must be in C for performance reasons and we want to use Java only for I/O Operations.[/QUOTE]

It not make sense.

You can create client on Android as educational project for you. But for finding new primes it not have sense.

Just have a look at [URL="http://www.mersenne.org/primenet/"]Exponent Status Distribution[/URL]. For today range of exponents that aviable for first time LL test starting from 70M. I'm sure that you will wait few years for result (if your mobile phone will always on charging) ...

[QUOTE=Lorenzo;440587]Hello! I agree with you. But no one didn't implement LL-test with FFT and mulltiply matrix on Java.[/QUOTE]
Do you know what Schönhage-Strassen means? Google it. Or at least, click the link in the page that [U]you[/U] provided.
The times are in the table. When I talk about 2.3 seconds versus 18 seconds, those 2.3 seconds [B][U]are FFT multiplication[/U]. [/B]Not yet in version 8, "waiting for version 9". But the multiplications are done with FFT. Katatsuba would take ages to multiply 10M digits numbers.

[B]yurigomes[/B], do you have some progress there?