{"id":"https://openalex.org/W2143766146","doi":"https://doi.org/10.1109/ecctd.2011.6043614","title":"A dynamically error correctable bit parallel Montgomery multiplier over binary extension fields","display_name":"A dynamically error correctable bit parallel Montgomery multiplier over binary extension fields","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2143766146","doi":"https://doi.org/10.1109/ecctd.2011.6043614","mag":"2143766146"},"language":"en","primary_location":{"id":"doi:10.1109/ecctd.2011.6043614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecctd.2011.6043614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 20th European Conference on Circuit Theory and Design (ECCTD)","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/A5022896061","display_name":"Mahesh Poolakkaparambil","orcid":null},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. Poolakkaparambil","raw_affiliation_strings":["Department of Computer Science & Electronics, Oxford Brookes University, UK","Dept. of Comp. Sci & Electronics, Oxford Brookes University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]},{"raw_affiliation_string":"Dept. of Comp. Sci & Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081683515","display_name":"Jimson Mathew","orcid":"https://orcid.org/0000-0001-8247-9040"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. Mathew","raw_affiliation_strings":["Department of Computer Science, University of Bristol, UK","Department of Computer Science,  University of Bristol , UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science,  University of Bristol , UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076588539","display_name":"Abusaleh Jabir","orcid":null},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. M. Jabir","raw_affiliation_strings":["Department of Computer Science & Electronics, Oxford Brookes University, UK","Dept. of Comp. Sci & Electronics, Oxford Brookes University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]},{"raw_affiliation_string":"Dept. of Comp. Sci & Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113458314","display_name":"Dhiraj K. Pradhan","orcid":null},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. K. Pradhan","raw_affiliation_strings":["Department of Computer Science, University of Bristol, UK","Department of Computer Science,  University of Bristol , UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science,  University of Bristol , UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2369,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53329309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"51","issue":null,"first_page":"600","last_page":"603"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9995999932289124,"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.9995999932289124,"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.9955999851226807,"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.9936000108718872,"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.7124409079551697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6578104496002197},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.6280626058578491},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.6143795251846313},{"id":"https://openalex.org/keywords/galois-theory","display_name":"Galois theory","score":0.5745847821235657},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5452485680580139},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5222509503364563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33131134510040283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29697713255882263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11709752678871155}],"concepts":[{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.7124409079551697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578104496002197},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.6280626058578491},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.6143795251846313},{"id":"https://openalex.org/C94398972","wikidata":"https://www.wikidata.org/wiki/Q92552","display_name":"Galois theory","level":2,"score":0.5745847821235657},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5452485680580139},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5222509503364563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33131134510040283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29697713255882263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11709752678871155},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ecctd.2011.6043614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecctd.2011.6043614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 20th European Conference on Circuit Theory and Design (ECCTD)","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":17,"referenced_works":["https://openalex.org/W250146004","https://openalex.org/W1980783154","https://openalex.org/W1995503477","https://openalex.org/W2003466416","https://openalex.org/W2050511120","https://openalex.org/W2080481349","https://openalex.org/W2103774873","https://openalex.org/W2136484227","https://openalex.org/W2139505930","https://openalex.org/W2144350887","https://openalex.org/W2146770903","https://openalex.org/W2149204794","https://openalex.org/W2149254586","https://openalex.org/W2151988775","https://openalex.org/W2153384046","https://openalex.org/W3146510765","https://openalex.org/W6649550151"],"related_works":["https://openalex.org/W2147240338","https://openalex.org/W2610939850","https://openalex.org/W2116164321","https://openalex.org/W4249530125","https://openalex.org/W1964850555","https://openalex.org/W1944601446","https://openalex.org/W2502533382","https://openalex.org/W87529998","https://openalex.org/W4281295723","https://openalex.org/W2138457422"],"abstract_inverted_index":{"Galois":[0,54],"field":[1,55],"arithmetic":[2,63],"circuits":[3],"find":[4],"wide":[5],"variety":[6],"of":[7,15,38],"application":[8],"in":[9,68,80],"cryptography.":[10],"Thus":[11],"they":[12],"faces":[13],"majority":[14],"the":[16,60,69,126,146,159,174,178],"hardware":[17],"based":[18,129],"attacks":[19],"for":[20,42,144],"malicious":[21,35,152],"gain.":[22],"Though":[23],"there":[24],"are":[25,40,57,66,76],"many":[26,61],"approaches":[27],"that":[28,53,65],"have":[29],"been":[30,98],"proposed":[31],"to":[32,46,100],"mitigate":[33],"such":[34],"attacks,":[36],"most":[37],"them":[39,73],"inappropriate":[41],"practical":[43],"applicability":[44],"due":[45],"various":[47],"design":[48,136],"drawbacks.":[49],"It":[50],"is":[51,154],"noted":[52],"multipliers":[56,75,116],"one":[58],"among":[59],"core":[62],"modules":[64],"inevitable":[67],"cryptography":[70],"processors.":[71],"Among":[72],"Montgomery":[74,93,115,134],"studied":[77],"and":[78,121,176],"implemented":[79,99],"applications":[81],"like":[82],"Elliptical":[83],"Curve":[84],"Cryptography":[85],"arithmetic.":[86],"However,":[87],"a":[88,108,141],"multiple":[89,110,130,161],"bit":[90,111,131,162,165],"error":[91,112,119,132,163],"correctable":[92,113,133,164],"multiplier":[94,135,167],"has":[95],"not":[96],"yet":[97],"this":[101,104],"end.":[102],"In":[103,156],"paper,":[105],"we":[106,124,139],"propose":[107,140],"novel":[109,142,170],"bit-parallel":[114],"with":[117,158],"dynamic":[118],"detection":[120],"correction.":[122],"First":[123],"present":[125],"BCH":[127],"code":[128],"architecture.":[137],"Then":[138],"scheme":[143],"reducing":[145],"recurrent":[147],"delay":[148,175],"when":[149],"no":[150],"transient":[151],"attack":[153],"present.":[155],"comparison":[157],"existing":[160],"parallel":[166],"structures,":[168],"our":[169],"technique":[171],"significantly":[172],"reduces":[173],"improves":[177],"performance.":[179]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}