aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorReto <reto.fritsche@ost.ch>2021-04-25 22:15:29 +0200
committerReto <reto.fritsche@ost.ch>2021-04-25 22:15:29 +0200
commit1ff0ce6bce1798df6fa7867f37d50e0aeb8afeb0 (patch)
tree114ac2d29a61b050a5897d9c378ab5942dc5688d
parentMerge remote-tracking branch 'upstream/master' into mceliece (diff)
downloadSeminarMatrizen-1ff0ce6bce1798df6fa7867f37d50e0aeb8afeb0.tar.gz
SeminarMatrizen-1ff0ce6bce1798df6fa7867f37d50e0aeb8afeb0.zip
restructured mceliece code example
-rw-r--r--buch/papers/mceliece/example_code/mceliece_simple.py56
1 files changed, 29 insertions, 27 deletions
diff --git a/buch/papers/mceliece/example_code/mceliece_simple.py b/buch/papers/mceliece/example_code/mceliece_simple.py
index 3f17504..bac3b42 100644
--- a/buch/papers/mceliece/example_code/mceliece_simple.py
+++ b/buch/papers/mceliece/example_code/mceliece_simple.py
@@ -293,33 +293,35 @@ def blocks4_to_str(blocks):
string+=chr(char)
return string
-#shared attributes:
-n=7
-k=4
-t=1
+if __name__ == '__main__':
-#private key(s):
-g=Poly([1,1,0,1]) #generator polynom for 7/4 linear code (from table, 1.0 + 1.0·x¹ + 0.0·x² + 1.0·x³)
-P_M=gen_perm_M(n) #create permutation matrix
-G_M=create_linear_code_matrix(n, k, g) #linear code generator matrix
-S_M, S_inv=create_rand_bin_M(k, True) #random binary matrix and its inverse
-P_M_inv=P_M.T #inverse permutation matrix
-
-syndrome_table=create_syndrome_table(n, g) #part of linear-code decoder
-linear_code_decoder=lambda c:decode_linear_code(c, g, syndrome_table)
-
-#public key:
-pub_key=(P_M @ G_M @ S_M)%2
-
-
-msg_tx='Hello World?'
-
-blocks_tx=str_to_blocks4(msg_tx)
-encrypted=encrypt(blocks_tx, pub_key, t)
-
-blocks_rx=decrypt(encrypted, P_M_inv, linear_code_decoder, S_inv)
-msg_rx=blocks4_to_str(blocks_rx)
-
-print(f'msg_rx: {msg_rx}')
+ #shared attributes:
+ n=7
+ k=4
+ t=1
+
+ #private key(s):
+ g=Poly([1,1,0,1]) #generator polynom for 7/4 linear code (from table, 1.0 + 1.0·x¹ + 0.0·x² + 1.0·x³)
+ P_M=gen_perm_M(n) #create permutation matrix
+ G_M=create_linear_code_matrix(n, k, g) #linear code generator matrix
+ S_M, S_inv=create_rand_bin_M(k, True) #random binary matrix and its inverse
+ P_M_inv=P_M.T #inverse permutation matrix
+
+ syndrome_table=create_syndrome_table(n, g) #part of linear-code decoder
+ linear_code_decoder=lambda c:decode_linear_code(c, g, syndrome_table)
+
+ #public key:
+ pub_key=(P_M @ G_M @ S_M)%2
+
+
+ msg_tx='Hello World?'
+
+ blocks_tx=str_to_blocks4(msg_tx)
+ encrypted=encrypt(blocks_tx, pub_key, t)
+
+ blocks_rx=decrypt(encrypted, P_M_inv, linear_code_decoder, S_inv)
+ msg_rx=blocks4_to_str(blocks_rx)
+
+ print(f'msg_rx: {msg_rx}')
\ No newline at end of file