The National Institute of Standards and Technology (NIST) has launched a program and competition to standardize one or more post-quantum cryptographic (PQC) algorithms to fight against quantum attacks. In this work, we have conducted the first-ever mathematical analysis of lattice-based and polynomial-based PQC by introducing the relationship between automorphism and homomorphism. This analysis can help enterprises and organizations leverage NIST-selected PQC algorithms to safeguard their digital services from quantum attacks. We performed the simulation to illustrate brute force broken probability for polynomial-based or multivariate-based PQC to validate our mathematical analysis of PQC by using Yitang Zhang's Landau-Siegel zero bound.
引用格式
steed huang (2024). Landau-Siegel Bound of Post Quantum Cryptography (https://www.mathworks.com/matlabcentral/fileexchange/120358-landau-siegel-bound-of-post-quantum-cryptography), MATLAB Central File Exchange. 检索来源 .
MATLAB 版本兼容性
创建方式
R2022b
兼容任何版本
平台兼容性
Windows macOS Linux标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0 |