Encryption, Post Quantum Cryptography, Elliptic Curve, Digital Signatures, Kyber.
message, we have to turn it into a polynomial. We For example, we want to encrypt the number 11. Eleven has a binary representation of 1011​=(1011)2​. Our message encoded as binary polynomial therefore is: mb=1x³+0x²+1x¹+1x⁰=x³+x+1 Before encryption we have to scale this polynomial. We upscale mb​