The SAC-1 Modular Arithmetic System

dc.contributor.author	Horowitz, E.	en_US
dc.contributor.author	Musser, D.R.	en_US
dc.contributor.author	McClellan, M.T.	en_US
dc.contributor.author	Collins, G.E.	en_US
dc.contributor.author	Heindel, L.E.	en_US
dc.date.accessioned	2012-03-15T16:22:01Z
dc.date.available	2012-03-15T16:22:01Z
dc.date.created	1972	en_US
dc.date.issued	1972
dc.description.abstract	This 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.format.mimetype	application/pdf	en_US
dc.identifier.citation	TR165
dc.identifier.uri	http://digital.library.wisc.edu/1793/57776
dc.publisher	University of Wisconsin-Madison Department of Computer Sciences	en_US
dc.title	The SAC-1 Modular Arithmetic System	en_US
dc.type	Technical Report	en_US

Files

Now showing 1 - 1 of 1