Let's start with this one:
1. Create 256-bit random number. Yeah, a bit difficult to do properly.
This is actually quite easy to do, you just have to use the correct APIs.
Hello NotATether,
Thanks for the reply. I understand, the random number is not a big problem.
The bit problems is the exact arithmetic steps of the various procedures.
For one example. Presume my code does multiplies and divides to 512 bit precision. Then look at the last three bits of the most significant 256 bits and find 111. Then look at the next three bits of the lower group and find 111.
Should the code truncate or round up?
One bit difference is the difference between success or failure.
Thank you for your time.