Complexity Reduction of Constant Matrix Computations over the Binary Field

Oscar Gustafsson, Mikael Olofsson. Complexity Reduction of Constant Matrix Computations over the Binary Field. In Claude Carlet, Berk Sunar, editors, Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings. Volume 4547 of Lecture Notes in Computer Science, pages 103-115, Springer, 2007. [doi]

@inproceedings{GustafssonO07,
  title = {Complexity Reduction of Constant Matrix Computations over the Binary Field},
  author = {Oscar Gustafsson and Mikael Olofsson},
  year = {2007},
  doi = {10.1007/978-3-540-73074-3_9},
  url = {http://dx.doi.org/10.1007/978-3-540-73074-3_9},
  researchr = {https://researchr.org/publication/GustafssonO07},
  cites = {0},
  citedby = {0},
  pages = {103-115},
  booktitle = {Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings},
  editor = {Claude Carlet and Berk Sunar},
  volume = {4547},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73073-6},
}