Integer-Complexity-Bound-of-Post-Quantum-Cryptography

版本 1.0.0 (462.8 KB) 作者: steed huang
Graph and randomly generated permutation of the edge set (1, . . , n) is used to create the isomorphic graph for cryptography key pairs.
0.0
(0)
5.0 次下载
更新时间 2022/11/19
在 GitHub 上查看许可证
In number theory, the integer complexity of an integer is the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses. It is always within a constant factor of the logarithm of the given integer. The property is used to charaterize the hacking bound of the multivariate polynomials as an example, it applies to lattice as well.

引用格式

steed huang (2024). Integer-Complexity-Bound-of-Post-Quantum-Cryptography (https://github.com/steedhuang/Integer-Complexity-Bound-of-Post-Quantum-Cryptography), GitHub. 检索来源 .

MATLAB 版本兼容性
创建方式 R2022b
兼容任何版本
平台兼容性
Windows macOS Linux
标签 添加标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

无法下载基于 GitHub 默认分支的版本

版本 已发布 发行说明
1.0.0

要查看或报告此来自 GitHub 的附加功能中的问题，请访问其 GitHub 仓库。
要查看或报告此来自 GitHub 的附加功能中的问题，请访问其 GitHub 仓库。