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

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

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

By Al-Haija Qasem Abu  

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

Inderscience Publishers

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

Steganographic manipulations with elliptic curve cryptography

By Shankar T.N.  

International Journal of Electronic Security and Digital Forensics, Vol. 4, Iss. 4, 2012-10 ,pp. : 280-297

Inderscience Publishers

Access to resources Recommend Favorite