Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields

This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2006 International Conference on Communications, Circuits, and Systems proceedings : Guilin University of Electronic Technology (GUET), Guilin Bravo Hotel, Guilin, China, June 25-28, 2006 Jg. 4; S. 2565 - 2568
1. Verfasser: Huapeng Wu
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2006
Schlagworte:
Arithmetic
Concurrent computing
Delay effects
Design optimization
Elliptic curve cryptography
Galois fields
Logic
Polynomials
Proposals
Very large scale integration
ISBN:9780780395848, 0780395840
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.
AbstractList This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.
Author Huapeng Wu
Author_xml – sequence: 1
  surname: Huapeng Wu
  fullname: Huapeng Wu
  organization: Dept. of Electr. & Comput. Eng., Univ. of Windsor, Windsor, ON
BookMark eNotjN1KwzAYQCMq6GZfQG_yAq1fmjQ_lzM4HVQU3P3I0i8QydrRVHRvb8Gdm8O5OQty1Q89EnLPoGIMzOPGWrv6rGoAWdW6YUZdkAUoDdw0ujGXpDBznFvoG1Lk_AUz3HAtxC2x7fBD7XA4JvyN04k-xan8cKNLCRN9-05TPKaIIw3DSB21yeVMh0DXsY8TzsLU5TtyHVzKWJy9JNv189a-lu37y8au2jIamEovO0BonFTe1d7JGoNy6CH4ACEo5vneM2n2gcvAO8fRCyMDC1oZiaKr-ZI8_G8jIu6OYzy48bQTIMUM_wO8dk4K
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCCAS.2006.285197
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 0780395859
9780780395855
EndPage 2568
ExternalDocumentID 4064444
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-c6d0e05a67ca2ca62ef7aec0fcf0ff71c3bc169bf36f3da3ec496f1f8796e4d23
IEDL.DBID RIE
ISBN 9780780395848
0780395840
IngestDate Wed Aug 27 01:59:48 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-c6d0e05a67ca2ca62ef7aec0fcf0ff71c3bc169bf36f3da3ec496f1f8796e4d23
PageCount 4
ParticipantIDs ieee_primary_4064444
PublicationCentury 2000
PublicationDate 2006-June
PublicationDateYYYYMMDD 2006-06-01
PublicationDate_xml – month: 06
  year: 2006
  text: 2006-June
PublicationDecade 2000
PublicationTitle 2006 International Conference on Communications, Circuits, and Systems proceedings : Guilin University of Electronic Technology (GUET), Guilin Bravo Hotel, Guilin, China, June 25-28, 2006
PublicationTitleAbbrev ICCCAS
PublicationYear 2006
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000393844
Score 1.4120429
Snippet This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity...
SourceID ieee
SourceType Publisher
StartPage 2565
SubjectTerms Arithmetic
Concurrent computing
Delay effects
Design optimization
Elliptic curve cryptography
Galois fields
Logic
Polynomials
Proposals
Very large scale integration
Title Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields
URI https://ieeexplore.ieee.org/document/4064444
Volume 4
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED21FQMsfLSIb3lgJNSJjWOPEFGBBFUlOnSrHNsnRapa1KYg_j12UgJILGRJLkNi2Ynf3dnvHsClRemnXmEizX2I4j-SPNI2xDy5spSxmFutK7GJdDiUk4kateCq4cI456rNZ-46XFZr-XZh1iFV1vfgw_3Rhnaaipqr1eRTAsdUcl5F5tIbHlg3JZ0aW36RZqjqP2ZZdvtSL0YkMrA3f8mrVOgy2P1fu_ag903TI6MGgPah5eYHsPOjwmAXsqfFOwn_fKh7WX6Qu6KMRnoZBFRm5LneTOiBkXjXlWhSKWSSBZJBEVxRf3Izu-rBeHA_zh6ijW5CVChaRkZY6uiNFqnRidEicZhqZygapIhpbFhuYqFyZAKZ1cwZrgTGKFMlHLcJO4TOfDF3R0CUyGPrH2WQIY-t1NT5CUBY78Uh-rccQzf0xvS1rowx3XTEyd-3T2G7TmCEHMYZdMrl2p3Dlnkri9XyohrOTx11ng0
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VggQsPArijQdGQp3YOPYIEVUr2qoSHbpVjh9SpapBbQri32MnIYDEQpbkMiSWnfi7O_u7D-BGW-6mXqYCSV2I4j6SNJDaxzyp0JiQkGopC7GJeDjkk4kYNeC25sIYY4rNZ-bOXxZr-TpTa58qazvwoe7YgE2vnFWxteqMimeZckqL2Jw7w0FrVdSptvkXbQaLdi9JkoeXcjki4p6_-UtgpcCXzt7_WrYPR99EPTSqIegAGmZxCLs_agy2IOln78j_9b7yZf6BHmd5MJJLL6EyR4NyO6GDRuScVyRRoZGJMos6M--MupOZ69URjDtP46QbVMoJwUzgPFBMY4PvJYuVjJRkkbGxNApbZbG1cahIqkImUkuYJVoSo6hgNrQ8FsxQHZFjaC6yhTkBJFgaavcoZYmloeYSGzcFMO38OGvdW06h5Xtj-lrWxphWHXH29-1r2O6OB_1pvzd8PoedMp3hMxoX0MyXa3MJW-otn62WV8XQfgKNmaFW
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2006+International+Conference+on+Communications%2C+Circuits%2C+and+Systems+proceedings+%3A+Guilin+University+of+Electronic+Technology+%28GUET%29%2C+Guilin+Bravo+Hotel%2C+Guilin%2C+China%2C+June+25-28%2C+2006&rft.atitle=Low+Complexity+Bit-Parallel+Multiplier+for+a+Class+of+Finite+Fields&rft.au=Huapeng+Wu&rft.date=2006-06-01&rft.pub=IEEE&rft.isbn=9780780395848&rft.volume=4&rft.spage=2565&rft.epage=2568&rft_id=info:doi/10.1109%2FICCCAS.2006.285197&rft.externalDocID=4064444
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780395848/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780395848/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780395848/sc.gif&client=summon&freeimage=true