Faster multiplication over $${\mathbb {F}}_2[X]$$ F 2 [ X

IF 1.5 4区计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS

Journal of Cryptographic Engineering Pub Date : 2022-01-11 DOI:10.1007/s13389-021-00278-3

J. Robert, P. Véron

引用次数: 1

查看原文本刊更多论文

更快的乘法除以$${\mathbb {F}}_2[X]$$ F 2 [X]

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Cryptographic Engineering COMPUTER SCIENCE, THEORY & METHODS-

CiteScore

4.70

自引率

0.00%

发文量

期刊介绍： The Journal of Cryptographic Engineering (JCEN) presents high-quality scientific research on architectures, algorithms, techniques, tools, implementations and applications in cryptographic engineering, including cryptographic hardware, cryptographic embedded systems, side-channel attacks and countermeasures, and embedded security. JCEN serves the academic and corporate R&D community interested in cryptographic hardware and embedded security.JCEN publishes essential research on broad and varied topics including:Public-key cryptography, secret-key cryptography and post-quantum cryptographyCryptographic implementations include cryptographic processors, physical unclonable functions, true and deterministic random number generators, efficient software and hardware architecturesAttacks on implementations and their countermeasures, such as side-channel attacks, fault attacks, hardware tampering and reverse engineering techniquesSecurity evaluation of real-world cryptographic systems, formal methods and verification tools for secure embedded design that offer provable security, and metrics for measuring securityApplications of state-of-the-art cryptography, such as IoTs, RFIDs, IP protection, cyber-physical systems composed of analog and digital components, automotive security and trusted computing