TY - JOUR
AU - Freyre Arrozarena, Pablo
AU - Fiallo, Ernesto Dominguez
PY - 2023/04/01
Y2 - 2023/06/09
TI - Efficient multiplication of a vector by a matrix MDS
JF - Journal of Science and Technology on Information security
JA - ISJ
VL - 3
IS - 17
SE -
DO - 10.54654/isj.v3i17.888
UR - https://isj.vn/index.php/journal_STIS/article/view/888
SP - 26-36
AB - <p><em>Abstract</em>— An algorithm is proposed for the efficient multiplication of a vector by an <em>n x n</em> MDS matrix defined on F<sub>q</sub> or by its inverse. The algorithm is based on the multiplication of two polynomials modulo a polynomial of degree <em>n</em> Reed-Solomon code generator and has complexity <em>O(n</em>log<sub>2</sub>log<sub>2</sub>(<em>n</em>log<sub>2</sub><em>q</em>)).</p><p>The algorithm only needs to store <em>n</em> values of the F<sub>q</sub> field for the multiplication of a vector by an <em>n x n</em> MDS matrix and <em>2n</em> values for the multiplication of the vector by the inverse matrix.</p>
ER -