%
%	Arbitrary precision integer arithmetic--multiplication.
%
%	Ken Weber 	kweber@mcs.kent.edu	12/14/94
%
@string{cacm = "Communications of the {ACM}"}
@string{jsc = "Journal of Symbolic Computation"}
@string{ja  = "Journal of Algorithms"}
@string{ssb = "{SIGSAM} Bulletin"}
@string{TOMS = "{ACM} Transactions on Mathematical Software"}
@string{MC = "Mathematics of Computation"}

@phdthesis
{   hudson, 
    author = "Hudson, jr. (sic), Thomas Freeman",
    title = "Design and Analysis of Several Parallel Algorithms 
	    for Multiplying Very Large Integers",
    school = "University of Maryland, Baltimore County",
    year = 1988
}

@article
{   montgomery,
    author = "Peter L. Montgomery",
    title = "Modular Multiplication Without Trial Division",
    journal = MC,
    volume = 44,
    number = 170, 
    year = 1985,
    month = apr,
    pages = "519--521"
}

@article
{   montgomery-silverman,
    author = "Peter L. Montgomery and Robert D. Silverman",
    title = "An {FFT} Extension to the {P-1} Factoring Algorithm",
    journal = MC,
    volume = 54,
    number = 190,
    month = apr,
    year = 1990,
    pages = "839--854"
}

@article
{   nussbaumer,
    author = "Henri J. Nussbaumer",
    title = "Fast Polynomial Transform Algorithms for Digital Convolution",
    journal = "{IEEE} Transactions on Acousitics, Speech, and Signal
	Processing",
    volume = "{ASSP}-28",
    number = 2,
    month = apr,
    year = 1980,
    pages = "205--215"
}