完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, W.C. | |
| dc.contributor.author | Jeng, J.H. | |
| dc.date.accessioned | 2009-06-02T07:22:12Z | |
| dc.date.accessioned | 2020-05-29T06:16:59Z | - |
| dc.date.available | 2009-06-02T07:22:12Z | |
| dc.date.available | 2020-05-29T06:16:59Z | - |
| dc.date.issued | 2006-11-13T01:13:32Z | |
| dc.date.submitted | 1999-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/3110 | - |
| dc.description.abstract | A fast method for finding irreducible polynomial of degree m over GF(2) is proposed in this paper. Given an arbitrary irreducible polynomial of degree m and any proper primitive element, the finite field GF(2m) is generated. From this finite field, one can generate all the irreducible polynomials over GF (2) with degree less than or equal to m. These irreducible polynomials are useful in constructing finite fields for applications in error correcting code, cryptography and other related subjects. | |
| dc.description.sponsorship | 淡江大學, 台北縣 | |
| dc.format.extent | 3p. | |
| dc.format.extent | 159437 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1999 NCS會議 | |
| dc.subject | irreducible polynomial | |
| dc.subject | finite field | |
| dc.subject | primitive element | |
| dc.subject | minimal polynomial | |
| dc.subject.other | Number Theory and Cryptanalysis | |
| dc.title | A Search of all of the irreducible polynomials of degree m over GF(2) | |
| 分類: | 1999年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs001999000176.pdf | 156.3 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。