anefficientalgorithmforfactoringpolynomialsoveralgebraicextensionfield

CSpace > 系统科学研究所

	anefficientalgorithmforfactoringpolynomialsoveralgebraicextensionfield
	Sun Yao 1; Wang Dingkang2
	2013
发表期刊	sciencechinamathematics
ISSN	1674-7283
卷号	56 期号:6 页码:1155
摘要	An 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.
语种	英语
资助项目	[National Key Basic Research Project of China] ; [National Natural Science Foundation of China] ; [IIE'S Research Project on Cryptography]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/47742
专题	系统科学研究所
作者单位	1.中国科学院信息工程研究所 2.中国科学院数学与系统科学研究院
推荐引用方式 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.