Quantum cryptography-Kyber Algorithm example

Kyber is designed to protect today’s data from the future threat of "Q-Day"—the point at which a quantum computer becomes powerful enough to break current encryption like RSA and Elliptic Curve Cryptography (ECC). Why we need Kyber: Traditional encryption relies on mathematical problems like Integer Factorization (RSA) or Discrete Logarithms (ECC). While classical computers take "trillions of years" to solve, a quantum computer running Shor’s Algorithm can solve them in minutes. There is a need for Quantum cryptography algorithm. Kyber operates on a variation called Module-LWE (MLWE). it works with polynomials. Kyber will be solved in 3 steps Public key Generation Encryption - Calculate Cipher text u, v Decryption – Decrypt Cipher text. Key Generation: private key: s=(-x^3-x^2+x,-x^3-x) A Kyber public key consists of two elements. A matrix of random polynomials A and a vector of polynomials t. Generation of the matrix is fairly simple, we just generate random coefficients and take them