Suegami and Bottazzi proposed diamond iO in , a new iO construction based on lattices that replaces expensive recursive encryption with lightweight matrix operations, significantly reducing complexity. Suegami和Bottazzi在论文中提出了diamond iO,一种新的基于格的iO构造,通过轻量级矩阵操作替代了昂贵的递归加密过程,显著降低了复杂性。
Yuval Domb explored the duality of Barrett and Montgomery modular reduction algorithms in , proposing a new multi-precision modular reduction scheme that requires only $n^2+1$ digit multiplications, significantly improving computational efficiency. Yuval Domb在博客中探讨了Barrett和Montgomery模约简算法的对偶性,并提出了一种新的多精度模约简方案,仅需$n^2+1$次数字乘法,显著提升了计算效率。