{"id":"https://openalex.org/W2517143652","doi":"https://doi.org/10.1109/tc.2016.2601334","title":"Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication","display_name":"Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication","publication_year":2016,"publication_date":"2016-08-19","ids":{"openalex":"https://openalex.org/W2517143652","doi":"https://doi.org/10.1109/tc.2016.2601334","mag":"2517143652"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2016.2601334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2016.2601334","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5075504049","display_name":"Wangchen Dai","orcid":"https://orcid.org/0000-0002-5192-1649"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Wangchen Dai","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090895154","display_name":"Donald Donglong Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Donald Donglong Chen","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077847474","display_name":"Ray C. C. Cheung","orcid":"https://orcid.org/0000-0002-6764-0729"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ray C. C. Cheung","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018100877","display_name":"\u00c7etin Kaya Ko\u00e7","orcid":"https://orcid.org/0000-0002-2572-9565"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cetin Kaya Koc","raw_affiliation_strings":["Department of Computer Science, Universty of California Santa Barbara, Santa Barbara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universty of California Santa Barbara, Santa Barbara, CA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0598,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94484994,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"3","first_page":"375","last_page":"388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":1.0,"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":1.0,"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.9984999895095825,"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.9915000200271606,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8179590702056885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6912643909454346},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6713706254959106},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5770462155342102},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.4567576050758362},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.44324031472206116},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.4381800889968872},{"id":"https://openalex.org/keywords/modular-arithmetic","display_name":"Modular arithmetic","score":0.4296775460243225},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.4118596017360687},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.40411239862442017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3928430676460266},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3674757480621338},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.340229332447052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2517486810684204},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.13517019152641296}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8179590702056885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6912643909454346},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6713706254959106},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5770462155342102},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.4567576050758362},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.44324031472206116},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.4381800889968872},{"id":"https://openalex.org/C32049820","wikidata":"https://www.wikidata.org/wiki/Q319400","display_name":"Modular arithmetic","level":3,"score":0.4296775460243225},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.4118596017360687},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.40411239862442017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3928430676460266},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3674757480621338},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.340229332447052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2517486810684204},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.13517019152641296},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2016.2601334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2016.2601334","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1601793793","https://openalex.org/W1616393225","https://openalex.org/W1649758727","https://openalex.org/W1988025868","https://openalex.org/W1996360405","https://openalex.org/W2001121794","https://openalex.org/W2004814164","https://openalex.org/W2006803873","https://openalex.org/W2045498265","https://openalex.org/W2045826589","https://openalex.org/W2049347491","https://openalex.org/W2069448237","https://openalex.org/W2072955070","https://openalex.org/W2081660162","https://openalex.org/W2083368929","https://openalex.org/W2087957223","https://openalex.org/W2131524998","https://openalex.org/W2138917317","https://openalex.org/W2140850958","https://openalex.org/W2144450128","https://openalex.org/W2151409227","https://openalex.org/W2151473825","https://openalex.org/W2158359807","https://openalex.org/W2168839239","https://openalex.org/W2187385979","https://openalex.org/W2243070902","https://openalex.org/W2949848962","https://openalex.org/W4212899991","https://openalex.org/W4232836212","https://openalex.org/W4237773356","https://openalex.org/W4241295125","https://openalex.org/W4243320431","https://openalex.org/W4299616802","https://openalex.org/W4300479121","https://openalex.org/W6636420136","https://openalex.org/W6636949950","https://openalex.org/W6637868124"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W4362564158","https://openalex.org/W2977460836","https://openalex.org/W2356814585","https://openalex.org/W2144412928","https://openalex.org/W4246835537","https://openalex.org/W2113951268","https://openalex.org/W2012363129","https://openalex.org/W1984254719","https://openalex.org/W2389024310"],"abstract_inverted_index":{"The":[0,187],"modular":[1,35,97,119],"multiplication":[2,36,98,120],"operation":[3,8,115],"is":[4,31,146,241],"the":[5,29,34,39,53,57,81,88,107,113,118,131,139,143,164,200,238],"most":[6],"time-consuming":[7],"for":[9,41,159,163,221,225,229,234,248],"number-theoretic":[10,140],"cryptographic":[11],"algorithms":[12],"involving":[13],"large":[14,67],"integers,":[15],"such":[16,64],"as":[17],"RSA":[18,40],"and":[19,55,61,72,91,125,170,206,231,251],"Diffie-Hellman.":[20],"Implementations":[21],"reveal":[22],"that":[23,190],"more":[24,42],"than":[25,43],"75":[26],"percent":[27,220,224,228,233],"of":[28,70],"time":[30],"spent":[32],"in":[33,68,74],"function":[37],"within":[38],"1,024-bit":[44,208],"moduli.":[45],"There":[46],"are":[47,66,174],"fast":[48,82,150],"multiplier":[49],"architectures":[50,204],"to":[51,106,148,199,218],"minimize":[52],"delay":[54],"increase":[56],"throughput":[58],"using":[59,123],"parallelism":[60],"pipelining.":[62],"However":[63],"designs":[65],"terms":[69],"area":[71],"low":[73,177],"efficiency.":[75,104],"In":[76],"this":[77],"paper,":[78],"we":[79,111,129,181],"integrate":[80],"Fourier":[83],"transform":[84,250],"(FFT)":[85],"method":[86,158],"into":[87],"McLaughlin's":[89],"framework,":[90],"present":[92],"an":[93],"improved":[94],"FFT-based":[95,109,202],"Montgomery":[96],"(MMM)":[99],"algorithm":[100,145],"achieving":[101],"high":[102,245],"area-time":[103],"Compared":[105],"previous":[108],"designs,":[110],"inhibit":[112],"zero-padding":[114],"by":[116,134,138],"computing":[117],"steps":[121],"directly":[122],"cyclic":[124],"nega-cyclic":[126],"convolutions.":[127],"Thus,":[128],"reduce":[130],"convolution":[132,151],"length":[133],"half.":[135],"Furthermore,":[136,237],"supported":[137],"weighted":[141],"transform,":[142],"FFT":[144],"used":[147],"provide":[149],"computation.":[152],"We":[153,211],"also":[154,242],"introduce":[155],"a":[156,194],"general":[157],"efficient":[160],"parameter":[161],"selection":[162],"proposed":[165],"algorithm.":[166],"Architectures":[167],"with":[168,244],"single":[169],"double":[171],"butterfly":[172],"structures":[173],"designed":[175],"obtaining":[176],"area-latency":[178,196,214],"solutions,":[179],"which":[180],"implemented":[182],"on":[183],"Xilinx":[184],"Virtex-6":[185],"FPGAs.":[186],"results":[188],"show":[189],"our":[191],"work":[192],"offers":[193],"better":[195],"efficiency":[197,215],"compared":[198],"state-of-the-art":[201],"MMM":[203],"from":[205],"above":[207],"operand":[209],"sizes.":[210],"have":[212],"obtained":[213],"improvements":[216],"up":[217],"50.9":[219],"1,024-bit,":[222],"41.9":[223],"2,048-bit,":[226],"37.8":[227],"4,096-bit":[230],"103.2":[232],"7,680-bit":[235],"operands.":[236],"operating":[239],"latency":[240],"outperformed":[243],"clock":[246],"frequency":[247],"length-64":[249],"above.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}