{"id":"https://openalex.org/W7131671064","doi":"https://doi.org/10.1109/access.2026.3668453","title":"MiNTT: A Family of Module Lattice-Based Cryptographic Compression Functions","display_name":"MiNTT: A Family of Module Lattice-Based Cryptographic Compression Functions","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7131671064","doi":"https://doi.org/10.1109/access.2026.3668453"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3668453","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3668453","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3668453","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107085757","display_name":"Riley Vaughn","orcid":null},"institutions":[{"id":"https://openalex.org/I12834331","display_name":"University of Wyoming","ror":"https://ror.org/01485tq96","country_code":"US","type":"education","lineage":["https://openalex.org/I12834331"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Riley Vaughn","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Wyoming, Laramie, WY, USA"],"raw_orcid":"https://orcid.org/0000-0002-8676-4524","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Wyoming, Laramie, WY, USA","institution_ids":["https://openalex.org/I12834331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086398848","display_name":"Mike Borowczak","orcid":"https://orcid.org/0000-0001-9409-8245"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mike Borowczak","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL, USA"],"raw_orcid":"https://orcid.org/0000-0001-9409-8245","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL, USA","institution_ids":["https://openalex.org/I106165777"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25528962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"32295","last_page":"32307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.6352999806404114,"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/T10237","display_name":"Cryptography and Data Security","score":0.6352999806404114,"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.11299999803304672,"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/T11130","display_name":"Coding theory and cryptography","score":0.08649999648332596,"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/hash-function","display_name":"Hash function","score":0.6822999715805054},{"id":"https://openalex.org/keywords/cryptographic-hash-function","display_name":"Cryptographic hash function","score":0.654699981212616},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5612000226974487},{"id":"https://openalex.org/keywords/security-of-cryptographic-hash-functions","display_name":"Security of cryptographic hash functions","score":0.546999990940094},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5461000204086304},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4968999922275543},{"id":"https://openalex.org/keywords/nist","display_name":"NIST","score":0.4609000086784363},{"id":"https://openalex.org/keywords/sha-2","display_name":"SHA-2","score":0.42149999737739563},{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.4140999913215637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7718999981880188},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6822999715805054},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.654699981212616},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5612000226974487},{"id":"https://openalex.org/C165511393","wikidata":"https://www.wikidata.org/wiki/Q7252276","display_name":"Security of cryptographic hash functions","level":5,"score":0.546999990940094},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5461000204086304},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48570001125335693},{"id":"https://openalex.org/C111219384","wikidata":"https://www.wikidata.org/wiki/Q6954384","display_name":"NIST","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C190157925","wikidata":"https://www.wikidata.org/wiki/Q1968605","display_name":"SHA-2","level":4,"score":0.42149999737739563},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.4140999913215637},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.39820000529289246},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.36230000853538513},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3411000072956085},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C135783594","wikidata":"https://www.wikidata.org/wiki/Q5678864","display_name":"Hash chain","level":3,"score":0.2915000021457672},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.2913999855518341},{"id":"https://openalex.org/C87538441","wikidata":"https://www.wikidata.org/wiki/Q389463","display_name":"Collision attack","level":5,"score":0.2906999886035919},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28619998693466187},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C28420585","wikidata":"https://www.wikidata.org/wiki/Q2665075","display_name":"Timing attack","level":4,"score":0.2687000036239624},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3668453","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3668453","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:f30786cd9dd6464b823192940c771cef","is_oa":true,"landing_page_url":"https://doaj.org/article/f30786cd9dd6464b823192940c771cef","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 32295-32307 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3668453","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3668453","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"cryptographic":[1,37,109],"compression":[2,87,110,124],"function":[3,10],"is":[4,185],"the":[5,69,82,95,114,143,159,176,186,191,200,205,230],"part":[6],"of":[7,36,84,107,130,171,181,190,196,199],"a":[8,27,34,105,140,182,194,239],"hash":[9,48,241],"most":[11,78],"responsible":[12],"for":[13,31,33,46,219,236],"compressing":[14],"input":[15,180],"while":[16],"avoiding":[17],"collisions.":[18],"In":[19],"recent":[20,79],"years":[21],"[26],":[22],"[27],":[23],"NIST":[24],"has":[25],"released":[26],"<italic":[28],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[29],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Call":[30],"Proposals</i>":[32],"variety":[35],"primitives,":[38],"albeit":[39],"there":[40],"have":[41],"been":[42],"no":[43],"calls":[44],"specifically":[45],"post-quantum":[47,62,86,108,123],"functions,":[49],"as":[50,222,224],"classic":[51],"standards":[52],"are":[53,75,217,234],"widely":[54],"considered":[55],"secure":[56],"against":[57],"quantum":[58,73],"threats.":[59],"Nonetheless,":[60],"alternative":[61],"primitives":[63],"should":[64],"not":[65],"be":[66],"disregarded":[67],"in":[68,81,238],"event":[70],"that":[71,212],"novel":[72],"speedups":[74],"discovered.":[76],"The":[77,169],"advancement":[80],"development":[83],"lattice-based":[85],"functions":[88,111],"was":[89,132],"SWIFFT":[90],"[5],":[91],"[21],":[92],"based":[93,112],"on":[94,113],"Ring":[96],"Short":[97,116,145],"Integer":[98,117],"Solution":[99,118],"(R-SIS)":[100],"problem.":[101],"We":[102],"propose":[103],"MiNTT,":[104],"family":[106,202],"Module":[115,144],"problem":[119],"(M-SIS),":[120],"which":[121,173],"brings":[122],"up":[125,175],"to":[126,153,163],"modern":[127],"standards.The":[128],"hardness":[129],"M-SIS":[131],"established":[133],"by":[134],"Langlois":[135],"and":[136,179,203,207,226,229],"Stehl\u00e9":[137],"[19]":[138],"via":[139],"reduction":[141],"from":[142],"Independent":[146],"Vectors":[147],"Problem":[148],"(M-SIVP),":[149],"ensuring":[150],"strong":[151],"worst-case":[152],"average-case":[154],"security":[155,208,221],"guarantees.":[156],"MiNTT":[157,183,201],"leverages":[158],"Number":[160],"Theoretic":[161],"Transform":[162],"enable":[164],"highly":[165],"efficient":[166],"polynomial":[167],"multiplication.":[168],"multiplication":[170],"polynomials,":[172],"make":[174],"key":[177],"matrix":[178],"function,":[184],"primary":[187],"computational":[188],"overhead":[189],"function.We":[192],"provide":[193],"range":[195],"concrete":[197,220],"parameterizations":[198],"analyze":[204],"efficiency":[206],"levels,":[209],"including":[210],"optimizations":[211],"exploit":[213],"SIMD":[214],"parallelism.":[215],"Parameterizations":[216],"tested":[218],"well":[223],"throughput":[225],"memory":[227],"efficiency,":[228],"top":[231],"preforming":[232],"variants":[233],"suggested":[235],"use":[237],"MiNTT-based":[240],"function.":[242]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-27T00:00:00"}