Constructing polynomials over finite fields

dc.creatorStamp, Mark Steven
dc.date.available2011-02-18T20:04:20Z
dc.date.issued1988-12
dc.description.abstractIn this paper we present an algorithm for constructing a polynomial system corresponding to a given directed labeled graph. Three specific classes of polynomial systems are considered in detail. Then we briefly consider some desirable properties for output sequences and we show how to construct a polynomial system that will produce a given output sequence of zeros and ones of length 2^n.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2346/12819en_US
dc.language.isoeng
dc.publisherTexas Tech Universityen_US
dc.rights.availabilityUnrestricted.
dc.subjectRandom polynomialsen_US
dc.subjectCryptographyen_US
dc.subjectPolynomialsen_US
dc.subjectRandom number generators -- Computer programsen_US
dc.titleConstructing polynomials over finite fields
dc.typeThesis
thesis.degree.departmentMathematics
thesis.degree.grantorTexas Tech University
thesis.degree.levelMasters
thesis.degree.nameM.S.

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
31295005365290.pdf
Size:
1.45 MB
Format:
Adobe Portable Document Format