Revert "first implementation of "pseudocode algorithm" (ms_corourke.pdf)"

This reverts commit ecdc32f5e0.

src/ntru_decrypt.c

@@ -19,27 +19,9 @@
  * MA  02110-1301  USA
  */
 
-#include "ntru_decrypt.h"
-
-/*
- * Legend
- *
- * N : highest degree of the polynom
- * q : "is given" (... mod q)
- * p : "is given" (... mod p)
- * f : private key
- * Fp: inverse of "modulo p"
- * e : encrypted message
- * a : result of first multiplication (StarMultiply(f, e, a, N, q))
- * d : result of second multiplication (StarMultiply(a, Fp , d, N, p)), decrypted message
- * */
-
 // Require: N , q, p, secret key f , inverse polynomial Fp , and encrypted message e.
 int ntru_decrypt(char *encr_msg, pb_poly *private_key, ntru_context *context, char ** decr_msg){
-	// toDo q = ?, p = ?, fp = ?
+	// StarMultiply(f, e, a, N, q)
-
-	pb_poly *a = first_multiply(private_key, encr_msg, q);// StarMultiply(f, e, a, N, q)
-
 	for(int i = 0, i < N, i++){
 		if(a[i] < 0 ) {
 			a[i] = a[i] + q; // Make all coefficients positive
@@ -48,20 +30,7 @@ int ntru_decrypt(char *encr_msg, pb_poly *private_key, ntru_context *context, ch
 			a[i] = a[i] - q // Shift coefficients of a into range (−q/2, q/2)
 		}
 	}
-	char* d = second_multiply(a, fp, p)// StarMultiply(a, Fp , d, N, p)
+	// StarMultiply(a, Fp , d, N, p)
-
 	// {Decode returns the decrypted message, d, through the argument list.}
-	return d;
+	return 0;
-}
-
-// toDo fix header file definition and types if needed!
-pb_poly* first_multiply(pb_poly *private_key, char *encr_msg, int q) {
-	// toDo a= f*e mod q
-	return NULL;
-}
-
-// toDo fix header file definition and types if needed!
-char* second_multiply(pb_poly *a, pb_poly *fp, int p) {
-	//toDo a*Fp mod p
-	return NULL;
 }

src/ntru_decrypt.h

@@ -26,7 +26,5 @@
 #include "context.h"
 
 int ntru_decrypt(char *encr_msg, pb_poly *private_key, ntru_context *context, char ** decr_msg);
-pb_poly* first_multiply(pb_poly*, char*, int);
-char* first_multiply(pb_poly*, pb_poly*, int);
 
 #endif /* NTRU_DECRYPT */