Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis

Huapeng Wu. Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis. In Çetin Kaya Koç, Christof Paar, editors, Cryptographic Hardware and Embedded Systems, First International Workshop, CHES 99, Worcester, MA, USA, August 12-13, 1999, Proceedings. Volume 1717 of Lecture Notes in Computer Science, pages 280-291, Springer, 1999. [doi]

@inproceedings{Wu99:5,
  title = {Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis},
  author = {Huapeng Wu},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1717/17170280.htm},
  researchr = {https://researchr.org/publication/Wu99%3A5},
  cites = {0},
  citedby = {0},
  pages = {280-291},
  booktitle = {Cryptographic Hardware and Embedded Systems, First International Workshop, CHES 99, Worcester, MA, USA, August 12-13, 1999, Proceedings},
  editor = {Çetin Kaya Koç and Christof Paar},
  volume = {1717},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66646-X},
}