Rework Coefficient Polynomials

[Marvin-Beckmann]

Description

Similar to the previous PR, this PR reduces some code base for easier maintainability and adds unchecked methods.

• unchecked getter and setter for polynomials
• unchecked getter and setter for entries of matrices
• a macro for compare base for easier implementations, such that it can be used for the polynomials + tests for availability
• added a missing set_coefficient for PolynomialRingZq
• use unchecked getter and setters in our code to improve the efficiency of our internal implementations.

For now I decided to only add the compare base types that were meaningful in my opinion, i.e. where we need it in our internal implementations.

Testing

• I added basic working examples (possibly in doc-comment)
• I triggered all possible errors in my test in every possible way
• I included tests for all reasonable edge cases

Checklist:

• I have performed a self-review of my own code
  • The code provides good readability and maintainability s.t. it fulfills best practices like talking code, modularity, ...
    • The chosen implementation is not more complex than it has to be
  • My code should work as intended and no side effects occur (e.g. memory leaks)
  • The doc comments fit our style guide
  • I have credited related sources if needed