Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences最新文献

{"title":"Polynomial lattices for the BIKE cryptosystem.","authors":"Michael Schaller","doi":"10.1007/s12095-026-00875-1","DOIUrl":"https://doi.org/10.1007/s12095-026-00875-1","url":null,"abstract":"<p><p>In this paper we introduce a rank [Formula: see text] lattice over a polynomial ring arising from the public key of the BIKE cryptosystem (2024). The secret key is a sparse vector in this lattice. We study properties of this lattice and generalize the recovery of weak keys from Bardet, Dragoi, Luque and Otmani (2016). In particular, we show that they implicitly solved a shortest vector problem in the lattice we constructed. Rather than finding only a shortest vector, we obtain a reduced basis of the lattice which makes it possible to check for more weak keys.</p>","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"18 5","pages":"1723-1733"},"PeriodicalIF":1.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13649843/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149168869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs.","authors":"Chris Brzuska, Geoffroy Couteau, Christoph Egger, Pihla Karanko, Pierre Meyer","doi":"10.1007/s12095-025-00825-3","DOIUrl":"https://doi.org/10.1007/s12095-025-00825-3","url":null,"abstract":"<p><p>We instantiate the hash-then-evaluate paradigm for pseudorandom functions (PRFs), <math><mrow><mi>PRF</mi> <mo>(</mo> <mi>k</mi> <mo>,</mo> <mi>x</mi> <mo>)</mo> <mo>:</mo> <mo>=</mo> <mi>wPRF</mi> <mo>(</mo> <mi>k</mi> <mo>,</mo> <mi>RO</mi> <mo>(</mo> <mi>x</mi> <mo>)</mo> <mo>)</mo></mrow> </math> , which builds a PRF <math><mi>PRF</mi></math> from a weak PRF <math><mi>wPRF</mi></math> via a <i>public</i> pre-processing random oracle <math><mi>RO</mi></math> . In applications to secure multiparty computation (MPC), only the low-complexity <math><mi>wPRF</mi></math> performs secret-depending operations. Our construction replaces <math><mi>RO</mi></math> by <math><mrow><mi>f</mi> <mo>(</mo> <msub><mi>k</mi> <mi>H</mi></msub> <mo>,</mo> <mi>elf</mi> <mrow><mo>(</mo> <mi>x</mi> <mo>)</mo></mrow> <mo>)</mo></mrow> </math> , where <i>f</i> is a non-adaptive PRF and the key <math><msub><mi>k</mi> <mi>H</mi></msub> </math> is <i>public</i> and thus known to the distinguishing adversary. We show that, perhaps surprisingly, several existing weak PRF candidates are plausibly also secure when their inputs are generated by <math><mrow><mi>f</mi> <mo>(</mo> <msub><mi>k</mi> <mi>H</mi></msub> <mo>,</mo> <mi>elf</mi> <mrow><mo>(</mo> <mo>.</mo> <mo>)</mo></mrow> <mo>)</mo></mrow> </math> . Firstly, analogous cryptanalysis applies (because pseudorandomness of <i>f</i> implies good statistical properties) and/or secondly an attack against the weak PRF with such pseudorandom inputs generated by <i>f</i> would imply surprising results such as key agreement from the hardness of the high-noise version of the Learning Parity with Noise (LPN) when implementing both <math><mi>wPRF</mi></math> and <i>f</i> from this assumption. Our simple transformation of replacing <math><mrow><mi>RO</mi> <mo>(</mo> <mo>·</mo> <mo>)</mo></mrow> </math> public pre-processing by <math><mrow><mi>f</mi> <mo>(</mo> <msub><mi>k</mi> <mi>H</mi></msub> <mo>,</mo> <mi>elf</mi> <mrow><mo>(</mo> <mi>x</mi> <mo>)</mo></mrow> <mo>)</mo></mrow> </math> public pre-processing applies to the entire family of PRF-style functions. Specifically, we obtain results for oblivious PRFs, which are a core building block for password-based authenticated key exchange (PAKE) and private set intersection (PSI) protocols, and we also obtain results for pseudorandom correlation functions (PCF), which are a key tool for silent oblivious transfer (OT) extension.</p>","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"17 5","pages":"1325-1366"},"PeriodicalIF":1.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12474740/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145187094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Construction and equivalence for generalized boolean functions.","authors":"Ayça Çeşmelioğlu, Wilfried Meidl","doi":"10.1007/s12095-025-00805-7","DOIUrl":"10.1007/s12095-025-00805-7","url":null,"abstract":"<p><p>Recently in Çeşmelioğlu, Meidl (<i>Adv. Math. Commun.,</i> <i>18</i>, 2024), the study of EA-equivalence and CCZ-equivalence for functions from <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mi>p</mi> <mo>)</mo></mrow> </msubsup> </math> to the cyclic group <math><msub><mi>Z</mi> <msup><mi>p</mi> <mi>k</mi></msup> </msub> </math> has been initiated, where <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mi>p</mi> <mo>)</mo></mrow> </msubsup> </math> denotes an <i>n</i>-dimensional vector space over <math><msub><mi>F</mi> <mi>p</mi></msub> </math> . Amongst others it has been shown that there exist functions from <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mn>2</mn> <mo>)</mo></mrow> </msubsup> </math> to <math><msub><mi>Z</mi> <mn>4</mn></msub> </math> which are CCZ-equivalent but not EA-equivalent. We extend these results to larger classes of functions from <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mi>p</mi> <mo>)</mo></mrow> </msubsup> </math> to <math><msub><mi>Z</mi> <msup><mi>p</mi> <mi>k</mi></msup> </msub> </math> . We then discuss constructions of generalized bent functions from <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mi>p</mi> <mo>)</mo></mrow> </msubsup> </math> to <math><msub><mi>Z</mi> <msup><mi>p</mi> <mi>k</mi></msup> </msub> </math> , <i>p</i> odd or <math><mrow><mi>p</mi> <mo>=</mo> <mn>2</mn></mrow> </math> and <i>n</i> is even, which correspond to large affine spaces of bent functions. In particular we employ versions of the direct sum, the semi-direct sum and of a recent secondary bent function construction in Wang et. al., (<i>IEEE Trans. Inform. Theory</i> <i>69</i>, 2023), to generate large affine spaces of bent functions. Finally we present a solution for constructing generalized bent functions from <math><msubsup><mi>V</mi> <mi>n</mi> <mrow><mo>(</mo> <mn>2</mn> <mo>)</mo></mrow> </msubsup> </math> to <math><msub><mi>Z</mi> <msup><mn>2</mn> <mi>k</mi></msup> </msub> </math> , <i>n</i> odd, from arbitrary generalized bent functions from <math><msubsup><mi>V</mi> <mrow><mi>n</mi> <mo>-</mo> <mn>1</mn></mrow> <mrow><mo>(</mo> <mn>2</mn> <mo>)</mo></mrow> </msubsup> </math> to <math><msub><mi>Z</mi> <msup><mn>2</mn> <mrow><mi>k</mi> <mo>-</mo> <mn>1</mn></mrow> </msup> </msub> </math> .</p>","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"17 6","pages":"1659-1682"},"PeriodicalIF":1.3,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12537615/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145349486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Three classes of permutation quadrinomials in odd characteristic","authors":"Changhui Chen, H.-B. Kan, Jie Peng, Lijing Zheng, Yanjun Li","doi":"10.1007/s12095-023-00672-0","DOIUrl":"https://doi.org/10.1007/s12095-023-00672-0","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43062328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The cross-correlation spectrum of ternary perfect sequences and their decimations","authors":"Xinxin Lv, Cuiling Fan, Yanyan Wang","doi":"10.1007/s12095-023-00671-1","DOIUrl":"https://doi.org/10.1007/s12095-023-00671-1","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47095224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Further Results on Affine Sub-Families of NFSR Sequences","authors":"Cheng Che, Tian Tian","doi":"10.1007/s12095-023-00663-1","DOIUrl":"https://doi.org/10.1007/s12095-023-00663-1","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46560892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields","authors":"M. Steiner","doi":"10.1007/s12095-023-00661-3","DOIUrl":"https://doi.org/10.1007/s12095-023-00661-3","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44741373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Lower bounds on the maximum cross-correlations of 2-D quasi-complementary array sets","authors":"A. Roy, S. Majhi","doi":"10.1007/s12095-023-00665-z","DOIUrl":"https://doi.org/10.1007/s12095-023-00665-z","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44137590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hyperbent functions from hyperovals","authors":"K. Abdukhalikov, Duy Ho","doi":"10.1007/s12095-023-00668-w","DOIUrl":"https://doi.org/10.1007/s12095-023-00668-w","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"1031 - 1048"},"PeriodicalIF":1.4,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45294725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The welch-gong stream cipher - evolutionary path","authors":"N. Zidarič, K. Mandal, G. Gong, M. Aagaard","doi":"10.1007/s12095-023-00656-0","DOIUrl":"https://doi.org/10.1007/s12095-023-00656-0","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42223998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}