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

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

Localic sup-lattices and tropological systems

By Resende P.   Vickers S.  

Theoretical Computer Science, Vol. 305, Iss. 1, 2003-08 ,pp. : 311-346

Elsevier

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

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