.png){kind=icon}
返回
Generating Very Large RNS Bases
.png){kind=icon}
OA
AI
DOI：10.1109/TETC.2022.3187072.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Residue Number Systems (RNS) are proven to be effective in speeding up computations involving additions and products. For these representations, there exists efficient modular reduction algorithms that can be used in the context of arithmetic over finite fields or modulo large numbers, especially when used in the context of cryptographic engineering. Their independence allows random draws of bases, which also makes it possible to protect against side-channel attacks, or even to detect them using redundancy. These systems are easily scalable, however the existence of large bases for some specific uses remains a difficult question. In this article, we present four techniques to extract RNS bases from specific sets of integers, giving better performance and flexibility to previous works in the litterature. While our techniques do not allow to solve efficiently every possible case, we provide techniques to provably and efficiently find the largest possible available RNS bases in several cases, improving the state-of-the-art on various works of the recent literature.
Keyword:
Filtering
Arithmetic
Computer architecture
Signal processing algorithms
Redundancy
Heuristic algorithms
Finite element analysis
Residue number systems
setwise coprime
modular arithmetic
cryptography
期刊
IF:
5.4
论文数:
1.1K
被引数:
3.4K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏分享收藏
查看更多内容