![]() | Up a level |
Jump to: Groups Complexity Cryptology
Number of items: 1.
Groups Complexity Cryptology
Hart, Sarah and Hedtke, I. and Mueller-Hannemann, M. and Murthy, S. (2015) A fast search algorithm for (m,m,m) triple product property triples and an application for 5 × 5 matrix multiplication. Groups Complexity Cryptology 7 (1), pp. 31-46. ISSN 1869-6104.