[Cryptography] Random numbers for Diffie-Hellman

[Pierre Abbat]

On Thursday, December 5, 2024 11:36:02 AM EST Patrick Chkoreff wrote:
> 2.4 Using 8 bits
> 
> The bound B = 255.  Probability of rejection is 1/256.  Another improvement.

Sounds like you're getting one trit out of a byte, which is terribly 
inefficient. A byte is 5.047438 trits. You can get 4.828125 trits out of a byte 
easily, which is 95.655% efficient. Not as good as the 99% you get from 27 bits, 
but it's up there.

Pierre
-- 
Don't buy a French car in Holland. It may be a citroen.