4 ms·
If I'm thinking of the same 'crank' that the author is, I believe that the main conteibution he claims is a novel way to compute very distant parts of the keyst
by LegionMammal978 3y ago
If I'm thinking of the same 'crank' that the author is, I believe that the main conteibution he claims is a novel way to compute very distant parts of the keystream without having to work through the preceding digits with Newton's method. But this author dismisses it as even slower than Newton's method, and susceptible to brute force in any case. That would be a shame, since I was drawn to the work of this 'crank' a while back in trying to approximate algebraic numbers using sublinear memory.
- SAI_Peregrinus 3y agoIf you want a CSPRNG where you can get very distant parts of the keystream just use a stream cipher like ChaCha20's keystream or AES-CTR-DRBG. Set the counter to the place in the keystream you desire!
- LegionMammal978 3y agoOf course, the 'crank' here is looking for a cipher with an easy-to-understand keystream; but my own goal was always to efficiently compute the digits of numbers for their particular algebraic properties, to an arbitrary distance. Though it looks like there really might not be any alternative to Newton's method (or similar) for many of them.