Bitslicing and the Method of Four Russians Over Larger Finite Fields

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We present a method of computing with matrices over very small finite fields of size larger than 2. Specifically, we show how the Method of Four Russians can be efficiently adapted to these larger fields, and introduce a row-wise matrix compression scheme that both reduces memory requirements and allows one to vectorize element operations. We also present timings which confirm the efficiency of these methods and exceed the speed of the fastest implementations the authors are aware of.

Keywords

Mathematical Software

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/215499

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.1413
 http://arxiv.org/abs/0901.1413

Collections

arXiv