Encryption, Post Quantum Cryptography, Elliptic Curve, Digital Signatures, Kyber.
by multiplying it with ⌊q/2​⌉, i.e. the integer closest to q/2​. In our example with q=17, ⌊q/2​⌉=9. Our final ready-to-be-encrypted message therefore is: m=⌊q/2​⌉⋅mb​=9⋅mb​=9x³+9x+9 We encrypt m using the public key (A,t). The encryption procedure calculates two values (u, v). In our example,