Welcome to the resource topic for 2019/1090
Title:
Low Complexity MDS Matrices Using GF(2^n) SPB or GPB
Authors: Xinggu Chen, 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).
ePrint: https://eprint.iacr.org/2019/1090
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .