asked 2024-04-02 03:37:37 +0200
Anonymous
N is a high-degree polynomial.
If I read your question correctly, then for an irreducible over GF(2) polynomial $N$, the order is simply $2^{\mathrm{deg}(N)}$.
Thank you for answering. How to calculate order if N is reducible?
Please start posting anonymously - your entry will be published after you log in or create a new account.
Add Answer
subscribe to rss feed
Asked: 2024-04-02 03:37:37 +0200
Seen: 157 times
Last updated: Apr 02
Multivariate Polynomials over Rational Function Fields
How do I Pass a tuple as an argument for a multivariate polynomial?
Is there an example of how i could write a polynomial as a product of linear factors
multi-symmetric functions and multi-partitions
Identification polynomial
polynomials rings over transcendental field extensions
Noncommuting variables
Coercion problem while defining piecewise function
Problems with computing discriminants and resultants.
symbolic polynomial euclidean algorithm
If I read your question correctly, then for an irreducible over GF(2) polynomial $N$, the order is simply $2^{\mathrm{deg}(N)}$.
Thank you for answering. How to calculate order if N is reducible?