{"id":"https://openalex.org/W1993825099","doi":"https://doi.org/10.1007/s10623-010-9408-6","title":"A trade-off between collision probability and key size in universal hashing using polynomials","display_name":"A trade-off between collision probability and key size in universal hashing using polynomials","publication_year":2010,"publication_date":"2010-05-25","ids":{"openalex":"https://openalex.org/W1993825099","doi":"https://doi.org/10.1007/s10623-010-9408-6","mag":"1993825099"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-010-9408-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-010-9408-6","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","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/A5036784831","display_name":"Palash Sarkar","orcid":"https://orcid.org/0000-0002-5346-2650"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Palash Sarkar","raw_affiliation_strings":["Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata, 700108, India","Applied Statistics Unit, Indian Statistical Institute, Kolkata, India 700108"],"affiliations":[{"raw_affiliation_string":"Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata, 700108, India","institution_ids":["https://openalex.org/I6498739"]},{"raw_affiliation_string":"Applied Statistics Unit, Indian Statistical Institute, Kolkata, India 700108","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036784831"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.2226,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93935021,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"58","issue":"3","first_page":"271","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9988999962806702,"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.9988999962806702,"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.9983999729156494,"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/T12029","display_name":"DNA and Biological Computing","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8615572452545166},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.7244731187820435},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6894922256469727},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5952949523925781},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5447787046432495},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5378763675689697},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5167362093925476},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.5112109184265137},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.49493998289108276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4947788119316101},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47879108786582947},{"id":"https://openalex.org/keywords/collision-attack","display_name":"Collision attack","score":0.4477420747280121},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.4324973225593567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4220549166202545},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.29466867446899414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2847331166267395},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.17056691646575928},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07823726534843445},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.04799371957778931}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8615572452545166},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.7244731187820435},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6894922256469727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5952949523925781},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5447787046432495},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5378763675689697},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5167362093925476},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.5112109184265137},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.49493998289108276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4947788119316101},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47879108786582947},{"id":"https://openalex.org/C87538441","wikidata":"https://www.wikidata.org/wiki/Q389463","display_name":"Collision attack","level":5,"score":0.4477420747280121},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.4324973225593567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4220549166202545},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.29466867446899414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2847331166267395},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.17056691646575928},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07823726534843445},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.04799371957778931},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10623-010-9408-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-010-9408-6","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-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/W1535554763","https://openalex.org/W1555623005","https://openalex.org/W1567501709","https://openalex.org/W1578627459","https://openalex.org/W1763079358","https://openalex.org/W1981670729","https://openalex.org/W1985623009","https://openalex.org/W2022640260","https://openalex.org/W2022846558","https://openalex.org/W2028732372","https://openalex.org/W2036834545","https://openalex.org/W2052207834"],"related_works":["https://openalex.org/W1551533237","https://openalex.org/W4251536634","https://openalex.org/W2009373702","https://openalex.org/W2615219268","https://openalex.org/W2132034299","https://openalex.org/W1811456777","https://openalex.org/W3124800526","https://openalex.org/W2185281229","https://openalex.org/W3021697024","https://openalex.org/W2034428381"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
