{"id":"https://openalex.org/W2003895037","doi":"https://doi.org/10.1109/isit.2005.1523510","title":"On the construction of balanced boolean functions with a good algebraic immunity","display_name":"On the construction of balanced boolean functions with a good algebraic immunity","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2003895037","doi":"https://doi.org/10.1109/isit.2005.1523510","mag":"2003895037"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5088687711","display_name":"Claude Carlet","orcid":"https://orcid.org/0000-0002-6118-7927"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C. Carlet","raw_affiliation_strings":["Projet CODES, INRIA, France"],"affiliations":[{"raw_affiliation_string":"Projet CODES, INRIA, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019785896","display_name":"Philippe Gaborit","orcid":"https://orcid.org/0000-0002-4034-521X"},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Gaborit","raw_affiliation_strings":["LACO, Universit\u00e9 de Limoges, Limoges, France"],"affiliations":[{"raw_affiliation_string":"LACO, Universit\u00e9 de Limoges, Limoges, France","institution_ids":["https://openalex.org/I65806277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088687711"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":10.0911,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.98103585,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1101","last_page":"1105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9882000088691711,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8032131195068359},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5681277513504028},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.55695641040802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5458193421363831},{"id":"https://openalex.org/keywords/algebraic-function","display_name":"Algebraic function","score":0.529533326625824},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5122811198234558},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4509909451007843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43430736660957336},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.42783743143081665},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.4206356406211853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3362748622894287},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2285458743572235}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8032131195068359},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5681277513504028},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.55695641040802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5458193421363831},{"id":"https://openalex.org/C148607811","wikidata":"https://www.wikidata.org/wiki/Q746863","display_name":"Algebraic function","level":3,"score":0.529533326625824},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5122811198234558},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4509909451007843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43430736660957336},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.42783743143081665},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4206356406211853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3362748622894287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2285458743572235},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1699105","https://openalex.org/W195350891","https://openalex.org/W1488367145","https://openalex.org/W1490691825","https://openalex.org/W1498892963","https://openalex.org/W1512363553","https://openalex.org/W1542020576","https://openalex.org/W1567939424","https://openalex.org/W1588952639","https://openalex.org/W1589266564","https://openalex.org/W1604159040","https://openalex.org/W1783446041","https://openalex.org/W1918243660","https://openalex.org/W1971862312","https://openalex.org/W1999774889","https://openalex.org/W2007863720","https://openalex.org/W2012957959","https://openalex.org/W2050467723","https://openalex.org/W2089606264","https://openalex.org/W4236509984","https://openalex.org/W4285719527","https://openalex.org/W4292002956","https://openalex.org/W6629318427","https://openalex.org/W6632521940","https://openalex.org/W6635953935","https://openalex.org/W6638230691","https://openalex.org/W6640153578","https://openalex.org/W6818108484"],"related_works":["https://openalex.org/W2234833091","https://openalex.org/W2106622045","https://openalex.org/W2379318067","https://openalex.org/W1991921929","https://openalex.org/W4252281389","https://openalex.org/W2000290939","https://openalex.org/W1543389043","https://openalex.org/W2394411108","https://openalex.org/W2373780871","https://openalex.org/W2085941413"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,88],"study":[4],"the":[5,15,36,57,62,76],"algebraic":[6,24,37,77,96,109],"immunity":[7,38,78,97],"of":[8,17,39,64,79,91,103],"Boolean":[9,19,42,80],"functions":[10,20,81,93,105],"and":[11,98,102,114],"consider":[12],"in":[13],"particular":[14],"problem":[16],"constructing":[18],"with":[21,51,94,106],"a":[22,40,52,72,99,107,111,115],"good":[23,100,108,112,116],"immunity.":[25],"We":[26,66],"first":[27],"give":[28,67,89],"heuristic":[29],"arguments":[30],"which":[31,119],"seem":[32],"to":[33],"indicate":[34],"that":[35],"random":[41],"function":[43],"on":[44,75],"n":[45],"variables":[46],"is":[47,60],"at":[48],"least":[49],"lfloorn/2rfloor":[50],"very":[53],"high":[54],"probability":[55],"(while":[56],"upper":[58,69],"bound":[59],"lceiln/2rceil,":[61],"\"ceiling\"":[63],"n/2).":[65],"an":[68],"bound,":[70],"under":[71],"reasonable":[73],"assumption,":[74],"constructed":[82],"through":[83],"Maiorana-MacFarland":[84],"construction.":[85],"At":[86],"last":[87],"examples":[90],"balanced":[92,104],"optimal":[95],"nonlinearity":[101,113],"immunity,":[110,118],"correlation":[117],"can":[120],"be":[121],"used":[122],"for":[123],"cryptographic":[124],"purposes":[125]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}