首页> 外文OA文献 >Analysis and prediction of area- and energy-consumption of optimized polynomial multipliers in hardware for arbitrary GF(2ⁿ) for elliptic curve cryptography

【2h】

Analysis and prediction of area- and energy-consumption of optimized polynomial multipliers in hardware for arbitrary GF(2ⁿ) for elliptic curve cryptography

机译：用于椭圆曲线密码的任意GF（2ⁿ）的硬件中的多项式乘法器

页面导航

著录项
相似文献
相关主题

著录项

作者
Dyka Zoya;
展开▼
作者单位

展开▼
年度 2013
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. New Hardware Architecture for Multiplication over GF(2~m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography [J] . Soonhak KWON, Taekyoung KWON, Young-Ho PARK IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences . 2008,第1期

机译：用于GF（2〜m）乘法的新硬件体系结构以及与椭圆曲线密码术的正态和多项式基乘的比较
2. An area/performance trade-off analysis of a GF(2{sup}m) multiplier architecture for elliptic curve cryptography [J] . Miguel Morales-Sandoval, Claudia Feregrino-Uribe, Rene Cumplido, Computers and Electrical Engineering . 2009,第1期

机译：椭圆曲线密码学的GF（2 {sup} m）乘法器体系结构的面积/性能折衷分析
3. A NOVEL EFFICIENT HARDWARE IMPLEMENTATION OF ELLIPTIC CURVE CRYPTOGRAPHY SCALAR MULTIPLICATION USING VEDIC MULTIPLIER [J] . Rakesh K. Kadu, Dattatraya. S. Adane International journal of simulation: systems, science and technology . 2018,第6aaPagea2期

机译：使用Vedic乘法器的椭圆曲线密码术乘法的新型高效硬件实现
4. New Architecture for Multiplication in GF(2~m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography [C] . Soonhak Kwon, Taekyoung Kwon, Young-Ho Park International Conference on Information Security and Cryptology . 2006

机译：用于GF（2〜M）中乘法的新架构以及具有椭圆曲线密码术的正常和多项式基乘子的比较
5. Fast and Flexible Hardware Support for Elliptic Curve Cryptography over Multiple Standard Prime Finite Fields. [D] . Alrimeih, Hamad. 2012

机译：对多个标准素有限域上的椭圆曲线密码学提供快速灵活的硬件支持。
6. iTrust—A Trustworthy and Efficient Mapping Scheme in Elliptic Curve Cryptography [O] . Hisham Almajed, Ahmad Almogren, Mohammed Alabdulkareem 2020

机译：ITRUST-A Queltworthy且有效的椭圆曲线密码映射方案
7. A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values [O] . Hamilton, Mark, Marnane, William,, Tisserand, Arnaud 2011

机译：适用于特定p值的GF（p）上适合椭圆曲线密码的模块化乘法器FPGA的比较

Analysis and prediction of area- and energy-consumption of optimized polynomial multipliers in hardware for arbitrary GF(2ⁿ) for elliptic curve cryptography

著录项

相似文献

相关主题

期刊订阅