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(2m) 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.
Original language | English |
---|---|
Pages (from-to) | 456-459 |
Number of pages | 4 |
Journal | Journal of Computer and System Sciences |
Volume | 51 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1995 Dec |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics