Efficient implementation of Diffie-Hellman (DH) key distribution algorithm in pool-based cryptographic systems (PBCSs)

Efficient software based implementations of Diffie-Hellman (DH) key distribution algorithm in pool-based cryptographic systems (PBCSs) are presented. In PBCSs, the true random numbers (TRNs) are generated by a hardware-based true random number generator (TRNG), and stored in a limited-size pool inside or outside of the TRNG. TRNs are pulled from this pool when they are needed by the applications running in the PBCS. Our implementations are based on using the generated true random bits (TRBs) in the pool as efficiently and as long as possible. Note that these implementations are valid only when generating exactly k-bit random numbers for a k-bit DH. We find that our implementations of DH algorithm provide considerable improvements on the efficient use of the generated TRBs for a limited-size pool, and on the performance of the PBCSs. To our knowledge, this is the first work on using pool-based TRBs and TRNs in the implementations of DH algorithm.