{"id":"https://openalex.org/W2342913047","doi":"https://doi.org/10.1145/2850449.2850457","title":"Deterministic root finding in finite fields","display_name":"Deterministic root finding in finite fields","publication_year":2015,"publication_date":"2015-11-24","ids":{"openalex":"https://openalex.org/W2342913047","doi":"https://doi.org/10.1145/2850449.2850457","mag":"2342913047"},"language":"en","primary_location":{"id":"doi:10.1145/2850449.2850457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2850449.2850457","pdf_url":null,"source":{"id":"https://openalex.org/S176185422","display_name":"ACM communications in computer algebra","issn_l":"1932-2232","issn":["1932-2232","1932-2240"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320725","host_organization_name":"SIGSAM","host_organization_lineage":["https://openalex.org/P4310320725"],"host_organization_lineage_names":["SIGSAM"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Communications in Computer Algebra","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/A5059802813","display_name":"Luca De Feo","orcid":"https://orcid.org/0000-0002-9321-0773"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luca De Feo","raw_affiliation_strings":["Universit\u00e9 de Versailles"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Versailles","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046548183","display_name":"Christophe Petit","orcid":"https://orcid.org/0000-0003-3482-6743"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christophe Petit","raw_affiliation_strings":["University College London"],"affiliations":[{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049676844","display_name":"Micha\u00ebl Quisquater","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha\u00ebl Quisquater","raw_affiliation_strings":["Universit\u00e9 de Versailles"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Versailles","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059802813"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12337515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"49","issue":"3","first_page":"87","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9968000054359436,"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/T11130","display_name":"Coding theory and cryptography","score":0.9968000054359436,"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.9635000228881836,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.942799985408783,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.730347752571106},{"id":"https://openalex.org/keywords/root-finding-algorithm","display_name":"Root-finding algorithm","score":0.7240362167358398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6059359312057495},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5751343369483948},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.555334210395813},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.524461030960083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4897463321685791},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.46019530296325684},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44774726033210754},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.41974806785583496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3019868731498718},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.12870359420776367}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.730347752571106},{"id":"https://openalex.org/C194777461","wikidata":"https://www.wikidata.org/wiki/Q1085860","display_name":"Root-finding algorithm","level":3,"score":0.7240362167358398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6059359312057495},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5751343369483948},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.555334210395813},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.524461030960083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4897463321685791},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.46019530296325684},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44774726033210754},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.41974806785583496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3019868731498718},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12870359420776367},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2850449.2850457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2850449.2850457","pdf_url":null,"source":{"id":"https://openalex.org/S176185422","display_name":"ACM communications in computer algebra","issn_l":"1932-2232","issn":["1932-2232","1932-2240"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320725","host_organization_name":"SIGSAM","host_organization_lineage":["https://openalex.org/P4310320725"],"host_organization_lineage_names":["SIGSAM"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Communications in Computer Algebra","raw_type":"journal-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/321926","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/321926","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Communications in Computer Algebra, 49 (3","raw_type":"info:ulb-repo/semantics/openurl/article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/e8962e20-346c-46b5-89ba-fe92b1f93f44","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/e8962e20-346c-46b5-89ba-fe92b1f93f44","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"De Feo, L, Petit, C & Quisquater, M 2015, 'Deterministic root finding in finite fields', ACM Communications in Computer Algebra, vol. 49, no. 3, pp. 87-89. https://doi.org/10.1145/2850449.2850457","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1589190557","https://openalex.org/W1594652978","https://openalex.org/W1755210777","https://openalex.org/W1973452640","https://openalex.org/W1988473257","https://openalex.org/W2033111719","https://openalex.org/W2052965490","https://openalex.org/W2055762904","https://openalex.org/W2083705878","https://openalex.org/W2131094491","https://openalex.org/W6635597292","https://openalex.org/W6664460950"],"related_works":["https://openalex.org/W1563175402","https://openalex.org/W4299823417","https://openalex.org/W3198881649","https://openalex.org/W3169616122","https://openalex.org/W1988566873","https://openalex.org/W4287325063","https://openalex.org/W2377857862","https://openalex.org/W3215882190","https://openalex.org/W70233489","https://openalex.org/W2041939310"],"abstract_inverted_index":{"Finding":[0],"roots":[1],"of":[2,14,60,88,96,197,231,246,268,272,284,300],"polynomials":[3],"with":[4,38,219],"coefficients":[5],"in":[6,42,72,108,114,164,277],"a":[7,11,34,109,115,165,204,223,305],"finite":[8,90,247],"field":[9,49,91],"is":[10,28,33,54,70,92,99,154,255],"special":[12,58,81,237,266],"instance":[13],"the":[15,29,44,48,57,86,89,102,155,192,244,269,280,297],"polynomial":[16,41,45,64,252],"factorization":[17],"problem.":[18],"The":[19,94,239],"most":[20,83],"well":[21],"known":[22,71,79],"algorithm":[23,37,66,241,307],"for":[24,56,67,80,106,249,282],"factoring":[25],"and":[26,47,137,145,168,175,199,210,230,234,262,303],"root-finding":[27,254],"Cantor-Zassenhaus":[30],"algorithm.":[31],"It":[32,153],"Las":[35],"Vegas":[36],"running":[39,52],"time":[40,53,65,157,253],"both":[43],"degree":[46],"size.":[50],"Its":[51],"quasi-optimal":[55],"case":[59],"root-finding.":[61],"No":[62],"deterministic":[63,76,104,251],"these":[68,159,273],"problems":[69],"general,":[73],"however":[74],"several":[75,185,260],"algorithms":[77,105,160],"are":[78,161,171,236],"instances,":[82],"notably":[84],"when":[85],"characteristic":[87],"small.":[93],"goal":[95],"this":[97],"poster":[98,291],"to":[100,177,216,221,265,279],"review":[101],"best":[103],"root-finding,":[107],"systematic":[110],"way.":[111],"We":[112,189,202,213,258],"present,":[113],"unified":[116],"way,":[117,167],"four":[118],"algorithms:":[119],"\u2022":[120,126,133,146,188,201,212,257],"Berlekamp's":[121],"Trace":[122],"Algorithm":[123,150],"[2]":[124],"(BTA),":[125],"Moenk's":[127],"Subgroup":[128],"Refinement":[129,140],"Method":[130,141],"[7]":[131],"(SRM),":[132],"Menezes,":[134],"van":[135],"Oorschot":[136],"Vanstone's":[138],"Affine":[139],"[5,":[142],"10]":[143],"(ARM),":[144],"Petit's":[147],"Successive":[148],"Resultants":[149],"[8]":[151],"(SRA).":[152],"first":[156],"that":[158,169,196],"presented":[162],"together":[163],"comprehensive":[166],"they":[170],"rigorously":[172],"analysed,":[173],"implemented":[174],"compared":[176],"each":[178],"other.":[179],"In":[180],"doing":[181],"so,":[182],"we":[183],"obtain":[184,222],"new":[186,224,240,306],"results:":[187],"significantly":[190],"improve":[191],"complexity":[193],"ARM,":[194],"matching":[195],"BTA":[198],"SRA.":[200,211],"highlight":[203],"profound":[205],"duality":[206],"relationship":[207],"between":[208],"ARM":[209,218,233],"show":[214],"how":[215],"combine":[217],"SRM":[220,235],"algorithm,":[225],"which":[226,232,250],"always":[227],"performs":[228],"better,":[229],"instances.":[238],"considerably":[242],"extends":[243],"range":[245],"fields":[248],"possible.":[256],"present":[259],"practical":[261],"asymptotic":[263,298],"improvements":[264],"instances":[267],"algorithms.":[270],"Part":[271],"results":[274],"were":[275,288],"submitted":[276],"response":[278],"call":[281],"papers":[283],"ISSAC":[285],"'15,":[286],"but":[287],"rejected.":[289],"This":[290],"corrects":[292],"some":[293,301],"minor":[294],"imperfections,":[295],"improves":[296],"complexities":[299],"algorithms,":[302],"presents":[304],"not":[308],"previously":[309],"known.":[310]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}