Quantum security analysis of Module-LWE PQC based on practical cost estimates
The security of lattice-based cryptography relies on the computational complexity of solving the Shortest Vector Problem (SVP) on a high-dimensional lattice. Due to its efficacy in addressing SVP, lattice-based cryptographic systems have so far used the sieve algorithm to analyze their security. Pr...
সংরক্ষণ করুন:
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Ruhr-Universität Bochum
2025-09-01
|
| মালা: | Transactions on Cryptographic Hardware and Embedded Systems |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://tches.iacr.org/index.php/TCHES/article/view/12417 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|