A Quick method is developed to find an element or order 2p+1p in the finite field GF(q2), where q = 2p-1 is a Mersenne prime. Such an element is needed to implement complex integer transforms of length 2kp over GF(q2)...
详细信息
A Quick method is developed to find an element or order 2p+1p in the finite field GF(q2), where q = 2p-1 is a Mersenne prime. Such an element is needed to implement complex integer transforms of length 2kp over GF(q2) where 3 ≫ k ≪ p + 1.
暂无评论