feat: complete mlkem (testing contd..)

Author: lonerapier

src/kem/kyber/README.md

@@ -19,6 +19,10 @@
 ML-KEM is based on Module Learning with Errors problems introduced by [Reg05][Reg05].
 
 ## Preliminaries
+- [ ] Why Polynomial Rings?
+- [ ] Cyclotomic Polynomial Rings
+- [ ] NTT
+- [ ] Lattices
 
 ## Implementation Details
 - Polynomial Rings
@@ -81,4 +85,4 @@ ML-KEM is based on Module Learning with Errors problems introduced by [Reg05][Re
 - [Module-Lattice-Based Key-Encapsulation Mechanism Standard](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.203.pdf)
 - [RustCrypto/KEMs](https://github.com/RustCrypto/KEMs): const functions inspiration
 
-[Reg05]: <https://cims.nyu.edu/~regev/papers/lwesurvey.pdf>
+[Reg05]: <https://cims.nyu.edu/~regev/papers/lwesurvey.pdf>

src/kem/kyber/algebra.rs

@@ -0,0 +1,10 @@
+// use super::{auxiliary::g, MatrixPolyVec};
+
+// pub struct KpkeEncryptionKey<const K: usize>([u8; 384*K+32]);
+// pub struct KpkeDecryptionKey<const K: usize>([u8; 384*K]);
+// pub fn kpke_keygen<const K: usize>(d: [u8; 32]) -> (KpkeEncryptionKey, KpkeDecryptionKey) {
+//   let (rho, sigma) = g(d, K);
+
+//   let mut a_ntt = MatrixPolyVec::<Ntt, K, K>
+
+// }