{"id":"https://openalex.org/W1500818390","doi":"https://doi.org/10.1109/fpt.2004.1393281","title":"Reconfigurable implementation of bit-parallel multipliers over GF(2/sup m/) for two classes of finite fields","display_name":"Reconfigurable implementation of bit-parallel multipliers over GF(2/sup m/) for two classes of finite fields","publication_year":2005,"publication_date":"2005-03-21","ids":{"openalex":"https://openalex.org/W1500818390","doi":"https://doi.org/10.1109/fpt.2004.1393281","mag":"1500818390"},"language":"en","primary_location":{"id":"doi:10.1109/fpt.2004.1393281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2004.1393281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921)","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/A5041677215","display_name":"Jos\u00e9 Luis Ima\u00f1a","orcid":"https://orcid.org/0000-0002-4220-4111"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"J.L. Imana","raw_affiliation_strings":["Departmento Arquitectura de Computudores y Autom\u00e1tica Facultad Ciencias Fisicus, Universided Complutense, Madrid, Spain","Dpto. Arquitectura de Computadores y Automatica, Univ. Complutense, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Departmento Arquitectura de Computudores y Autom\u00e1tica Facultad Ciencias Fisicus, Universided Complutense, Madrid, Spain","institution_ids":["https://openalex.org/I121748325"]},{"raw_affiliation_string":"Dpto. Arquitectura de Computadores y Automatica, Univ. Complutense, Madrid, Spain","institution_ids":["https://openalex.org/I121748325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041677215"],"corresponding_institution_ids":["https://openalex.org/I121748325"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.06526978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"290"},"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.9987000226974487,"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.9811999797821045,"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/finite-field","display_name":"Finite field","score":0.7882855534553528},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.7317559123039246},{"id":"https://openalex.org/keywords/gf","display_name":"GF(2)","score":0.6935734748840332},{"id":"https://openalex.org/keywords/galois-theory","display_name":"Galois theory","score":0.6486485004425049},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.6025707721710205},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.5855724215507507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5526618361473083},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5402637720108032},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4869321584701538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3538362979888916},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35190874338150024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2614259421825409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23773613572120667},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.12151989340782166}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.7882855534553528},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.7317559123039246},{"id":"https://openalex.org/C156350748","wikidata":"https://www.wikidata.org/wiki/Q5513324","display_name":"GF(2)","level":3,"score":0.6935734748840332},{"id":"https://openalex.org/C94398972","wikidata":"https://www.wikidata.org/wiki/Q92552","display_name":"Galois theory","level":2,"score":0.6486485004425049},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.6025707721710205},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.5855724215507507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5526618361473083},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5402637720108032},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4869321584701538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3538362979888916},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35190874338150024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2614259421825409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23773613572120667},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.12151989340782166},{"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},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpt.2004.1393281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2004.1393281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921)","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":3,"referenced_works":["https://openalex.org/W2038884834","https://openalex.org/W2122152825","https://openalex.org/W2138169871"],"related_works":["https://openalex.org/W2395601077","https://openalex.org/W2587136861","https://openalex.org/W2361826146","https://openalex.org/W2142116768","https://openalex.org/W2082919005","https://openalex.org/W1528972180","https://openalex.org/W2039812289","https://openalex.org/W1537813558","https://openalex.org/W172172592","https://openalex.org/W3128023985"],"abstract_inverted_index":{"Galois":[0],"fields":[1,59],"GF(2/sup":[2,34,52],"m/)":[3,35,53],"are":[4,41,78],"used":[5],"in":[6],"a":[7],"wide":[8],"number":[9],"of":[10,30,48,57,66,116],"applications":[11],"such":[12],"as":[13],"cryptography,":[14],"digital":[15],"signal":[16],"processing":[17],"and":[18,28,80],"error-control":[19],"codes.":[20],"The":[21,97,106],"multiplication":[22],"is":[23,60],"considered":[24],"the":[25,31,73,81,90,113,117],"most":[26,32],"important":[27],"one":[29],"complex":[33],"operations,":[36],"so":[37],"efficient":[38],"multiplier":[39],"architectures":[40],"highly":[42],"desired.":[43],"A":[44],"new":[45],"construction":[46],"method":[47,111],"bit-parallel":[49],"multipliers":[50,88,98,118],"over":[51],"for":[54],"two":[55],"classes":[56],"finite":[58],"presented.":[61],"Our":[62],"approach":[63],"determines":[64],"groups":[65],"subexpressions":[67],"that":[68,86,109],"can":[69],"be":[70],"shared":[71],"among":[72],"product":[74],"coordinates.":[75],"General":[76],"expressions":[77],"given,":[79],"theoretical":[82],"complexity":[83],"analysis":[84],"proves":[85],"our":[87,110],"reduce":[89],"best":[91],"time":[92],"complexities":[93],"known":[94],"to":[95,121],"date.":[96],"have":[99],"been":[100],"implemented":[101],"on":[102],"Xilinx":[103],"Virtex":[104],"FPGAs.":[105],"experiments":[107],"prove":[108],"reduces":[112],"area":[114],"requirements":[115],"with":[119],"respect":[120],"other":[122],"similar":[123],"multipliers.":[124]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}