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

DOI10.1016/S0167-8191(84)90424-1MaRDI QIDQ761009zbMATH OpenFDO

Authors Dennis Parkinson, Marvin Wunderlich

Publication date 1984

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

Gaussian eliminationcomputational number theoryfactorisation of large integers

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Polynomials over finite fields (11T06) Primes (11A41) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• A parallel gaussian elimination method for general linear systems
• scientific article; zbMATH DE number 3960862
• scientific article; zbMATH DE number 4215247
• Publication:4721511
• scientific article; zbMATH DE number 3984455

Cited in

(10)

• Factoring on a computer
• New ideas for factoring large integers
• A parallel version of the continued fraction integer factoring algorithm
• Factorization using the quadratic sieve algorithm
• scientific article; zbMATH DE number 4134221 (Why is no real title available?)
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
• On fast and provably secure message authentication based on universal hashing
• scientific article; zbMATH DE number 3907653 (Why is no real title available?)
• Factoring with the quadratic sieve on large vector computers
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve

This page was built for publication: A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761009)