Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost is based on how it works with minimum use of scarce resources like processor and memory We have implemented the determination of the multiplicative in-verse of a polynomial over GF(2(superscript p)) with minimum computational cost. The ”Extended Euclidean Algorithm” (EEA) has been demonstrated to work very well manually for integers and polynomials. However polynomial manipulation cannot be computerized directly. We have implemented the same by using simple bit wise shift and XOR operations. In small applications like smart cards, mo-bile devices and other small memory devices, this method works very well. To the best of our knowledge, the pro-posed algorithm seems to be the first, efficient and cost effective implementation of determining the multiplicative inverse of polynomials over GF(2(superscript p)) using computers. As this is a pioneering work, the results could not be compared with that of any previous work.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。