more of the continuing C++ outbreak

include/codecrypt.h

@@ -4,28 +4,78 @@
 
 #include <vector>
 
-namespace ccr {
+namespace ccr
+{
 
-	typedef std::vector<bool> bvector;
-	//for broken/old/weird STL uncomment this:
-	//typedef std::bit_vector bvector;
-	//TODO ifdef
+typedef unsigned int uint;
 
-	class matrix : public std::vector<bvector> {
+/*
+ * vector over GF(2). We rely on STL's vector<bool> == bit_vector
+ * specialization for efficiency.
+ */
+class bvector : public std::vector<bool>
+{
+public:
+	uint hamming_weight();
+};
 
-	};
+/*
+ * pseudorandom number generator. Meant to be inherited and
+ * instantiated by the user
+ */
+class prng
+{
+public:
+	virtual int random (uint) = 0;
+	virtual void request_seed (uint) = 0;
+};
 
-	class permutation : public std::vector<unsigned int> {
+/*
+ * matrix over GF(2) is a vector of columns
+ */
+class matrix : public std::vector<bvector>
+{
+public:
+	matrix operator* (const matrix&);
 
-	};
+	bool compute_inversion (matrix&);
+	void generate_random_invertible (uint, prng&);
+	void unit (uint);
+	void compute_transpose (matrix&);
+};
 
-	class polynomial : public bvector {
+/*
+ * permutation is stored as transposition table ordered from zero
+ * e.g. (13)(2) is [2,1,0]
+ */
+class permutation : public std::vector<uint>
+{
+	void compute_inversion (permutation&);
 
-	};
+	void generate_random (uint n, prng&);
+	void permute_rows (const matrix&, matrix&);
+	void permute_cols (const matrix&, matrix&);
+};
 
-	namespace mce {
-		class privkey {
-		public:
+/*
+ * polynomial over GF(2) is effectively a vector with a_n binary values
+ * with some added operations.
+ */
+class polynomial : public bvector
+{
+	bool is_irreducible();
+
+	void generate_random_irreducible (uint n, prng&);
+};
+
+/*
+ * classical McEliece
+ */
+namespace mce
+{
+class privkey
+{
+public:
 	matrix Sinv;
 	permutation Pinv;
 
@@ -35,39 +85,46 @@ namespace ccr {
 	polynomial g;
 	matrix sqInv; //"cache"
 
-			int decrypt(const bvector&, bvector&);
-		};
+	int decrypt (const bvector&, bvector&);
+};
 
-		class pubkey {
-		public:
+class pubkey
+{
+public:
 	matrix G;
-			int t;
-			int encrypt(const bvector&, bvector&);
-		};
+	uint t;
+	int encrypt (const bvector&, bvector&, prng&);
+};
 
-		int generate(pubkey&,privkey&);
-	}
+int generate (pubkey&, privkey&, prng&);
+}
 
-	namespace nd {
-		class privkey {
+/*
+ * classical Niederreiter
+ */
+namespace nd
+{
+class privkey
+{
+public:
+	/*todo stuff*/
 
-			int decrypt(const bvector&, bvector&);
-		};
+	int decrypt (const bvector&, bvector&);
+};
 
-		class pubkey {
-		public:
+class pubkey
+{
+public:
 	matrix H;
-			int t;
+	uint t;
 
-			int encrypt(const bvector&, bvector&);
-		};
+	int encrypt (const bvector&, bvector&, prng&);
+};
 
-		int generate(pubkey&,privkey&);
-	}
+int generate (pubkey&, privkey&, prng&);
+}
 
-	//TODO entropy sources
-
-} //namespace CCR
+} //namespace ccr
 
 #endif // _CODECRYPT_H_
 

lib/bvector.cpp

@@ -0,0 +1,11 @@
+
+#include "codecrypt.h"
+using namespace ccr;
+
+uint bvector::hamming_weight()
+{
+	uint r = 0;
+	for (uint i = 0; i < size(); ++i) if ( (*this) [i]) ++r;
+	return r;
+}
+

lib/matrix.cpp

@@ -0,0 +1,25 @@
+
+#include "codecrypt.h"
+
+using namespace ccr;
+
+void matrix::unit (uint size)
+{
+
+}
+
+bool matrix::compute_inversion (matrix&r)
+{
+
+	return false;
+}
+
+void matrix::generate_random_invertible (uint size, prng&rng)
+{
+
+}
+
+void matrix::compute_transpose (matrix&r)
+{
+
+}

lib/permutation.cpp

@@ -0,0 +1,25 @@
+
+#include "codecrypt.h"
+
+using namespace ccr;
+
+void permutation::compute_inversion (permutation&r)
+{
+
+}
+
+void permutation::generate_random (uint size, prng&rng)
+{
+
+}
+
+void permutation::permute_cols (const matrix&a, matrix&r)
+{
+
+}
+
+void permutation::permute_rows (const matrix&a, matrix&r)
+{
+
+}
+

lib/polynomial.cpp

@@ -0,0 +1,15 @@
+
+#include "codecrypt.h"
+
+using namespace ccr;
+
+bool polynomial::is_irreducible()
+{
+
+}
+
+void polynomial::generate_random_irreducible (uint size, prng&rng)
+{
+
+}
+