Provide a technical analysis of Lattice-based cryptography as a candidate for post-quantum security. Define the Learning With Errors (LWE) problem and the Shortest Vector Problem (SVP). Explain why these problems are considered hard for both classical and quantum computers (specifically addressing why Shor's algorithm does not easily break them). Compare the key sizes and encryption/decryption speeds of a lattice-based scheme (e.g., Kyber or NTRU) against traditional RSA and ECC schemes.