Chin-Chin Chen

Learn More
Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents two new algorithms, called time-dependent and time-independent multiplication algorithms over a finite field GF(2 m) by employing an interleaved conventional multiplication and a folded technique. The proposed algorithms permit efficient realization(More)
  • 1