با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت مقاله خود را دریافت کنید (تا مشکل رفع گردد). با تشکر از صبوری شما!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
دسته بندی:
محاسبات کوانتومی - Quantum-Computing
سال انتشار:
2022
عنوان انگلیسی مقاله:
Efficient Hardware Implementation of Finite Field Arithmetic AB + C for Binary Ring-LWE Based Post-Quantum Cryptography
ترجمه فارسی عنوان مقاله:
اجرای سخت افزار کارآمد محاسبات میدان محدود AB + C برای رمزنگاری پس کوانتومی مبتنی بر حلقه باینری-LWE
منبع:
ieee - ieee Transactions on Emerging Topics in Computing;2022;10;2;10:1109/TETC:2021:3091982
نویسنده:
Jiafeng Xie; Pengzhou He; Xiaofang Wang; Jose L. Imana
چکیده انگلیسی:
Post-quantum cryptography (PQC) has gained significant attention from the community
recently as it is proven that the existing public-key cryptosystems are vulnerable to the attacks launched from
the well-developed quantum computers. The finite field arithmetic AB þ C, where A and C are integer polynomials and B is a binary polynomial, is the key component for the binary Ring-learning-with-errors (BRLWE)-
based encryption scheme (a low-complexity PQC suitable for emerging lightweight applications). In this paper,
we propose a novel hardware implementation of the finite field arithmetic AB þ C through three stages of interdependent efforts: (i) a rigorous mathematical formulation process is presented first; (ii) an efficient hardware
architecture is then presented with detailed description; (iii) a thorough implementation has also been given
along with the comparison. Overall, (i) the proposed basic structure (u ¼ 1) outperforms the existing designs,
e.g., it involves 55.9% less area-delay product (ADP) than [13] for n ¼ 512; (ii) the proposed design also offers
very efficient performance in time-complexity and can be used in many future applications.
INDEX TERMS: Binary ring-learning-with-errors | finite field arithmetic | FPGA platform | hardware design | post-quantum cryptography
قیمت: رایگان
توضیحات اضافی:
تعداد نظرات : 0