Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs
This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA implementations of bit parallel mixed Karatsuba-Ofman multipliers (KOM) over GF(2 m ) . By introducing the common expression sharing and...
Uloženo v:
| Vydáno v: | IEEE transactions on very large scale integration (VLSI) systems Ročník 18; číslo 7; s. 1057 - 1066 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.07.2010
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1063-8210, 1557-9999 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA implementations of bit parallel mixed Karatsuba-Ofman multipliers (KOM) over GF(2 m ) . By introducing the common expression sharing and the complexity analysis on odd-term polynomials, we achieve a lower gate bound than previous ASIC discussions. The analysis is extended by using 4-input/6-input lookup tables (LUT) on FPGAs. For an arbitrary bit-depth, the optimum iteration step is shown. The optimum iteration steps differ for ASICs, 4-input LUT-based FPGAs and 6-input LUT-based FPGAs. We evaluate the LUT complexity and area-time product tradeoffs on FPGAs with different computer-aided design (CAD) tools. Furthermore, the experimental results on FPGAs for bit parallel modular multipliers are shown and compared with previous implementations. To the best of our knowledge, our bit parallel multipliers consume the least resources among known FPGA implementations to date. |
|---|---|
| AbstractList | This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA implementations of bit parallel mixed Karatsuba-Ofman multipliers (KOM) over GF(2 m ) . By introducing the common expression sharing and the complexity analysis on odd-term polynomials, we achieve a lower gate bound than previous ASIC discussions. The analysis is extended by using 4-input/6-input lookup tables (LUT) on FPGAs. For an arbitrary bit-depth, the optimum iteration step is shown. The optimum iteration steps differ for ASICs, 4-input LUT-based FPGAs and 6-input LUT-based FPGAs. We evaluate the LUT complexity and area-time product tradeoffs on FPGAs with different computer-aided design (CAD) tools. Furthermore, the experimental results on FPGAs for bit parallel modular multipliers are shown and compared with previous implementations. To the best of our knowledge, our bit parallel multipliers consume the least resources among known FPGA implementations to date. This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA implementations of bit parallel mixed Karatsuba-Ofman multipliers (KOM) over [Formula Omitted]. By introducing the common expression sharing and the complexity analysis on odd-term polynomials, we achieve a lower gate bound than previous ASIC discussions. The analysis is extended by using 4-input/6-input lookup tables (LUT) on FPGAs. For an arbitrary bit-depth, the optimum iteration step is shown. The optimum iteration steps differ for ASICs, 4-input LUT-based FPGAs and 6-input LUT-based FPGAs. We evaluate the LUT complexity and area-time product tradeoffs on FPGAs with different computer-aided design (CAD) tools. Furthermore, the experimental results on FPGAs for bit parallel modular multipliers are shown and compared with previous implementations. To the best of our knowledge, our bit parallel multipliers consume the least resources among known FPGA implementations to date. |
| Author | Michalik, Harald Hinsenkamp, László Gang Zhou |
| Author_xml | – sequence: 1 surname: Gang Zhou fullname: Gang Zhou email: zhou@ida.ing.tu-bs.de organization: Inst. of Comput. & Network Eng., Tech. Univ. of Braunschweig, Braunschweig, Germany – sequence: 2 givenname: Harald surname: Michalik fullname: Michalik, Harald email: michalik@ida.ing.tu-bs.de organization: Inst. of Comput. & Network Eng., Tech. Univ. of Braunschweig, Braunschweig, Germany – sequence: 3 givenname: László surname: Hinsenkamp fullname: Hinsenkamp, László email: hinsenk@dsi-it.de organization: Digital Signalprocessing & Inf. Technol., Bremen, Germany |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22946954$$DView record in Pascal Francis |
| BookMark | eNp9kcFq3DAQhk1JoUnaF2gvglLIxakkW7Z83CzZdMmWBJr2asbyqFWQpa0kQ_cF-tzVZpcccugc5h-Y7x-B_rPixHmHRfGe0UvGaPf54cfm2_qSU9rllkXKV8UpE6Itu1wneaZNVUrO6JviLMZHSlldd_S0-Lv009biH5N2ZOHA7qKJBNxIrrU2yqBLZL0HpjxBMt5F4jW5MoncQwBr0ZKVcSZhFrQj-TrbZLbWYIjkCiKOxDtym9EU5wHKOz2BIwv70weTfk375er-ZhHfFq812IjvjnpefF9dPyy_lJu7m_VysSlVzetUcpTNwIANknNZQdMMUKFmPNdQIx2VYG07VAOjSqPQmiLthOJKgG5HNvLqvLg43N0G_3vGmPrJRIXWgkM_x541LatEIyqR0Y8v0Ec_h_xFmaK85VxIQTP16UhBVGB1AKdM7LfBTBB2Pedd3XSizhw_cCr4GAPqZ4TRfh9h_xRhv4-wP0aYTfKFSZlDCimAsf-3fjhYDSI-vyU4lZxW1T_CqawZ |
| CODEN | IEVSE9 |
| CitedBy_id | crossref_primary_10_1007_s13389_015_0101_6 crossref_primary_10_1016_j_ffa_2014_10_008 crossref_primary_10_1016_j_micpro_2022_104525 crossref_primary_10_1109_TCSI_2024_3435473 crossref_primary_10_1109_TVLSI_2015_2453360 crossref_primary_10_1109_TCSII_2017_2785382 crossref_primary_10_1109_TVLSI_2021_3058509 crossref_primary_10_1109_TVLSI_2012_2198502 crossref_primary_10_1016_j_aeue_2020_153383 crossref_primary_10_1007_s41635_019_00087_5 crossref_primary_10_1109_TVLSI_2024_3486312 crossref_primary_10_1109_ACCESS_2024_3390244 crossref_primary_10_1109_TC_2011_125 crossref_primary_10_1109_ACCESS_2019_2903170 crossref_primary_10_1109_JETCAS_2021_3075456 crossref_primary_10_1109_TVLSI_2023_3321772 crossref_primary_10_1109_TC_2018_2874662 crossref_primary_10_1016_j_micpro_2022_104439 crossref_primary_10_1109_ACCESS_2021_3051282 crossref_primary_10_3390_mi12050560 crossref_primary_10_3103_S0735272715100039 crossref_primary_10_1109_TVLSI_2022_3148207 crossref_primary_10_1016_j_future_2014_11_014 crossref_primary_10_4316_AECE_2013_02001 crossref_primary_10_1109_TCSI_2022_3186810 |
| Cites_doi | 10.1109/TC.2005.49 10.1109/12.508323 10.1109/TC.2004.52 10.1109/VLSI.2008.65 10.1109/ISCAS.2003.1205958 10.1109/TVLSI.2007.912228 10.1109/FPT.2007.4439248 10.1109/TC.2004.47 10.1145/1015047.1015052 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2010 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2010 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/TVLSI.2009.2020088 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Engineering Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1557-9999 |
| EndPage | 1066 |
| ExternalDocumentID | 2717182801 22946954 10_1109_TVLSI_2009_2020088 5208203 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION IQODW RIG 7SP 8FD L7M F28 FR3 |
| ID | FETCH-LOGICAL-c424t-2e86b1a1b82283a66ba3ef12222b4e0dc5177b3b10cfe5ff0e095c2c5af7d1d23 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 35 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000278996600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-8210 |
| IngestDate | Sun Sep 28 06:40:01 EDT 2025 Sun Oct 05 00:24:48 EDT 2025 Mon Jul 21 09:11:39 EDT 2025 Tue Nov 18 22:27:42 EST 2025 Sat Nov 29 03:36:01 EST 2025 Tue Aug 26 17:14:28 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Lower bound Finite field Arithmetic circuit Circuit design Iterative method Field programmable gate array Bit parallel multiplier Algorithm field-programmable gate array (FPGA) Implementation Look up table Karatsuba-Ofman multiplier (KOM) Integrated circuit polynomial basis Custom circuit Multiplying circuits Computer aided design |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c424t-2e86b1a1b82283a66ba3ef12222b4e0dc5177b3b10cfe5ff0e095c2c5af7d1d23 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1027225850 |
| PQPubID | 85424 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_1027225850 ieee_primary_5208203 crossref_citationtrail_10_1109_TVLSI_2009_2020088 pascalfrancis_primary_22946954 crossref_primary_10_1109_TVLSI_2009_2020088 proquest_miscellaneous_1671356535 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-07-01 |
| PublicationDateYYYYMMDD | 2010-07-01 |
| PublicationDate_xml | – month: 07 year: 2010 text: 2010-07-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on very large scale integration (VLSI) systems |
| PublicationTitleAbbrev | TVLSI |
| PublicationYear | 2010 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 (ref14) 2000 ref10 (ref15) 2000 ref2 ref1 ref18 (ref12) 2008 ref8 rodrguez-henrquez (ref19) 2006 ref9 (ref11) 2007 ref4 von zur gathen (ref6) 2005; lncs 3897 zhou (ref17) 2008 rodrguez-henrquez (ref3) 2003 mcgrew (ref16) 2005 ref5 rodrguez-henrquez (ref20) 2005 weimerskirch (ref7) 2006 |
| References_xml | – ident: ref5 doi: 10.1109/TC.2005.49 – year: 2008 ident: ref12 publication-title: Virtex-5 User Guide V3 3 – year: 2005 ident: ref16 publication-title: The Galois/Counter Mode of Operation (GCM) – ident: ref1 doi: 10.1109/12.508323 – year: 2006 ident: ref7 publication-title: Generalizations of the Karatsuba Algorithm for Efficient Implementations – year: 2003 ident: ref3 publication-title: Proceeding (394) Computer Sciences and Technology – ident: ref4 doi: 10.1109/TC.2004.52 – year: 2007 ident: ref11 publication-title: Virtex-4 User Guide V2 3 – ident: ref9 doi: 10.1109/VLSI.2008.65 – year: 2000 ident: ref15 publication-title: SEC 2 Recommended elliptic curve domain parameters – volume: lncs 3897 start-page: 359 year: 2005 ident: ref6 article-title: efficient fpga-based karatsuba multipliers for polynomials over <formula formulatype="inline"><tex notation="tex">$f_2$</tex> </formula> publication-title: Proc Sel Areas Cryptography – year: 2006 ident: ref19 publication-title: Cryptographic Algorithms on Reconfigurable Hardware – start-page: 574 year: 2005 ident: ref20 article-title: A fast implementation of multiplicative inversion over <formula formulatype="inline"><tex Notation="TeX">$GF(2^m)$</tex> </formula> publication-title: Proc Int Conf Inf Technol Coding Comput – ident: ref2 doi: 10.1109/ISCAS.2003.1205958 – start-page: 671 year: 2008 ident: ref17 article-title: area optimization of bit parallel finite field multipliers with fast carry logic on fpgas publication-title: Proc Int Conf Field Program Logic (ICFPL) – ident: ref18 doi: 10.1109/TVLSI.2007.912228 – ident: ref8 doi: 10.1109/FPT.2007.4439248 – ident: ref13 doi: 10.1109/TC.2004.47 – year: 2000 ident: ref14 publication-title: Digital Signature Standard (DSS) – ident: ref10 doi: 10.1145/1015047.1015052 |
| SSID | ssj0014490 |
| Score | 2.1061602 |
| Snippet | This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate arrays (FPGAs)] and efficient... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1057 |
| SubjectTerms | Algorithm design and analysis Application specific integrated circuits Applied sciences Bit parallel multiplier Circuit properties Complexity Computer aided design Design automation Design. Technologies. Operation analysis. Testing Digital circuits Electric, optical and optoelectronic circuits Electronic circuits Electronics Elliptic curve cryptography Exact sciences and technology Field programmable gate arrays field-programmable gate array (FPGA) finite field Galois fields Integrated circuits Iterative methods Karatsuba-Ofman multiplier (KOM) Multipliers NIST Optimization polynomial basis Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices System performance Table lookup Very large scale integration |
| Title | Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs |
| URI | https://ieeexplore.ieee.org/document/5208203 https://www.proquest.com/docview/1027225850 https://www.proquest.com/docview/1671356535 |
| Volume | 18 |
| WOSCitedRecordID | wos000278996600004&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) customDbUrl: eissn: 1557-9999 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014490 issn: 1063-8210 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB61FQc4lEdBpJTKSNwg1PEjiY9b1AVEKStRUG-R40dZaTepNtlK_QP93XiSbEQFQuKUSHYeytj-ZuKZ7wN4bU0IfLjlsaLCx8ImeYx6ODEP0KECvsis55k9zc7O8osLNduCt2MtjHOuSz5z7_C028u3tVnjr7IjyRCw-DZsZ1na12qNOwZCqJ55IOVxHuKYTYEMVUfnP06_feqpKUOoH0AvvwNCnaoK5kTqJnwW3-tZ_LE0d3gzffh_b_oIdge_kkz6gfAYtlz1BB78xja4B7c495H_sr0hGy4SoitLTjoaiXBD0nEFL4dypKohtSfH85bM9AolVxZkOkcXNRzcwpIvfS4iammT4wCGltQV-YxU4s261PFXv9QVmSwu69W8_bnExunsw6R5Ct-nJ-fvP8aDDENsBBNtzFyelolOyhypcnSalpo7nwTHgpXCUWtkkmUlLxNqvJPeUxfcNsOM1D6ziWX8GexUdeWeA7GO-uDiaZ_kRlCba6Mx2c3JkmpuFIsg2dilMANHOUplLIouVqGq6GyJ2pmqGGwZwZvxmqueoeOfvffQWmPPwVARHN4x_9jOmBKpkiKCg814KIZZ3oTHsCysh7mkEbwam8P8xE0XXbl6HfqkKIKYSi73__7oF3C_z0jAFOAD2GlXa_cS7pnrdt6sDrtB_gtgSPoF |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3bbtQwEB2VgkR54FZQA6UYiTdI6zh2Ej9uUZdW3S4rsaC-RY4vsNJugjZZJH6A78aTZCMqEBJPiWTnooztMxPPnAPw2mgf-MQmDiXlLuQmykLUwwljDx3S44tIO57ZSTqdZtfXcrYDb4daGGttm3xmj_G03cs3ld7gr7ITwRCw4ltwW3DOaFetNewZcC477oEkDjMfyWxLZKg8mX-efLzoyCl9sO9hL7sBQ62uCmZFqtp_GNcpWvyxOLeIM37wf-_6EO73niUZdUPhEezY8jHc-41vcB9-4uxHBszmB9mykRBVGnLWEkn4G5KWLXjVFySVNakcOV00ZKbWKLqyJOMFOqn-YJeGXHXZiKimTU49HBpSleQSycTrTaHCD26lSjJafqnWi-brChvHs_ej-gl8Gp_N352HvRBDqDnjTchslhSRiooMyXJUkhQqti7yrgUruKVGiyhNi7iIqHZWOEetd9w000K51ESGxU9ht6xKewDEWOq8k6dclGlOTaa0wnQ3KwqqYi1ZANHWLrnuWcpRLGOZt9EKlXlrS1TPlHlvywDeDNd86zg6_tl7H6019OwNFcDRDfMP7YxJnkjBAzjcjoe8n-e1fwxL_YqYCRrAq6HZz1DcdlGlrTa-T4IyiImIxbO_P_ol3D2fX03yycX08jnsdfkJmBB8CLvNemNfwB39vVnU66N2wP8Cfhj9TA |
| 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=Complexity+Analysis+and+Efficient+Implementations+of+Bit+Parallel+Finite+Field+Multipliers+Based+on+Karatsuba-Ofman+Algorithm+on+FPGAs&rft.jtitle=IEEE+transactions+on+very+large+scale+integration+%28VLSI%29+systems&rft.au=Zhou%2C+Gang&rft.au=Michalik%2C+Harald&rft.au=Hinsenkamp%2C+Laszlo&rft.date=2010-07-01&rft.issn=1063-8210&rft.eissn=1557-9999&rft.volume=18&rft.issue=7&rft.spage=1057&rft.epage=1066&rft_id=info:doi/10.1109%2FTVLSI.2009.2020088&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-8210&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-8210&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-8210&client=summon |