首页> 外文期刊>Computational complexity >SUBQUADRATIC-TIME ALGORITHMS FOR NORMAL BASES
【24h】

SUBQUADRATIC-TIME ALGORITHMS FOR NORMAL BASES

机译:SUBQUADRATIC-TIME ALGORITHMS FOR NORMAL BASES

获取原文
获取原文并翻译 | 示例
           

摘要

For any finite Galois field extension K/F, with Galois group G = Gal(K/F), there exists an element alpha is an element of K whose orbit G center dot alpha forms an F-basis of K. Such an alpha is called a normal element, and G center dot alpha is a normal basis. We introduce a probabilistic algorithm for testing whether a given alpha is an element of K is normal, when G is either a finite abelian or a metacyclic group. The algorithm is based on the fact that deciding whether alpha is normal can be reduced to deciding whether Sigma(g is an element of G)g(alpha)g is an element of KG is invertible; it requires a slightly subquadratic number of operations. Once we know that alpha is normal, we show how to perform conversions between the power basis of K/F and the normal basis with the same asymptotic cost.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号