Referenced Items are not available for this document.
Generalizing a construction of Silverman (1999), we describe a redundant representation of finite fields GF(qn), where computations in GF(qn) are realized through computations in a suitable residue class algebra. Our focus is on fields of characteristic ≠ 2 and we show that the representation discussed here can, in particular, be used for designing a highly regular multiplication circuit for GF(qn).
Published in:
Computers, IEEE Transactions on
(Volume:52
,
Issue:
7
)
Date of Publication: Jul 2003
- Page(s):
- 848 - 853
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 7682051
- Digital Object Identifier :
- 10.1109/TC.2003.1214334
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 26 July 2004
- Issue Date :
- Jul 2003
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
