A CLASSIFICATION OF ALGORITHMS FOR MULTIPLYING POLYNOMIALS OF SMALL DEGREE OVER FINITE FIELDS

Simple item page
dc.contributor.authorAverbuch, Amireng
dc.contributor.authorKaminski, Michaeleng
dc.contributor.authorBshouty, Nader H.eng
dc.date.accessioned2008-02-27T16:49:03Z
dc.date.available2008-02-27T16:49:03Z
dc.date.computerscience1999-05-27eng
dc.date.issued1991-06-01eng
dc.description.abstractIt is shown that any optimal algorithm for computing the product of two degree-n polynomials over the q-element field, where $n <= q$, is based on the Chinese Remainder Theorem, with linear and quadratic polynomials presented as the moduli.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1991-434-18eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30471
dc.identifier.urihttp://hdl.handle.net/1880/45743
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleA CLASSIFICATION OF ALGORITHMS FOR MULTIPLYING POLYNOMIALS OF SMALL DEGREE OVER FINITE FIELDSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1991-434-18.pdf
Size:
1.17 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications