A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
From MaRDI portal
Publication:761009
DOI10.1016/S0167-8191(84)90424-1zbMath0556.65019MaRDI QIDQ761009
Dennis Parkinson, Marvin Wunderlich
Publication date: 1984
Published in: Parallel Computing (Search for Journal in Brave)
Polynomials over finite fields (11T06) Direct numerical methods for linear systems and matrix inversion (65F05) Primes (11A41) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (7)
On Fast and Provably Secure Message Authentication Based on Universal Hashing ⋮ Factoring Integers with Large-Prime Variations of the Quadratic Sieve ⋮ A parallel version of the continued fraction integer factoring algorithm ⋮ Factoring with the quadratic sieve on large vector computers ⋮ Factoring on a computer ⋮ New Ideas for Factoring Large Integers ⋮ Factorization Using the Quadratic Sieve Algorithm
This page was built for publication: A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
