Bitslicing and the Method of Four Russians Over Larger Finite Fields

Simple item page
dc.creatorBoothby, Tomas J.
dc.creatorBradshaw, Robert W.
dc.date2009-01-11
dc.date.accessioned2026-07-07T12:28:19Z
dc.date.available2026-07-07T12:28:19Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0901.1413
dc.identifierhttp://arxiv.org/abs/0901.1413
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215499
dc.subjectMathematical Software
dc.titleBitslicing and the Method of Four Russians Over Larger Finite Fields
dc.typetext

Files

Collections

arXiv