Cost-effective design for binary Edwards elliptic curves crypto-processor over GF (2 N ) using parallel multipliers and architectures

Author： Al-Haija Qasem Abu

Publisher： Inderscience Publishers

ISSN： 1744-1765

Source： International Journal of Information and Computer Security, Vol.5, Iss.3, 2013-08, pp. : 236-250

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A cryptographic processor for arbitrary elliptic curves over GF(2^m)

By Eberle Hans Gura Nils Shantz Sheueling Chang Gupta Vipul

International Journal of Embedded Systems, Vol. 3, Iss. 4, 2009-01 ,pp. : 241-255

Inderscience Publishers

Access to resources Recommend Favorite

Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier

By Ors Berna Batina Lejla Preneel Bart Vandewalle Joos

International Journal of Embedded Systems, Vol. 3, Iss. 4, 2009-01 ,pp. : 229-240

Inderscience Publishers

Access to resources Recommend Favorite

Design of a dedicated parallel processor for the simulation of the photolithography process using a genetic algorithm

By Karafyllidis I.

Engineering Applications of Artificial Intelligence, Vol. 12, Iss. 4, 1999-08 ,pp. : 411-427

Elsevier

Access to resources Recommend Favorite

GF(2^m)上椭圆曲线标量乘快速算法研究Research on Fast Algorithms for Scalar Multiplication of Elliptic Curve over GF(2^m)

By 孙俐周梦

Computer Science and Application, Vol. 4, Iss. 4, 2014-04 ,pp. : 76-84

汉斯出版社

Access to resources Recommend Favorite

Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2^m) Generated by AOPs

By Imaña J.L. Sánchez J.M.

Journal of VLSI Signal Processing, Vol. 42, Iss. 3, 2006-03 ,pp. : 285-296

Springer Publishing Company

Access to resources Recommend Favorite