Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/52759
Type: Artigo de periódico
Title: Low-complexity bit-parallel square root computation over GF(2(m)) for all trinomials
Author: Rodriguez-Henriquez, F
Morales-Luna, G
Lopez, J
Abstract: In this contribution, we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied to any type of irreducible polynomials. We derive explicit formulas for the space and time complexities associated with the square root operator when working with binary extension fields generated using irreducible trinomials. We show that, for those finite fields, it is possible to compute the square root of an arbitrary field element with equal or better hardware efficiency than the one associated with the field squaring operation. Furthermore, a practical application of the square root operator in the domain of field exponentiation computation is presented.
Subject: finite-field arithmetic
binary extension fields
cryptography
Country: EUA
Editor: Ieee Computer Soc
Rights: fechado
Identifier DOI: 10.1109/TC.2007.70822
Date Issue: 2008
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000254044800004.pdf1.09 MBAdobe PDFView/Open


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