{"id":"https://openalex.org/W3133130051","doi":"https://doi.org/10.1145/3431920.3439306","title":"Efficient FPGA Modular Multiplication Implementation","display_name":"Efficient FPGA Modular Multiplication Implementation","publication_year":2021,"publication_date":"2021-02-17","ids":{"openalex":"https://openalex.org/W3133130051","doi":"https://doi.org/10.1145/3431920.3439306","mag":"3133130051"},"language":"en","primary_location":{"id":"doi:10.1145/3431920.3439306","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3431920.3439306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","raw_type":"proceedings-article"},"type":"article","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/A5082265695","display_name":"Martin Langhammer","orcid":"https://orcid.org/0000-0001-8206-2077"},"institutions":[{"id":"https://openalex.org/I4210158342","display_name":"Intel (United Kingdom)","ror":"https://ror.org/058cxws58","country_code":"GB","type":"company","lineage":["https://openalex.org/I1343180700","https://openalex.org/I4210158342"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Langhammer","raw_affiliation_strings":["Intel Corporation, Salisbury, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Corporation, Salisbury, United Kingdom","institution_ids":["https://openalex.org/I4210158342"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010739346","display_name":"Bogdan Pasca","orcid":"https://orcid.org/0000-0002-5454-4375"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bogdan Pasca","raw_affiliation_strings":["Intel Corporation, Toulouse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Corporation, Toulouse, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.414,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93041975,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"223"},"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.9977999925613403,"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.9855999946594238,"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/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.713021993637085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6878988742828369},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.607374370098114},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5920323729515076},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.5768210887908936},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5455141067504883},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.4857478737831116},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.47463592886924744},{"id":"https://openalex.org/keywords/modular-arithmetic","display_name":"Modular arithmetic","score":0.4584805965423584},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.4553452432155609},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4442240595817566},{"id":"https://openalex.org/keywords/least-significant-bit","display_name":"Least significant bit","score":0.4203929901123047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35508275032043457},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.29988473653793335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24343863129615784},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.19725018739700317},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.1070702075958252}],"concepts":[{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.713021993637085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878988742828369},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.607374370098114},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5920323729515076},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.5768210887908936},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5455141067504883},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.4857478737831116},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.47463592886924744},{"id":"https://openalex.org/C32049820","wikidata":"https://www.wikidata.org/wiki/Q319400","display_name":"Modular arithmetic","level":3,"score":0.4584805965423584},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.4553452432155609},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4442240595817566},{"id":"https://openalex.org/C4305246","wikidata":"https://www.wikidata.org/wiki/Q3885225","display_name":"Least significant bit","level":2,"score":0.4203929901123047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35508275032043457},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.29988473653793335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24343863129615784},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.19725018739700317},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.1070702075958252},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3431920.3439306","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3431920.3439306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W95608104","https://openalex.org/W1498685334","https://openalex.org/W2004814164","https://openalex.org/W2053508170","https://openalex.org/W2056410596","https://openalex.org/W2073789311","https://openalex.org/W2111568453","https://openalex.org/W2127224486","https://openalex.org/W2130423410","https://openalex.org/W2141869599","https://openalex.org/W2243070902","https://openalex.org/W2285164917","https://openalex.org/W2537973570","https://openalex.org/W2798534715","https://openalex.org/W2798940842","https://openalex.org/W2810426084","https://openalex.org/W2916266490","https://openalex.org/W2951989312","https://openalex.org/W2966077459","https://openalex.org/W2977883180","https://openalex.org/W4236302272","https://openalex.org/W4286779318"],"related_works":["https://openalex.org/W2113213955","https://openalex.org/W2016520453","https://openalex.org/W2148643256","https://openalex.org/W2405527256","https://openalex.org/W2516936488","https://openalex.org/W1994292126","https://openalex.org/W2146721459","https://openalex.org/W2041904473","https://openalex.org/W2024456689","https://openalex.org/W2384922783"],"abstract_inverted_index":{"Barrett's":[0,25,96,139],"algorithm":[1,26],"is":[2,14,100,164],"the":[3,15,155,178,184],"most":[4],"commonly":[5],"known":[6],"method":[7,149],"of":[8,17,44,46,61,69,84,119,186],"performing":[9],"a":[10,106],"modular":[11,143],"multiplication,":[12,144],"which":[13,32,122,150],"core":[16],"many":[18,56],"modern":[19],"encryption":[20],"algorithms":[21],"such":[22],"as":[23,82],"RSA.":[24],"requires":[27,35],"an":[28,136],"accurate":[29,36],"quotient":[30,80],"estimation":[31],"in":[33,53,154,177],"turn":[34],"multiplications.":[37],"These":[38],"multiplications":[39],"operating":[40],"on":[41,111],"word":[42,170],"sizes":[43],"thousands":[45,60],"bits":[47],"are":[48],"particularly":[49],"expensive":[50],"to":[51,102,134],"implement":[52],"FPGAs,":[54],"requiring":[55],"hundreds":[57],"or":[58],"even":[59],"embedded":[62],"DSP":[63],"components":[64],"along":[65],"with":[66],"large":[67,169],"amounts":[68],"logic":[70,152],"and":[71,114],"routing.":[72],"In":[73],"this":[74],"work":[75],"we":[76],"show":[77],"that":[78],"approximate":[79,148],"estimates":[81],"results":[83],"aggressive":[85],"multiplier":[86,158],"truncations":[87],"can":[88,182],"significantly":[89],"reduce":[90,183],"implementation":[91,140],"cost.":[92],"The":[93,162],"looser":[94],"modified":[95],"output":[97],"[0;":[98,103],"YM)":[99],"reduced":[101],"M)":[104],"using":[105],"shallow":[107],"reduction":[108],"technique":[109],"based":[110],"table":[112],"lookups":[113],"wide":[115],"additions,":[116],"taking":[117],"advantage":[118],"new":[120],"techniques":[121,133],"have":[123],"recently":[124],"been":[125],"introduced":[126],"for":[127,141,167],"FPGA.":[128],"We":[129],"first":[130],"use":[131],"these":[132],"develop":[135],"improved":[137],"standard":[138],"1024b":[142],"followed":[145],"by":[146,159,188],"our":[147,173],"reduces":[151],"cost":[153],"LSB":[156,179],"truncated":[157,180],"approximately":[160],"10%.":[161],"effect":[163],"more":[165],"pronounced":[166],"very":[168],"sizes,":[171],"where":[172],"relaxed":[174],"error":[175],"bounds":[176],"multiplication":[181],"number":[185],"operations":[187],"20%.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}