Inversion of circulant matrices over Zm

Abstract

In this paper we consider the problem of inverting an n x n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Zm. We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their costs range --roughly --from n log n log log n to n log 2 n log log n log m operations over Zm. We also present an algorithm for the inversion of finitely generated bi-infinite Toeplitz matrices. The problems considered in this paper have applications to the theory of linear Cellular Automata.

Implementing Candidate Graded Encoding Schemes from Ideal Lattices

“…In the first case we only need to estimate the size of g´1 and in the second case inversion is a subroutine of an approximation algorithm (see below). Hence, we implemented a variant of [BCMM98] to compute the approximate inverse of a polynomial in Q rXs {pX n`1 q, with n a power of two. The core idea is similar to the FFT, i.e.…”

The invertibility of the XOR of rotations of a binary word

“…We now work with polynomials modulo fn(x), so that rotation can be effected by polynomial multiplication modulo fn(x), as is typically done when working with cyclic error-correcting codes (see [6, Section 9.2]) or circulant matrices (see [1]). Now the word (v < < < r)…”

Algorithms for Finding Inverse of Two Patterned Matrices overZp

“…Obviously, the RSFPLR circulant matrix over a field is a − + 1-circulant matrix [14], and that is neither the extention of circulant matrix over Z [15] nor its special case, and they are two different families of patterned matrices.…”

“…The proof of sufficient condition for nonsingularity will be given in Section 2 (Lemmas 5 and 6). [15]. The sum of two polynomials in Z [ ] of degree at most can be trivially calculated in ( log ) bit operations.…”