A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers

Authors:
Dennis Parkinson;Marvin Wunderlich
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1984

Citing 0
Cited 2

On Fast and Provably Secure Message Authentication Based on Universal Hashing

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Decoding of Raptor codes on embedded systems

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gaussian elimination over GF(2) is used in a number of applications including the factorisation of large integers. The boolean nature of arithmetic in GF(2) makes the task well suited to highly parallel bit-organised computers. A program to work with up to 4096 x 4096 matrices has been developed for the ICL-DAP. A method has been developed that needs no extra storage to store the history of the elimination. The algorithm is presented and its correctness proved.