[Cryptography] Why are Diffie-Hellman key sizes multiples of 64?

[Pierre Abbat]

On Sunday, January 25, 2026 7:16:15 PM EST Jon Callas wrote:
> Now, speaking out of the other side of my mouth, if you assume your numbers
> fit neatly into machine words, you can write a simplified, faster
> algorithm. At least that's what it says on the marketing brochure.

Only if the prime has lots of zeros in a row or lots of ones in a row. But 
would primes like that be easier to find discrete logs in, even if they are 
Fouvry primes?

Pierre
-- 
The Black Garden on the Mountain is not on the Black Mountain.