home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.theory:2723 sci.crypt:5776
- Newsgroups: comp.theory,sci.crypt
- Path: sparky!uunet!pipex!warwick!pavo.csi.cam.ac.uk!emu.pmms.cam.ac.uk!rgep
- From: rgep@emu.pmms.cam.ac.uk (Richard Pinch)
- Subject: Re: High-order Primitive Polynomials for CRC's
- Message-ID: <1992Dec17.120304.16328@infodev.cam.ac.uk>
- Summary: See W. Stahnke, Maths of Computation 27 (1973) 977-980.
- Keywords: Primitive polynomial
- Sender: news@infodev.cam.ac.uk (USENET news)
- Nntp-Posting-Host: emu.pmms.cam.ac.uk
- Organization: Department of Pure Mathematics, University of Cambridge
- References: <724514081.15434@minster.york.ac.uk>
- Date: Thu, 17 Dec 1992 12:03:04 GMT
- Lines: 13
-
- In article <724514081.15434@minster.york.ac.uk>
- george@minster.york.ac.uk writes:
- >Does anyone have a reference or references for primitive polynomials
- >of order >40.
- [...]
- >
- According to Lidl and Niederreiter's book "Finite fields", there is
- a list of primitive polynomials over GF(2) [which I presume is what
- is wanted] of degrees up to 168 in a paper of W. Stahnke, Maths of
- Computation 27 (1973) 977-980.
-
- Richard Pinch
-
-