coding the matrix week1 GF(2)

Addition of 0 and 1 in the Galois Field 2 is just like exclusive-or.

image.png
image.png
def encrypt(p,k): return p+k
from GF2 import one
k = one
p = one

c = encrypt(p, k)
print c

Now, suppose an eavesdropper Eve, observes the value of c.
So, let's suppose the secret key is chosen by flipping a coin.


image.png
image.png

So, you can see in this case, you could effectively double the throughput from this source to these two recipients using GF2 addition.

©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容