摘要：Finite field arithmetic is commonly used in cryptographic applications such as establishing secure connectionsbetween systems. Recent standards have expanded the necessarykey lengths, potentially increasing the time connections mighttake. This paper offers performance tests of highly efficientoptimization structure for modular exponentiation based onparallelizing Montgomery exponentiation in GFF2k. The paperalso describes the algorithms necessary for an implementationof the optimization structure in question and performancetests for a Diffie–Hellman Key Exchange system utilizing thestructure. The resulting efficiency improvements of nearly45% over standard modular exponentiation can potentially beapplied to any algorithm that relies on such operations.
