-
-
Notifications
You must be signed in to change notification settings - Fork 552
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Cantor-Zassenhaus may enter infinite loop over GF(2**k) and cannot be interrupted #16162
Comments
Commit: |
Author: Jean-Pierre Flori |
Changed keywords from none to finite field polynomial root factor |
Branch: u/jpflori/ticket/16162 |
comment:1
The New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
comment:7
This looks good enough for me as a first step toward better factorization over finite fields. |
comment:8
Could you add some doctests, e.g. an example that used to fail? |
comment:9
Nice... while adding tests, I found a way to trigger segfaults. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:14
Peter, please have a look at the |
comment:15
You should not put anything inside a Is the |
comment:16
Nope, the segfaults were surely caused by the I added the Feel free to have a deeper look and modify the code, I won't touch that before tuesday. |
comment:18
FYI, the segfault I got was really from:
(Which really needs to ba allowed to be interrupted, and to be faster (for exp < |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:20
Ok, the latest commit does not seem enough to let NTL be interrupted when allocating a huge array or something like that. Anyhow, this is not necessary to fix Sage's CZ implem and can be postponed. |
Reviewer: Peter Bruin |
Changed branch from u/jpflori/ticket/16162 to |
A solution is to use random polynomials just as for odd characteristic.
This also replaces calls to
power_mod
by calls topow
with three arguments which uses implementation optimized code for modular exponentiation.CC: @defeo @pjbruin @sagetrac-sbesnier
Component: finite rings
Keywords: finite field polynomial root factor
Author: Jean-Pierre Flori
Branch/Commit:
80db6aa
Reviewer: Peter Bruin
Issue created by migration from https://trac.sagemath.org/ticket/16162
The text was updated successfully, but these errors were encountered: