A new algorithm for factoring polynomials over finite fields
Publication type: Journal Article
Publication date: 2010-06-30
scimago Q1
wos Q1
SJR: 1.845
CiteScore: 4.4
Impact factor: 2.1
ISSN: 00255718, 10886842
Computational Mathematics
Applied Mathematics
Algebra and Number Theory
Abstract
We present a new probabilistic algorithm for factoring polynomials over finite fields.
Found
Nothing found, try to update filter.
Found
Nothing found, try to update filter.
Top-30
Journals
|
5
10
15
20
25
30
35
40
45
|
|
|
Lecture Notes in Computer Science
43 publications, 22.75%
|
|
|
Journal of Symbolic Computation
16 publications, 8.47%
|
|
|
Applicable Algebra in Engineering, Communications and Computing
7 publications, 3.7%
|
|
|
Journal of Complexity
5 publications, 2.65%
|
|
|
SIAM Journal on Computing
5 publications, 2.65%
|
|
|
Journal of Algebra
3 publications, 1.59%
|
|
|
Discrete Mathematics
3 publications, 1.59%
|
|
|
ACM Communications in Computer Algebra
3 publications, 1.59%
|
|
|
Computational Complexity
3 publications, 1.59%
|
|
|
Finite Fields and Their Applications
3 publications, 1.59%
|
|
|
Theoretical Computer Science
2 publications, 1.06%
|
|
|
ACM SIGSAM Bulletin
2 publications, 1.06%
|
|
|
ACM Transactions on Computation Theory
2 publications, 1.06%
|
|
|
International Journal of Number Theory
2 publications, 1.06%
|
|
|
IEEE Transactions on Information Theory
2 publications, 1.06%
|
|
|
IEEE Transactions on Computers
2 publications, 1.06%
|
|
|
Linear Algebra and Its Applications
2 publications, 1.06%
|
|
|
LMS Journal of Computation and Mathematics
2 publications, 1.06%
|
|
|
IEEE Transactions on Information Forensics and Security
2 publications, 1.06%
|
|
|
Geometric Modelling
2 publications, 1.06%
|
|
|
ACM Transactions on Mathematical Software
1 publication, 0.53%
|
|
|
Journal of the ACM
1 publication, 0.53%
|
|
|
Journal of Algorithms
1 publication, 0.53%
|
|
|
SIAM Journal on Discrete Mathematics
1 publication, 0.53%
|
|
|
Cryptography and Communications
1 publication, 0.53%
|
|
|
Soft Computing
1 publication, 0.53%
|
|
|
Journal of Cryptology
1 publication, 0.53%
|
|
|
Computing (Vienna/New York)
1 publication, 0.53%
|
|
|
Foundations of Computational Mathematics
1 publication, 0.53%
|
|
|
5
10
15
20
25
30
35
40
45
|
Publishers
|
10
20
30
40
50
60
70
|
|
|
Springer Nature
68 publications, 35.98%
|
|
|
Elsevier
45 publications, 23.81%
|
|
|
Association for Computing Machinery (ACM)
28 publications, 14.81%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
23 publications, 12.17%
|
|
|
Society for Industrial and Applied Mathematics (SIAM)
6 publications, 3.17%
|
|
|
Cambridge University Press
4 publications, 2.12%
|
|
|
World Scientific
2 publications, 1.06%
|
|
|
Mathematical Association of America
1 publication, 0.53%
|
|
|
Taylor & Francis
1 publication, 0.53%
|
|
|
Institute of Electronics, Information and Communications Engineers (IEICE)
1 publication, 0.53%
|
|
|
American Institute of Mathematical Sciences (AIMS)
1 publication, 0.53%
|
|
|
Korean Mathematical Society
1 publication, 0.53%
|
|
|
Wiley
1 publication, 0.53%
|
|
|
10
20
30
40
50
60
70
|
- We do not take into account publications without a DOI.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
189
Total citations:
189
Citations from 2024:
24
(12.7%)
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
GOST
Copy
Cantor D., Zassenhaus H. A new algorithm for factoring polynomials over finite fields // Mathematics of Computation. 2010. Vol. 36. No. 154. pp. 587-592.
GOST all authors (up to 50)
Copy
Cantor D., Zassenhaus H. A new algorithm for factoring polynomials over finite fields // Mathematics of Computation. 2010. Vol. 36. No. 154. pp. 587-592.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1090/S0025-5718-1981-0606517-5
UR - https://doi.org/10.1090/S0025-5718-1981-0606517-5
TI - A new algorithm for factoring polynomials over finite fields
T2 - Mathematics of Computation
AU - Cantor, David
AU - Zassenhaus, Hans
PY - 2010
DA - 2010/06/30
PB - American Mathematical Society
SP - 587-592
IS - 154
VL - 36
SN - 0025-5718
SN - 1088-6842
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2010_Cantor,
author = {David Cantor and Hans Zassenhaus},
title = {A new algorithm for factoring polynomials over finite fields},
journal = {Mathematics of Computation},
year = {2010},
volume = {36},
publisher = {American Mathematical Society},
month = {jun},
url = {https://doi.org/10.1090/S0025-5718-1981-0606517-5},
number = {154},
pages = {587--592},
doi = {10.1090/S0025-5718-1981-0606517-5}
}
Cite this
MLA
Copy
Cantor, David, and Hans Zassenhaus. “A new algorithm for factoring polynomials over finite fields.” Mathematics of Computation, vol. 36, no. 154, Jun. 2010, pp. 587-592. https://doi.org/10.1090/S0025-5718-1981-0606517-5.