Fast matrix decomposition in F2
作者：
Highlights：
• Matrices with entries in the field F2 are stored in bits of integers.
• Operations are parallelized by using integer arithmetic and logical operators.
• Columns exchange are completely avoided by an efficient use of pseudoinverse.
• The asymptotically fast algorithm combines the “four Russian” and Strassen algorithms.
• Tuned parameters for the algorithm are deduced and verified experimentally.
摘要
•Matrices with entries in the field F2 are stored in bits of integers.•Operations are parallelized by using integer arithmetic and logical operators.•Columns exchange are completely avoided by an efficient use of pseudoinverse.•The asymptotically fast algorithm combines the “four Russian” and Strassen algorithms.•Tuned parameters for the algorithm are deduced and verified experimentally.
论文关键词：Software implementation of finite field arithmetic,Mathematical tools for cryptography,Linear algebra,Rank computation,Matrix decomposition
论文评审过程：Received 6 January 2013, Revised 16 September 2013, Available online 23 October 2013.
论文官网地址：https://doi.org/10.1016/j.cam.2013.10.026
