本原多项式

有限域 FFp 上的 n 次不可约多项式 P(x) 称为本原的, 如果它的阶等于 pn-1.

这个工具允许你在素域 FFp 上搜索本原多项式, 这里 p 是素数. 本工具系为教育和科研之用, 希望不要用于实际应用的密码.

定义你的搜索: 直至 个 FFp 上的 次多项式, 其中 p = , 方向 , 表示为 解释

搜索起点:

The most recent version
This page is not in its usual appearance because WIMS is unable to recognize your web browser.
In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.