CSpace  > 系统科学研究所
Sun Yao1; Wang Dingkang2
Source Publicationsciencechinamathematics
AbstractAn efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Grobner basis, no extra Grobner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.
Funding Project[National Key Basic Research Project of China] ; [National Natural Science Foundation of China] ; [IIE'S Research Project on Cryptography]
Document Type期刊论文
Recommended Citation
GB/T 7714
Sun Yao,Wang Dingkang. anefficientalgorithmforfactoringpolynomialsoveralgebraicextensionfield[J]. sciencechinamathematics,2013,56(6):1155.
APA Sun Yao,&Wang Dingkang.(2013).anefficientalgorithmforfactoringpolynomialsoveralgebraicextensionfield.sciencechinamathematics,56(6),1155.
MLA Sun Yao,et al."anefficientalgorithmforfactoringpolynomialsoveralgebraicextensionfield".sciencechinamathematics 56.6(2013):1155.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.