معرفی
Anna-Maurin Graner is a researcher in the Working Group 'Discrete Mathematics' at the Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Rostock. Holding an M.Sc. degree, she actively contributes to research and teaching while developing novel computational methods for polynomial algebra over finite fields.
Her core research interests include:
- Finite field theory and algebraic structures
- Polynomial factorization algorithms
- Construction of irreducible polynomials
- Coding theory applications
- Cryptographic protocol foundations
- Computational algebra implementation
Graner's 2023 publications demonstrate significant advancements in polynomial factorization efficiency. Her sole-authored work introduces a stable, high-speed algorithm for factoring X^n-a expressions, while her collaboration with Kyureghyan establishes recursive methods for generating irreducible polynomials. These contributions reveal a clear research trajectory toward optimizing algebraic computations for real-world applications in data security and error-correcting codes, with implementations outperforming standard SageMath/PARI tools.
She maintains an active teaching schedule across multiple semesters:
- Linear Algebra sequences for engineering and computer science students (2018-2024)
- Discrete Structures and Iteration Methods (Winter 2023/2024)
- Algebra and Number Theory for teaching degree programs
- Mathematics for Economics undergraduates
Graner presents her work internationally, including at the DMV Meeting 2023 (Ilmenau), Fq15 Conference (Paris), and Workshop on Coding and Cryptography 2022 (Rostock). Her GitHub repository (amg-code/PolynomialsOverFiniteFields) provides open-source implementations of RichFiniteField and RichPolynomial classes, enabling efficient polynomial manipulation over finite fields.
