Pub Date : 2026-02-02DOI: 10.1007/s10623-025-01787-6
Giuseppe D’Alconzo, Alessio Meneghetti, Edoardo Signorini
Cryptographic group actions have gained significant attention in recent years for their application on post-quantum Sigma protocols and digital signatures. In NIST’s recent additional call for post-quantum signatures, three relevant proposals are based on group actions: LESS, MEDS, and ALTEQ. This work explores signature optimisations leveraging a group’s factorisation. We show that if the group admits a factorisation as a semidirect product of subgroups, the group action can be restricted on a quotient space under the equivalence relation induced by the factorisation. If the relation is efficiently decidable, we show that it is possible to construct an equivalent Sigma protocol for a relationship that depends only on one of the subgroups. Moreover, if a special class of representative of the quotient space is efficiently computable via a canonical form, the restricted action is effective and does not incur in security loss. Finally, we apply these techniques to the group actions underlying LESS and MEDS, showing how they will affect the length of signatures and public keys.
{"title":"Group factorisation for smaller signatures from cryptographic group actions","authors":"Giuseppe D’Alconzo, Alessio Meneghetti, Edoardo Signorini","doi":"10.1007/s10623-025-01787-6","DOIUrl":"https://doi.org/10.1007/s10623-025-01787-6","url":null,"abstract":"Cryptographic group actions have gained significant attention in recent years for their application on post-quantum Sigma protocols and digital signatures. In NIST’s recent additional call for post-quantum signatures, three relevant proposals are based on group actions: LESS, MEDS, and ALTEQ. This work explores signature optimisations leveraging a group’s factorisation. We show that if the group admits a factorisation as a semidirect product of subgroups, the group action can be restricted on a quotient space under the equivalence relation induced by the factorisation. If the relation is efficiently decidable, we show that it is possible to construct an equivalent Sigma protocol for a relationship that depends only on one of the subgroups. Moreover, if a special class of representative of the quotient space is efficiently computable via a canonical form, the restricted action is effective and does not incur in security loss. Finally, we apply these techniques to the group actions underlying LESS and MEDS, showing how they will affect the length of signatures and public keys.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"285 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146101473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sequence of numbers of linear codes with increasing hull dimensions","authors":"Stefka Bouyuklieva, Iliya Bouyukliev, Ferruh Özbudak","doi":"10.1007/s10623-025-01776-9","DOIUrl":"https://doi.org/10.1007/s10623-025-01776-9","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"381 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146095743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-28DOI: 10.1007/s10623-025-01790-x
Thierno Mamoudou Sabaly, Marine Minier
{"title":"Differential-linear attacks from new distinguishers","authors":"Thierno Mamoudou Sabaly, Marine Minier","doi":"10.1007/s10623-025-01790-x","DOIUrl":"https://doi.org/10.1007/s10623-025-01790-x","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146070557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-28DOI: 10.1007/s10623-025-01750-5
Yu Zhang, Wenling Wu, Yafei Zheng, Lei Zhang, Yongxia Mao
{"title":"Research on constructing integral distinguishers for block ciphers via the division property","authors":"Yu Zhang, Wenling Wu, Yafei Zheng, Lei Zhang, Yongxia Mao","doi":"10.1007/s10623-025-01750-5","DOIUrl":"https://doi.org/10.1007/s10623-025-01750-5","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"272 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146070556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-26DOI: 10.1007/s10623-025-01777-8
Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner
{"title":"Multisets with few special directions and small weight codewords in desarguesian planes","authors":"Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner","doi":"10.1007/s10623-025-01777-8","DOIUrl":"https://doi.org/10.1007/s10623-025-01777-8","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"85 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：