Publications
The factorization of X^n-a and f(X^n) over Fq
Graner, Anna-Maurin. The factorization of X^n-a and f(X^n) over Fq.
arXiv 2306.11183 (2023)
Constructing irreducible polynomials recursively with a reverse composition method
- Graner, Anna-Maurin and Kyureghyan, Gohar M. Constructing irreducible polynomials recursively with a reverse composition method.
Proceedings of the 12th International Workshop on Coding and Cryptography (Rostock, 2022), Paper 28. - Graner, Anna-Maurin and Kyureghyan, Gohar M. Constructing irreducible polnomials recursively with a reverse composition method.
Designs Codes Cryptography (2023).
https://doi.org/10.1007/s10623-023-01271-z
Talks
- The factorization of X^n-a and f(X^n) over Fq
Mo, September 25, 2023, 4:30 pm
Ilmenau, Minisymposium 2 - Combinatorial aspects of finite fields, DMV Meeting 2023. The factorization of X^n-a and f(X^n) over Fq
Thu, June 22, 2023, 3:30 pm
Paris, International Conference on Finite Fields and Their Applications 2023 (Fq15)Constructing irreducible polynomials recursively with a reverse composition method
Fr, March 03, 2022, 11:25 am (Online)
Rostock, Workshop on Coding and Cryptography 2022
Code
This is my GitHub-Page: https://github.com/amg-code
In the repository
https://github.com/amg-code/PolynomialsOverFiniteFields
you can find implementations of results of my mathematical research in SageMath or Python. These implementations make use of the two new Python classes RichFiniteField and RichPolynomial which are meant for working with univariate polynomials over different finite fields and their extensions.
There also is an implementation of the new factorization algorihm as presented in my paper The factorization of X^n-a and f(X^n). This new algorithm runs much faster and much more stable than the existing SageMath function .factor() which is based on PARI.
Teaching
Winter Semester 2023/2024
- Lineare Algebra 1- Einführung in die Lineare Algebra
Diskrete Strukturen und Iterationsverfahren