O(log₂ m) iterative algorithm for multiplicativeinversion in GF(2^m)
Morioka, S.; Katayama, Y.
Information Theory, 2000. Proceedings. IEEE International Symposium on
Volume , Issue , 2000 Page(s):449 -
Digital Object Identifier   10.1109/ISIT.2000.866747
Summary:A new algorithm that can calculate the multiplicative inverses in GF(2^m) with O(log₂ m) iterations is presented. While this algorithm requires in total the same number of multiplications ([log₂(m-1)]+Hw(m-1)-1) with the best known algorithm, the latency, if mapped to a hardware, can be reduced significantly ([log₂(m-2)]+1), comparable to the best case result, which is implemented using Fermat's little theorem

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.