Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Software multiplication using Gaussian normal bases
Author: Dahab, R
Hankerson, D
Hu, F
Long, M
Lopez, J
Menezes, A
Abstract: Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields IF(2m). In this paper, we present new software algorithms for efficient multiplication over IF(2m) that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.
Subject: multiplication in IF(2)m
Gaussian normal basis
elliptic curve cryptography
Country: EUA
Editor: Ieee Computer Soc
Rights: fechado
Identifier DOI: 10.1109/TC.2006.132
Date Issue: 2006
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000238362900004.pdf539.9 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.