Cryptology ePrint Archive: Report 2019/1090

Low Complexity MDS Matrices Using $GF(2^n)$ SPB or GPB

Xinggu Chen and Haining Fan

Abstract: While $GF(2^n)$ polynomial bases are widely used in symmetric-key components, e.g. MDS matrices, we show that even low time/space complexities can be achieved by using $GF(2^n)$ shifted polynomial bases (SPB) or generalized polynomial bases (GPB).

Category / Keywords: implementation / Finite field, multiplication, polynomial basis, diffusion matrix, MDS matrix.

Date: received 24 Sep 2019

Contact author: cxg15 at mails tsinghua edu cn,fhn@tsinghua edu cn

Available format(s): PDF | BibTeX Citation

Version: 20190929:183051 (All versions of this report)

Short URL: ia.cr/2019/1090


[ Cryptology ePrint archive ]