.png){kind=icon}
返回
Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2022.3215638.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Modulo polynomial multiplication is an essential mathematical operation in the area of finite field arithmetic. Polynomial functions can be represented as tensors, which can be utilized as basic building blocks for various lattice-based post-quantum cryptography schemes. This paper presents a tensor-based novel modulo multiplication method for multivariate polynomials over GF(2(m)) and is realized on the hardware platform (FPGA). The proposed method consumes 6.5x less power and achieves more than 6x speedup compared to other contemporary single variable polynomial multiplication implementations. Our method is embarrassingly parallel and easily scalable for multivariate polynomials. Polynomial functions of nine variables, where each variable is of degree 128, are tested with the proposed multiplier, and its corresponding area, power, and power-delay-area product (PDAP) are presented. The computational complexity of single variable and multivariate polynomial multiplications are O(n) and O(np), respectively, where n is the maximum degree of a polynomial having p variables. Due to its high speed, low latency, and scalability, the proposed modulo multiplier can be used in a wide range of applications.
Keyword:
Tensors
Hardware
Throughput
Field programmable gate arrays
Computer architecture
Scalability
Computational complexity
Multivariate polynomial
cryptography
tensor
homomorphic encryption
modulo multiplication
field programmable gate array (FPGA)
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Properties of Cholesterol-reduced Block-type Process Cheese Made by Crosslinked β-Cyclodextrin胆固醇降低型块状加工奶酪的性质：由交联β-环糊精制成OAAI
.png){kind=icon}
OAAI分享收藏Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination
OAAI
OAAI分享收藏
查看更多内容