Using Galois fields in computer science (abstract only)
William A. Greene, Wayne Patterson · 1985
Recently the study of finite fields or Galois fields has found application in a number of areas of computer science, including data encryption, coding theory, and systolic algorithms for VLSI systems. The authors will present a data structure for finite fields, with the Galois field operations implemented as an Ada package, overloading the arithmetic and relational operators, and consequently carrying out numerous Galois field computations. The Ada package will be described in both sequential and parallel versions. The package will, in particular, be applied to the problem of generating key sets in the algorithm described in the article by Cooper and Patterson(1) on extending the knapsack algorithm using Galois fields.