Subject: Polynomial Algebra & Post-Quantum Crypto Collaboration #280

Hеllo,

I came across your C library bridging polynomial algebra and finite fields (poly.h) and was impressed by your clean implementation of operations over Z_p and cyclotomic polynomials.

I'm currently designing a post-quantum cryptographic engine in freestanding C11 that binds state trajectories via a Voronoi Fuzzy Vault over Galois Fields (F_q, q = 2^64). The architecture combines LWE hardness guarantees with noise blinding.

Given your background in polynomial algebra and finite fields, I'd love to invite you to collaborate on two specific modules:

1. Optimizing the Berlekamp-Welch Reed-Solomon decoding pipeline for polynomial recovery.
2. Galois Field SIMD/vectorized arithmetic operations.

If you're interested in applying finite field polynomial math to low-level post-quantum crypto, let me know and I can share the full architecture spec!

Best regards,
Eva