信息论安全的可信验证算法

ryptography is the cornerstone of trusted computing. At present, classical Cryptography has been seriously challenged by quantum computing. Although Post-Quantum Cryptography (PQC) can resist quantum attacks, with the development and maturity of quantum computing, the emergence of new quantum attack will be inevitable. Whether the security of the PQC algorithm can be effective in the long run is unknown. Based on this, we propose a trusted verification algorithm with information-theoretic security, which is designed using modular operations. Its security is a direct inference based on mathematical theories and does not rely on any difficult problem assumptions. Therefore, trusted verification algorithm can resist quantum attacks completely.