glitchcomet

6 ms·

1. 1.▲
   by glitchcomet 2y ago

   It is custom html/css built with my own simple static site generator. The entropy styling is css animations delayed for each letter such that it matches up. Glad that you liked it!
2. 2.▲
   by glitchcomet 2y ago

   That's an interesting idea. I don't know enough to say if using a large offset would be enough to mitigate the downsides of +=2, i would have to read more about it. In actual use you can go directly to using random candidates for
3. 3.▲
   by glitchcomet 2y ago

   Yeah i read about this in my research. It is a tradeoff between execution speed vs randomness of primes, i choose to go with speed assuming that 16 threads all starting from a random number and competing to find the prime would add enough r
4. 4.▲
   by glitchcomet 2y ago

   You can find the bases for N < 3x10^21 on wikipedia [0] which make Miller-Rabin deterministic. 1024 bit numbers have ~300 digits and as far as i know, no known bases exist for that range. [0]: https://en.wikipedia.org/wik
5. 5.▲
   by glitchcomet 2y ago

   Thanks a lot!
6. 6.▲
   by glitchcomet 2y ago

   As the other comments have mentioned, by setting the first bit to one it looses a bit of entropy but ensures that the prime is large enough. Another thing to add is that in RSA two primes are multiplied together. If one of them is 1024 bits