|
| From: | Robert J. Hansen |
| Subject: | Re: [Sks-devel] Oh, Jeeez...! |
| Date: | Wed, 25 May 2016 16:29:27 -0400 |
| User-agent: | Mozilla/5.0 (Macintosh; Intel Mac OS X 10.11; rv:45.0) Gecko/20100101 Thunderbird/45.1.0 |
> Let client solve a simple integer factorization of a random number given > by server with e.g. 64bit build from two prime numbers. Please sanity-check your ideas first. Trial division on a 64-bit number requires trying each prime up to 2**32. There are about 200 million of them. 200 million * 4 bytes per is a <1GiB database. You can spread the task over cores -- it's trivially parallelizable; Amdahl's Law looks at this and starts licking its lips. A smartphone can factor a 64-bit composite in ~100 milliseconds.
| [Prev in Thread] | Current Thread | [Next in Thread] |