Experimentally implement matrix-mult

GCryptLib/include/GCrypt/BlockMatrix.h

@@ -0,0 +1,49 @@
+#ifndef GCRYPT_BLOCKMATRIX_H
+#define GCRYPT_BLOCKMATRIX_H
+
+#include "GCrypt/Block.h"
+#include <cstdint>
+#include <array>
+
+namespace Leonetienne::GCrypt {
+
+  /* This class represents a block as a matrix,
+   * providing typical matrix operations
+  */
+  class BlockMatrix {
+    public:
+      BlockMatrix();
+      BlockMatrix(const Block& block);
+      BlockMatrix(const BlockMatrix& other);
+
+      //! Will calculate the product of two matrices.
+      //! Since the matrices values are pretty much sudo-random,
+      //! they will most likely integer-overflow.
+      //! So see this as a one-way function.
+      BlockMatrix MMult(const BlockMatrix& other) const;
+      BlockMatrix operator*(const BlockMatrix& other) const;
+
+      //! Will do a regular matrix-mult, but instead of
+      //! adding, and multiplying, all ints get xored.
+      BlockMatrix MXor(const BlockMatrix& other) const;
+
+      bool operator==(const BlockMatrix& other) const;
+      bool operator!=(const BlockMatrix& other) const;
+
+      void FromBlock(const Block& block);
+      Block ToBlock() const;
+
+    private:
+      //! Returns items of data, indexed by 4x4 coordinates
+      std::uint32_t& Get(const std::uint8_t row, const std::uint8_t column);
+      //! Returns items of data, indexed by 4x4 coordinates
+      const std::uint32_t& Get(const std::uint8_t row, const std::uint8_t column) const;
+
+      std::array<std::uint32_t, 16> data;
+  };
+
+}
+
+
+#endif
+

GCryptLib/include/GCrypt/Config.h

@@ -8,7 +8,7 @@ namespace Leonetienne::GCrypt {
   constexpr std::size_t BLOCK_SIZE = 512;
 
   // MUST BE > 2
-  constexpr std::size_t N_ROUNDS = 400;
+  constexpr std::size_t N_ROUNDS = 10;
 }
 
 #endif

GCryptLib/include/GCrypt/Version.h

@@ -1,7 +1,7 @@
 #ifndef GCRYPT_VERSION_H
 #define GCRYPT_VERSION_H
 
-#define GCRYPT_VERSION 0.23
+#define GCRYPT_VERSION 0.231
 
 #endif