On symmetric algorithms for bilinear forms over finite fields |
| |
Authors: | G Seroussi A Lempel |
| |
Institution: | Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel |
| |
Abstract: | In this paper we study the computation of symmetric systems of bilinear forms over finite fields via symmetric bilinear algorithms. We show that, in general, the symmetric complexity of a system is upper bounded by a constant multiple of the bilinear complexity; we characterize symmetric algorithms in terms of the cosets of a specific cyclic code, and we show that the problem of finding an optimal symmetric algorithm is equivalent to the maximum-likelihood decoding problem for this code. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|