{"id":"https://openalex.org/W2149916978","doi":"https://doi.org/10.1109/arith.2003.1207678","title":"Low complexity sequential normal basis multipliers over GF(2/sup m/)","display_name":"Low complexity sequential normal basis multipliers over GF(2/sup m/)","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2149916978","doi":"https://doi.org/10.1109/arith.2003.1207678","mag":"2149916978"},"language":"en","primary_location":{"id":"doi:10.1109/arith.2003.1207678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.2003.1207678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073730333","display_name":"Arash Reyhani-Masoleh","orcid":"https://orcid.org/0000-0001-9743-6975"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A. Reyhani-Masoleh","raw_affiliation_strings":["Centre for Applied Cryptographic Research Combinatorics and Optimizaiton Department, University of Waterloo, Waterloo, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Applied Cryptographic Research Combinatorics and Optimizaiton Department, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024426963","display_name":"M.A. Hasan","orcid":"https://orcid.org/0000-0003-4103-7945"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M.A. Hasan","raw_affiliation_strings":["Electrical and Computer Engineering Department/Centre for Applied Cryptographic Resarch, University of Waterloo, Waterloo, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department/Centre for Applied Cryptographic Resarch, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.7350053787231445},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.702107310295105},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5732710957527161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5289352536201477},{"id":"https://openalex.org/keywords/gf","display_name":"GF(2)","score":0.5139977335929871},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.4458787143230438},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.41443613171577454},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38561344146728516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3713436722755432}],"concepts":[{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.7350053787231445},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.702107310295105},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5732710957527161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5289352536201477},{"id":"https://openalex.org/C156350748","wikidata":"https://www.wikidata.org/wiki/Q5513324","display_name":"GF(2)","level":3,"score":0.5139977335929871},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.4458787143230438},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.41443613171577454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38561344146728516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3713436722755432},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/arith.2003.1207678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.2003.1207678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1569612250","https://openalex.org/W1655480633","https://openalex.org/W1889596231","https://openalex.org/W1894395730","https://openalex.org/W2024113859","https://openalex.org/W2049990610","https://openalex.org/W2054020579","https://openalex.org/W2091899615","https://openalex.org/W2096920618","https://openalex.org/W2101597358","https://openalex.org/W2114353618","https://openalex.org/W2130623996","https://openalex.org/W2164336166","https://openalex.org/W2243116898","https://openalex.org/W4240440526"],"related_works":["https://openalex.org/W2395601077","https://openalex.org/W2142116768","https://openalex.org/W2361826146","https://openalex.org/W2587136861","https://openalex.org/W2053479561","https://openalex.org/W2903589906","https://openalex.org/W2082919005","https://openalex.org/W1559182355","https://openalex.org/W2995144174","https://openalex.org/W2117944786"],"abstract_inverted_index":{"For":[0],"efficient":[1,72,87,164],"hardware":[2],"implementation":[3],"of":[4,11,30,34,42,62,77,105,112,126],"finite":[5,23],"field":[6,24,46],"arithmetic":[7],"units,":[8],"the":[9,22,40,43,60,63,84,91,96,103,120,127,138,156],"use":[10],"a":[12,146,162],"normal":[13],"basis":[14],"is":[15,107,111,129,143],"advantageous.":[16],"Two":[17],"architectures":[18],"for":[19,100,124],"multipliers":[20,32,68,98,128],"over":[21,140],"GF(2/sup":[25,141,149],"m/)":[26,142],"are":[27,33,69],"proposed.":[28],"Both":[29],"these":[31],"sequential":[35],"type":[36],"-":[37],"after":[38],"receiving":[39],"coordinates":[41,61],"two":[44],"input":[45],"elements,":[47],"they":[48],"go":[49],"through":[50],"m":[51,106],"iterations":[52],"(or":[53],"clock":[54],"cycles)":[55],"to":[56],"finally":[57],"yield":[58,161],"all":[59],"product":[64],"in":[65,90],"parallel.":[66],"These":[67],"highly":[70,163],"area":[71,86],"and":[73,153],"require":[74],"fewer":[75],"number":[76],"logic":[78],"gates":[79],"even":[80],"when":[81],"compared":[82],"with":[83],"most":[85],"multiplier":[88,158],"available":[89],"open":[92],"literature.":[93],"This":[94,134],"makes":[95],"proposed":[97],"suitable":[99,147],"applications":[101],"where":[102,151],"value":[104],"large":[108],"but":[109],"space":[110],"concern,":[113],"e.g.,":[114],"resource":[115],"constrained":[116],"cryptographic":[117],"systems.":[118],"Additionally,":[119],"AND":[121],"gate":[122],"count":[123],"one":[125],"/spl":[130],"lfloor/m/2/spl":[131],"rfloor/+1":[132],"only.":[133],"implies":[135],"that":[136],"if":[137],"multiplication":[139],"performed":[144],"using":[145],"subfield":[148],"n/),":[150],"n>1":[152],"n|m,":[154],"then":[155],"corresponding":[157],"architecture":[159],"will":[160],"digit":[165],"or":[166],"word":[167],"serial":[168],"multiplier.":[169]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}