%0 Journal Article
%T A NEW ALGORITHM FOR COMPUTING INVERSES IN THE FINITE FIELD GF(2m)<br>有限域GF (2m)上的一个新的求逆算法
%A Xu Dazhuan
%A Xu Zongze
%A <br>徐大专
%A 许宗泽
%J 电子与信息学报
%D 1998
%I 
%X A new algorithm with the complexity O(logm) is presented to compute inverses in the finite field GF(2m) based on the normal basis representations and the Massey-Omura s multipliers. The inverse in GF(2m) can be computed with log2(m-1)]+w(m-1)-1 multiplications and m-1 cyclic shifts, where x] denotes the maximum integer less than or equal to x, w(m-1) the number of "1" in the binary representation of m-1.
%K Information theory
%K Digital communication
%K Algorithm
%K Finite field
%K Normal basis
%K Inverse<br>信息论
%K 数字通信
%K 算法
%K 有限域
%K 正规基
%K 逆
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=2A0781CBB1860EF5CE3AE3B327BAA70B&yid=8CAA3A429E3EA654&vid=A04140E723CB732E&iid=B31275AF3241DB2D&sid=E3691231514F8E11&eid=786A9BAE5CF9B9EE&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=6