New heuristics for the shortest linear program (SLP) problem for large matrices

• المؤلف الرئيسي: Ng, Chih Qing
• مؤلفون آخرون: Thomas Peyrin
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2020
• الموضوعات: Science::Mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/139161
• المؤسسة: Nanyang Technological University

The aim of this paper is to propose an efficient algorithm (with polynomial or lower time complexity) to minimise the number of XOR gates required to compute a system of linear equations over GF(2) field. Firstly, famous Paar and Boyar-Peralta’s algorithms are reviewed, followed by introducing two n...