{"id":"https://openalex.org/W4312976276","doi":"https://doi.org/10.1109/iscas48785.2022.9937536","title":"Efficient VLSI Architecture of Bluestein\u2019s FFT for Fully Homomorphic Encryption","display_name":"Efficient VLSI Architecture of Bluestein\u2019s FFT for Fully Homomorphic Encryption","publication_year":2022,"publication_date":"2022-05-28","ids":{"openalex":"https://openalex.org/W4312976276","doi":"https://doi.org/10.1109/iscas48785.2022.9937536"},"language":"en","primary_location":{"id":"doi:10.1109/iscas48785.2022.9937536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937536","pdf_url":null,"source":{"id":"https://openalex.org/S4363604393","display_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5101058399","display_name":"Shiyong Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Shi-Yong Wu","raw_affiliation_strings":["National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701"],"affiliations":[{"raw_affiliation_string":"National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100714455","display_name":"Kuan\u2010Yu Chen","orcid":"https://orcid.org/0000-0002-4020-9103"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kuan-Yu Chen","raw_affiliation_strings":["National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701"],"affiliations":[{"raw_affiliation_string":"National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053167526","display_name":"Ming\u2010Der Shieh","orcid":"https://orcid.org/0000-0002-7361-1860"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Der Shieh","raw_affiliation_strings":["National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701"],"affiliations":[{"raw_affiliation_string":"National Cheng Kung University No.1, University Road,Department of Electrical Engineering,Tainan City,Taiwan, R.O.C,701","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101058399"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":0.4162,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59683241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"56","issue":null,"first_page":"2242","last_page":"2245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7820206880569458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7081177830696106},{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.6751645803451538},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.6154964566230774},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.5551396608352661},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.5069460868835449},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5052834153175354},{"id":"https://openalex.org/keywords/digital-subscriber-line","display_name":"Digital subscriber line","score":0.48228147625923157},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.44246500730514526},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42017924785614014},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4194048047065735},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.4140513241291046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3823132812976837},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3600987195968628},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.33370232582092285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21532094478607178},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.18531861901283264},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.16548049449920654}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7820206880569458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7081177830696106},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.6751645803451538},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.6154964566230774},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.5551396608352661},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.5069460868835449},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5052834153175354},{"id":"https://openalex.org/C201374245","wikidata":"https://www.wikidata.org/wiki/Q104534","display_name":"Digital subscriber line","level":2,"score":0.48228147625923157},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.44246500730514526},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42017924785614014},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4194048047065735},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.4140513241291046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3823132812976837},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3600987195968628},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.33370232582092285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21532094478607178},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.18531861901283264},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.16548049449920654},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas48785.2022.9937536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937536","pdf_url":null,"source":{"id":"https://openalex.org/S4363604393","display_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","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":12,"referenced_works":["https://openalex.org/W1966904279","https://openalex.org/W1976676268","https://openalex.org/W1984290906","https://openalex.org/W2031533839","https://openalex.org/W2134572726","https://openalex.org/W2152926062","https://openalex.org/W2415881634","https://openalex.org/W2764683856","https://openalex.org/W2802574299","https://openalex.org/W3090696985","https://openalex.org/W4212899991","https://openalex.org/W6656097609"],"related_works":["https://openalex.org/W1555715953","https://openalex.org/W2031343199","https://openalex.org/W2144412928","https://openalex.org/W2200032781","https://openalex.org/W4362564158","https://openalex.org/W2009267427","https://openalex.org/W2001662350","https://openalex.org/W4210901891","https://openalex.org/W4312976276","https://openalex.org/W2114766445"],"abstract_inverted_index":{"Fully":[0],"homomorphic":[1],"encryption":[2],"(FHE)":[3],"is":[4,60,98],"a":[5,120,151],"powerful":[6],"scheme":[7],"that":[8,124,142],"allows":[9],"computations":[10],"to":[11,75,100,107,128,150,157],"be":[12,45,72,126],"performed":[13],"on":[14],"encrypted":[15],"data.":[16],"To":[17],"reduce":[18,76,108],"the":[19,28,33,42,54,58,66,77,102,109,143,158],"computational":[20],"complexity,":[21],"double-CRT":[22],"representation":[23],"has":[24],"been":[25],"adopted":[26],"in":[27,31,161],"BGV-FHE":[29,89],"cryptosystem,":[30],"which":[32],"2":[34],"<sup":[35],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[36],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">nd</sup>":[37],"-CRT,":[38],"also":[39,140],"known":[40],"as":[41,47,155],"polynomial-CRT,":[43],"can":[44,125,148],"viewed":[46],"performing":[48],"Discrete":[49],"Fourier":[50],"Transform":[51],"(DFT).":[52],"Since":[53],"point":[55,131],"size":[56],"of":[57,64,85,133],"DFT":[59,134],"usually":[61],"non":[62],"power":[63],"two,":[65],"traditional":[67],"Cooley-Tukey":[68],"FFT":[69,87,122,146],"algorithm":[70,97],"cannot":[71],"directly":[73],"applied":[74],"complexity.":[78],"This":[79],"paper":[80],"explores":[81],"efficient":[82],"VLSI":[83],"architecture":[84],"Bluestein\u2019s":[86,121,145],"for":[88,136],"applications.":[90],"A":[91],"mixed-radix":[92,159],"single-port":[93],"merged-bank":[94],"memory":[95,104,111],"addressing":[96],"presented":[99],"increase":[101],"effective":[103],"bandwidth":[105],"and":[106],"required":[110],"area":[112],"concurrently.":[113],"The":[114],"evaluation":[115],"was":[116],"conducted":[117],"by":[118],"implementing":[119],"compiler":[123],"configured":[127],"generate":[129],"different":[130],"sizes":[132],"designs":[135],"BGV-FHE.":[137],"Analytical":[138],"results":[139],"show":[141],"proposed":[144],"design":[147],"lead":[149],"more":[152],"area-efficient":[153],"solution":[154],"compared":[156],"counterpart":[160],"general":[162],"cases.":[163]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}