The Security and Performance of "GCM" when Short Multiplications Are Used Instead

Kazumaro Aoki, Kan Yasuda. The Security and Performance of "GCM" when Short Multiplications Are Used Instead. In Miroslaw Kutylowski, Moti Yung, editors, Information Security and Cryptology - 8th International Conference, Inscrypt 2012, Beijing, China, November 28-30, 2012, Revised Selected Papers. Volume 7763 of Lecture Notes in Computer Science, pages 225-245, Springer, 2012. [doi]

@inproceedings{AokiY12,
  title = {The Security and Performance of "GCM" when Short Multiplications Are Used Instead},
  author = {Kazumaro Aoki and Kan Yasuda},
  year = {2012},
  doi = {10.1007/978-3-642-38519-3_15},
  url = {http://dx.doi.org/10.1007/978-3-642-38519-3_15},
  researchr = {https://researchr.org/publication/AokiY12},
  cites = {0},
  citedby = {0},
  pages = {225-245},
  booktitle = {Information Security and Cryptology - 8th International Conference, Inscrypt 2012, Beijing, China, November 28-30, 2012, Revised Selected Papers},
  editor = {Miroslaw Kutylowski and Moti Yung},
  volume = {7763},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-38518-6},
}