Fast finite field orthogonal transform without length constraint
Journal
2012 IEEE International Symposium on Circuits and Systems, ISCAS
Pages
2341-2344
Date Issued
2012-05
Author(s)
C. C. Wen
Abstract
In this paper, we propose a new family orthogonal transforms defined over finite field called the Finite Field Orthogonal Transforms (FFOT). Unlike the traditional Number Theoretic Transform (NTT) that the relationship between the transform length and the field moduli has specific constraint in order to hold the orthogonality property, the FFOT has no such constraint so that the signal word length need not be limited by the transform length. In addition, the fast algorithm implementation like radix-2 Cooley-Tukey algorithm is also realizable for the FFOT and is suitable for fast data encryption.
Type
conference paper