dc.creatorMIGUEL MORALES SANDOVAL
dc.creatorCLAUDIA FEREGRINO URIBE
dc.creatorRENE ARMANDO CUMPLIDO PARRA
dc.creatorIGNACIO ALGREDO BADILLO
dc.date2009
dc.date.accessioned2023-07-25T16:23:08Z
dc.date.available2023-07-25T16:23:08Z
dc.identifierhttp://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1178
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7806376
dc.descriptionA hardware architecture for GF(2m) multiplication and its evaluation in a hardware architecture for elliptic curve scalar multiplication is presented. The architecture is a parameterizable digit-serial implementation for any field order m. Area/performance trade-off results of the hardware implementation of the multiplier in an FPGA are presented and discussed.
dc.formatapplication/pdf
dc.languageeng
dc.publisherElsevier Ltd
dc.relationcitation:Morales-Sandoval, M., et al., (2009). An area/performance trade-off analysis of a GF(2m) multiplier architecture for elliptic curve cryptography, Computers and Electrical Engineering (35): 54–58
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/cti/1
dc.subjectinfo:eu-repo/classification/cti/12
dc.subjectinfo:eu-repo/classification/cti/1203
dc.subjectinfo:eu-repo/classification/cti/1203
dc.titleAn area/performance trade-off analysis of a GF(2m) multiplier architecture for elliptic curve cryptography
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.audiencestudents
dc.audienceresearchers
dc.audiencegeneralPublic


Este ítem pertenece a la siguiente institución