Decoding Problems via Quantization
Saved in:
| Title: | Decoding Problems via Quantization |
|---|---|
| Authors: | Purtipli, Bharath |
| Publication Year: | 2025 |
| Collection: | Munich University of Technology (TUM): mediaTUM |
| Subject Terms: | Code-based Cryptography, Hamming Quasi-Cyclic, Post-Quantum Cryptography, Lossy Source Coding, 000 Informatik, Wissen, Systeme |
| Description: | Due to the vulnerability of current state-of-the-art public-key cryptosystems to efficient attacks using quantum computers, novel quantum-resistant algorithms are required. Code-based cryptosystems such as Hamming Quasi-Cyclic (HQC) are of particular interest not only because they are assumed to be safe from quantum attacks, but they are also possible candidates for fully homomorphic encryption schemes [bacr25]. However, they suffer from large ciphertext sizes which leads to inefficient communication. In this work, we explore the feasibility of quantization as a means to reduce the ciphertext length in code-based cryptosystems. We successfully reduced the ciphertext length of the HQC scheme by 12% by introducing a trade-off in the computational complexity of encryption and decryption. |
| Document Type: | master thesis |
| File Description: | application/pdf |
| Language: | English |
| Relation: | https://mediatum.ub.tum.de/1792261; https://mediatum.ub.tum.de/doc/1792261/document.pdf |
| Availability: | https://mediatum.ub.tum.de/1792261 https://mediatum.ub.tum.de/doc/1792261/document.pdf |
| Rights: | info:eu-repo/semantics/openAccess |
| Accession Number: | edsbas.E982180 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Due to the vulnerability of current state-of-the-art public-key cryptosystems to efficient attacks using quantum computers, novel quantum-resistant algorithms are required. Code-based cryptosystems such as Hamming Quasi-Cyclic (HQC) are of particular interest not only because they are assumed to be safe from quantum attacks, but they are also possible candidates for fully homomorphic encryption schemes [bacr25]. However, they suffer from large ciphertext sizes which leads to inefficient communication. In this work, we explore the feasibility of quantization as a means to reduce the ciphertext length in code-based cryptosystems. We successfully reduced the ciphertext length of the HQC scheme by 12% by introducing a trade-off in the computational complexity of encryption and decryption. |
|---|