{"id":"https://openalex.org/W3215760779","doi":"https://doi.org/10.1007/s12095-021-00529-4","title":"Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions","display_name":"Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions","publication_year":2021,"publication_date":"2021-11-19","ids":{"openalex":"https://openalex.org/W3215760779","doi":"https://doi.org/10.1007/s12095-021-00529-4","mag":"3215760779"},"language":"en","primary_location":{"id":"doi:10.1007/s12095-021-00529-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12095-021-00529-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12095-021-00529-4.pdf","source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12095-021-00529-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052214880","display_name":"Ana S\u0103l\u0103gean","orcid":"https://orcid.org/0000-0002-8942-375X"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ana S\u0103l\u0103gean","raw_affiliation_strings":["Department of Computer Science, Loughborough University, Loughborough, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Loughborough University, Loughborough, UK","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021290362","display_name":"Pantelimon St\u0103nic\u0103","orcid":"https://orcid.org/0000-0002-8622-7120"},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pantelimon St\u0103nic\u0103","raw_affiliation_strings":["Applied Mathematics Department, Naval Postgraduate School, Monterey, CA, 93943, USA"],"affiliations":[{"raw_affiliation_string":"Applied Mathematics Department, Naval Postgraduate School, Monterey, CA, 93943, USA","institution_ids":["https://openalex.org/I35364215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052214880"],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.4542,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69252463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"2","first_page":"459","last_page":"481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.995199978351593,"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/boolean-function","display_name":"Boolean function","score":0.8097715377807617},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7984551191329956},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.7068951725959778},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6398918628692627},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5517791509628296},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5499911308288574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5314003229141235},{"id":"https://openalex.org/keywords/linearity","display_name":"Linearity","score":0.49950408935546875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42215681076049805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40528666973114014},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3916124701499939},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3235950469970703},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16881319880485535},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1344403624534607}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8097715377807617},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7984551191329956},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.7068951725959778},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6398918628692627},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5517791509628296},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5499911308288574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5314003229141235},{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.49950408935546875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42215681076049805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40528666973114014},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3916124701499939},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3235950469970703},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16881319880485535},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1344403624534607},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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.1007/s12095-021-00529-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12095-021-00529-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12095-021-00529-4.pdf","source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},{"id":"pmh:oai:calhoun.nps.edu:10945/69147","is_oa":false,"landing_page_url":"https://hdl.handle.net/10945/69147","pdf_url":null,"source":{"id":"https://openalex.org/S4306400952","display_name":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35364215","host_organization_name":"Naval Postgraduate School","host_organization_lineage":["https://openalex.org/I35364215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:figshare.com:article/19085735","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Improving_bounds_on_probabilistic_affine_tests_to_estimate_the_nonlinearity_of_Boolean_functions/19085735","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s12095-021-00529-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12095-021-00529-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12095-021-00529-4.pdf","source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3215760779.pdf","grobid_xml":"https://content.openalex.org/works/W3215760779.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1511781011","https://openalex.org/W1523281138","https://openalex.org/W1567571871","https://openalex.org/W1880399293","https://openalex.org/W1974223185","https://openalex.org/W1997855358","https://openalex.org/W2023194920","https://openalex.org/W2160494425","https://openalex.org/W2285305687","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W2023858428","https://openalex.org/W2218509615","https://openalex.org/W2126963364","https://openalex.org/W2538259895","https://openalex.org/W2051287254","https://openalex.org/W1489573155","https://openalex.org/W2370937376","https://openalex.org/W4293868490","https://openalex.org/W2348662850","https://openalex.org/W3214759509"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper":[3],"we":[4,51,75,82,112,143],"want":[5],"to":[6,26,105,146],"estimate":[7],"the":[8,28,34,55,63,91,116,127,139,152,174],"nonlinearity":[9,153,175],"of":[10,44,57,65,67,93,108,118,120,138],"Boolean":[11],"functions,":[12],"by":[13],"probabilistic":[14,148],"methods,":[15],"when":[16,173],"it":[17],"is":[18,33,176],"computationally":[19],"very":[20],"expensive,":[21],"or":[22],"perhaps":[23],"not":[24],"feasible":[25],"compute":[27],"full":[29],"Walsh":[30],"transform":[31],"(which":[32],"case":[35],"for":[36,150],"almost":[37],"all":[38],"functions":[39],"in":[40,73,136],"a":[41,77,121],"larger":[42],"number":[43],"variables,":[45],"say":[46],"more":[47],"than":[48],"30).":[49],"Firstly,":[50],"significantly":[52],"improve":[53],"upon":[54,155],"bounds":[56,114,133],"Zhang":[58],"and":[59,142,163],"Zheng":[60],"(1999)":[61],"on":[62,71,115],"probabilities":[64],"failure":[66,119],"affinity":[68,123,157],"tests":[69,107],"based":[70,154],"nonhomomorphicity,":[72],"particular,":[74],"prove":[76,113],"new":[78,87],"lower":[79,88],"bound":[80,89],"that":[81,125,145,165],"have":[83,167],"previously":[84],"conjectured.":[85],"This":[86],"generalizes":[90],"one":[92],"Bellare":[94],"et":[95],"al.":[96],"(IEEE":[97],"Trans.":[98],"Inf.":[99],"Theory":[100],"42":[101],"(6),":[102],"1781\u20131795":[103],"1996)":[104],"nonhomomorphicity":[106],"arbitrary":[109],"order.":[110],"Secondly,":[111],"probability":[117],"proposed":[122],"test":[124],"uses":[126],"BLR":[128],"linearity":[129],"test.":[130],"All":[131],"these":[132,156],"are":[134],"expressed":[135],"terms":[137],"function\u2019s":[140],"nonlinearity,":[141],"exploit":[144],"provide":[147],"methods":[149],"estimating":[151],"tests.":[158],"We":[159],"analyze":[160],"our":[161],"estimates":[162],"conclude":[164],"they":[166],"reasonably":[168],"good":[169],"accuracy,":[170],"particularly":[171],"so":[172],"low.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}