Low complexity bit-parallel multipliers for a class of finite fields

New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal t...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. 47; no. 8; pp. 883 - 887
Main Authors:	Huapeng Wu, Hasan, M.A.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.08.1998 Institute of Electrical and Electronics Engineers
Subjects:	Applied sciences Cryptography Design. Technologies. Operation analysis. Testing Electronics Electrostatic precipitators Exact sciences and technology Galois fields Integrated circuits Message-oriented middleware Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Integrated circuits Multiplier Finite field Implementation
ISSN:	0018-9340
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class.
AbstractList	New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class. New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class
Author	Huapeng Wu Hasan, M.A.
Author_xml	– sequence: 1 surname: Huapeng Wu fullname: Huapeng Wu organization: Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada – sequence: 2 givenname: M.A. surname: Hasan fullname: Hasan, M.A.
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2343648$$DView record in Pascal Francis
BookMark	eNpt0L1PwzAQBXAPRaIFBlamDAiJIe3ZTtxkROVTqsQCc3Rxz5KREwfbFfS_J6hVB8T0hvu9N9yMTXrfE2OXHOacQ73gYr6EZVlVEzYF4FVeywJO2SzGDwBQAuopu1_7r0z7bnD0bdMua23KBwzoHLms27pkB2cpxMz4kGGmHcaYeZMZ29tEY5DbxHN2YtBFujjkGXt_fHhbPefr16eX1d0613IpUq6wLYQSiNpALTdSEGqFIEXbSjQFlbrWhLJAMhKUhqoCUmIDoiXOlWzlGbvZ7w7Bf24ppqazUZNz2JPfxkZUslSiVCO8PkCMGp0J2GsbmyHYDsOuEbKQqqhGdrtnOvgYA5mj4ND8vrDhotm_cLSLP1bbhMn6PgW07t_G1b5hiei4fDj-AN6SfyM
CODEN	ITCOB4
CitedBy_id	crossref_primary_10_1023_A_1013860532636 crossref_primary_10_1007_s11265_015_1000_x crossref_primary_10_1109_TCSI_2016_2614309 crossref_primary_10_1016_S0167_9260_02_00053_6 crossref_primary_10_1109_TCSI_2016_2626375 crossref_primary_10_1109_12_936239 crossref_primary_10_1109_82_938363 crossref_primary_10_1109_TC_2003_1252850 crossref_primary_10_1109_TVLSI_2008_2003005 crossref_primary_10_1007_s00200_018_0378_7 crossref_primary_10_1109_TC_2005_199 crossref_primary_10_1109_12_926154 crossref_primary_10_1016_j_micpro_2004_03_003 crossref_primary_10_1109_TC_2002_1004597 crossref_primary_10_3745_KIPSTA_2004_11A_1_001 crossref_primary_10_1016_j_compeleceng_2005_09_002 crossref_primary_10_1007_s10440_006_9047_0 crossref_primary_10_1016_j_ipl_2013_10_009 crossref_primary_10_1007_s11390_007_9003_0 crossref_primary_10_1109_TC_2006_69 crossref_primary_10_1109_TC_2010_235 crossref_primary_10_2316_Journal_202_2007_4_202_1934 crossref_primary_10_1109_TC_2002_1004590 crossref_primary_10_1109_TC_2010_218 crossref_primary_10_1080_0020716031000079536 crossref_primary_10_1109_12_736433 crossref_primary_10_1049_iet_ifs_2010_0139 crossref_primary_10_1007_s10440_006_9071_0 crossref_primary_10_1109_TC_2007_70741
Cites_doi	10.1016/0166-218X(88)90090-X 10.1109/12.257715 10.1007/3-540-47555-9_14 10.1109/18.45274 10.1109/TIT.1982.1056591 10.1109/12.485570 10.1109/12.156539 10.1016/0890-5401(89)90045-X 10.1109/TC.1985.1676616
ContentType	Journal Article
Copyright	1998 INIST-CNRS
Copyright_xml	– notice: 1998 INIST-CNRS
DBID	RIA RIE AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1109/12.707588
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Applied Sciences
EndPage	887
ExternalDocumentID	2343648 10_1109_12_707588 707588
GroupedDBID	--Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XJT XOL XZL YXB YYQ YZZ ZCG AAYXX ABUFD CITATION IQODW RIG 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c372t-6ab4262aacf093d32eac6a032bb3af4e5c9cea34aef306c0880e62d02be1163b3
IEDL.DBID	RIE
ISICitedReferencesCount	58
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000075440700005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9340
IngestDate	Wed Oct 01 13:19:17 EDT 2025 Mon Jul 21 09:17:16 EDT 2025 Sat Nov 29 03:56:53 EST 2025 Tue Nov 18 21:02:36 EST 2025 Wed Aug 27 02:49:03 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	8
Keywords	Integrated circuits Multiplier Finite field Implementation
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c372t-6ab4262aacf093d32eac6a032bb3af4e5c9cea34aef306c0880e62d02be1163b3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	28356256
PQPubID	23500
PageCount	5
ParticipantIDs	pascalfrancis_primary_2343648 proquest_miscellaneous_28356256 ieee_primary_707588 crossref_primary_10_1109_12_707588 crossref_citationtrail_10_1109_12_707588
PublicationCentury	1900
PublicationDate	1998-08-01
PublicationDateYYYYMMDD	1998-08-01
PublicationDate_xml	– month: 08 year: 1998 text: 1998-08-01 day: 01
PublicationDecade	1990
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY
PublicationTitle	IEEE transactions on computers
PublicationTitleAbbrev	TC
PublicationYear	1998
Publisher	IEEE Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers
References	bibt08831 bibt08833 bibt088310 bibt08832 bibt08835 bibt08834 bibt08836 bibt08839 lidl (bibt08837) 1983 bibt08838
References_xml	– ident: bibt08839 doi: 10.1016/0166-218X(88)90090-X – ident: bibt08835 doi: 10.1109/12.257715 – ident: bibt08833 doi: 10.1007/3-540-47555-9_14 – ident: bibt08838 doi: 10.1109/18.45274 – ident: bibt08831 doi: 10.1109/TIT.1982.1056591 – ident: bibt08832 doi: 10.1109/12.485570 – year: 1983 ident: bibt08837 publication-title: Finite Fields – ident: bibt08834 doi: 10.1109/12.156539 – ident: bibt08836 doi: 10.1016/0890-5401(89)90045-X – ident: bibt088310 doi: 10.1109/TC.1985.1676616
SSID	ssj0006209
Score	1.7719225
Snippet	New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all...
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	883
SubjectTerms	Applied sciences Cryptography Design. Technologies. Operation analysis. Testing Electronics Electrostatic precipitators Exact sciences and technology Galois fields Integrated circuits Message-oriented middleware Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Title	Low complexity bit-parallel multipliers for a class of finite fields
URI	https://ieeexplore.ieee.org/document/707588 https://www.proquest.com/docview/28356256
Volume	47
WOSCitedRecordID	wos000075440700005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 0018-9340 databaseCode: RIE dateStart: 19680101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0006209 providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1BS8MwGA1ueNCD06k4dRrEg5duadKlzVHU4UGGB4XdSpImMCirrJv68_2StsPhLt5Km5bypd-Xl-blPYRuM0lUIihUv0TpIMoMDyTjJLBCWTsS3CmKeLOJeDJJplPxWuts-70wxhhPPjMDd-jX8rNCr9yvsmEM41uStFArjnm1VWtddHnD5gghf1lEahGhkIhhSAfVjRtDj_dScUxIWUIwbOVi8acg-1Fm3PnX-x2igxpM4vuq94_Qjpl3UacxasB13nbR_i_VwWP0-FJ8YU8lN9-AwbGaLQOnAJ7nJsc1wdAZZGPAs1hi7fA1Liy2M4dPsee8lSfoffz09vAc1GYKgWYxXQZcKic-L6W2RLCMUai4XBJGlWLSRmakhTaSRdJYmEVoKD7EcJoRqkwImE2xU9SeF3NzhjBgADaygMss4A8NGS1VBiiTKC0SK5Kkh-6aOKe6Vhp3hhd56mccRKQhTatY9dDNuulHJa-xrVHXxXrdoDnb3-i79WXKIsYjuH7d9GUKKePWQeTcFKsydRJzMO3j51ufe4H2qn2HjuR3idrLxcr00a7-XM7KxZX_6n4AHl3W7A
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSsQwFL34AnXhY1R8TxAXbqpp0sk0S_GB4ji4UHBXkjSBgaEVZ0b9fG_SdnDQjbvSpqXc9N6cNCfnAJzmiupUMqx-qTZRklsRKS5o5KR2riOFVxQJZhPdfj99fZVPtc522AtjrQ3kM3vuD8Nafl6aif9VdtHF8S1N52HRG2fVm7WmZVc0fI4YM5gntJYRiqm8iNl5devM4BPcVDwXUo0wHK7ysfhVksM4c7v-rzfcgLUaTpLLqv83Yc4WLVhvrBpInbktWP2hO7gF173ykwQyuf1CFE70YBx5DfDh0A5JTTH0FtkEES1RxHiETUpH3MAjVBJYb6NteLm9eb66i2o7hcjwLhtHQmkvP6-UcVTynDOsuUJRzrTmyiW2Y6SxiifKOpxHGCw_1AqWU6ZtjKhN8x1YKMrC7gJBFMA7DpGZQwRiMKeVzhFnUm1k6mSa7sFZE-fM1Frj3vJimIU5B5VZzLIqVntwMm36Vgls_NWo5WM9bdCcPZrpu-llxhMuErzebvoyw6TxKyGqsOVklHmROZz4if0_n9uG5bvnx17Wu-8_HMBKtQvRU_4OYWH8PrFHsGQ-xoPR-3H4Ar8BdPXaNQ
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%3Ajournal&rft.genre=article&rft.atitle=Low+complexity+bit-parallel+multipliers+for+a+class+of+finite+fields&rft.jtitle=IEEE+transactions+on+computers&rft.au=Huapeng+Wu&rft.au=Hasan%2C+M.A.&rft.date=1998-08-01&rft.issn=0018-9340&rft.volume=47&rft.issue=8&rft.spage=883&rft.epage=887&rft_id=info:doi/10.1109%2F12.707588&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_12_707588
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon