Show simple item record

dc.contributor.authorHorowitz, E.en_US
dc.contributor.authorMusser, D.R.en_US
dc.contributor.authorMcClellan, M.T.en_US
dc.contributor.authorCollins, G.E.en_US
dc.contributor.authorHeindel, L.E.en_US
dc.description.abstractThis is a reprinting of the original report of June 1969, with correction of a few minor errors. The SAC-1 Modular Arithmetic System is the fifth of the ten SAC-I subsystems which are now available. It provides subprograms for the arithmetic operations in a prime finite field GF(p), for any single-precision prime p , and various operations on polynomials in several variables with coefficients in GF(p). Besides the arithmetic operations on such polynomials there are included subprograms for the Chinese remainder theorem, evaluation and interpolation. For univariate polynomials, subprograms are included for greatest common divisor calculation and Berlekamp's factorization algorithm.en_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleThe SAC-1 Modular Arithmetic Systemen_US
dc.typeTechnical Reporten_US

Files in this item


This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record