The advent of quantum computing presents grave dangers to established encryption methods like RSA and Elliptic Curve Cryptography (ECC), so the rapid integration of post-quantum cryptography (PQC) into key infrastructures is vital. This paper proposes such a quantum-resistant electronic voting system through Kyber. For decentralized integrity assurance, it is integrated alongside blockchain, with Kyber existing as a NIST-standardized lattice-based key encapsulation mechanism (KEM). We leverage the hardness of lattice problems (e.g., Learning with Errors) in order to address vulnerabilities in conventional e-voting systems as well as empirically benchmark practical scalability.Quantum computers are powerful enough to decrypt any data encrypted using the current techniques. Thus, it is important to come up with Post-Quantum Cryptography techniques (PQC). One such technique is used to solve the problem of online voting systems. In a world of ballot voting, with the advancements of computers, it is essential to make online voting a possibility. Online voting poses the threat of electoral fraud as fake votes can be forged online. This paper proposes a voting system that is resistant to quantum computers and quantum attacks. Lattice Cryptography is one such encryption technique that is based on lattice points which takes advantage of the exponentially rising complexity with the rise in lattice dimensions. Kyber uses polynomial functions to produce lattices for encryption. The aftermath is carried out in a blockchain environment where the valid votes are counted. This system is designed to be secure even if the adversary has access to a quantum computer which is very likely in the near future given the stakes are as high as the control to a nation.