Abstract
The design of a good finite field multiplication algorithm that can be realized easily on VLSI chips is important in the implementation of Reed-Solomon encoders, decoders, and in some cryptographic algorithms. In this paper, a new algorithm to carry out fast multiplication in the finite field GF(2 m ) using modified standard basis is presented. The new algorithm will be proved to be more efficient than the usual normal basis algorithm. The implementation has been done in a SUN SPARC-2 station, using C-language.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have