An area/performance trade-off analysis of a GF\((2^m)\) multiplier architecture for elliptic curve cryptography

DOI10.1016/J.COMPELECENG.2008.05.008zbMath1178.68232OpenAlexW2104083139MaRDI QIDQ1013332

Miguel Morales-Sandoval, Claudia Feregrino-Uribe, Ignacio Algredo-Badillo, Rene Cumplido

Publication date: 17 April 2009

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2008.05.008

zbMATH Keywords

hardware architecture

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computer system organization (68M99)

Related Items (2)

An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform ⋮ Improving e-payment security using elliptic curve cryptosystem

This page was built for publication: An area/performance trade-off analysis of a GF\((2^m)\) multiplier architecture for elliptic curve cryptography