ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: P. K. Meher Nanyang Technological University, Singapore
Yajun Ha National University of Singapore, Singapore
Chiou-Yng Lee Lunghwa University, Taiwan
Published in:
Cover Image
 
· Proceeding
ASP-DAC '09 Proceedings of the 2009 Asia and South Pacific Design Automation Conference
IEEE Press Piscataway, NJ, USA ©2009
table of contents ISBN: 978-1-4244-2748-2
An optimized design for serial-parallel finite field multiplication over <i>GF</i>(2<sup><i>m</i></sup>) based on all-one polynomials 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 19
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder