Factoring ofx n?1 and orthogonalization over finite fields of characteristic 2

Abstract

Abstract. We present a new deterministic algorithm which gives a complete factorization of x"-1 over finite fields of characteristic 2. To do so we adapt a well-known procedure of orthogonalization in order to compute primitive idempotents over extensions instead of over GF(2).

Complexity and fast algorithms for multiexponentiations

“…computer algebra, coding theory and control theory also require the computation of multiexponentiations [27][28] [29]. This paper is organized as follows.…”

Algorithms for multi-exponentiation based on complex arithmetic

“…Some algorithms in computer algebra and coding theory also require at some stages the computation of multi-exponentiations [26] [27].…”