关于弗里斯特尔的沃尔什谱

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Matthias Johann Steiner
{"title":"关于弗里斯特尔的沃尔什谱","authors":"Matthias Johann Steiner","doi":"10.1007/s10623-025-01589-w","DOIUrl":null,"url":null,"abstract":"<p><span>Anemoi</span> is a family of compression and hash functions over finite fields <span>\\(\\mathbb {F}_q\\)</span> for efficient Zero-Knowledge applications. Its round function is based on a novel permutation <span>\\(\\mathcal {H}: \\mathbb {F}_q^2 \\rightarrow \\mathbb {F}_q^2\\)</span>, called the open <span>Flystel</span>, which is parametrized by a permutation <span>\\(E: \\mathbb {F}_q \\rightarrow \\mathbb {F}_q\\)</span> and two functions <span>\\(Q_\\gamma , Q_\\delta : \\mathbb {F}_q \\rightarrow \\mathbb {F}_q\\)</span>. Over a prime field <span>\\(\\mathbb {F}_p\\)</span> with <i>E</i> a power permutation and <span>\\(Q_\\gamma \\)</span>, <span>\\(Q_\\delta \\)</span> quadratic functions with identical leading coefficient, the <span>Anemoi</span> designers conjectured for the absolute value of the Walsh transform that <span>\\(\\max _{\\textbf{a} \\in \\mathbb {F}_p^2,\\ \\textbf{b} \\in \\mathbb {F}_p^2 {\\setminus } \\{ \\textbf{0} \\}} \\left| \\mathcal {W}_\\mathcal {H} (\\psi , \\textbf{a}, \\textbf{b}) \\right| \\le p \\cdot \\log \\left( p \\right) \\)</span>. By exploiting that the open <span>Flystel</span> is CCZ-equivalent to the closed <span>Flystel</span>, we prove in this note that <span>\\(\\max _{\\textbf{a} \\in \\mathbb {F}_p^2,\\ \\textbf{b} \\in \\mathbb {F}_p^2 {\\setminus } \\{ \\textbf{0} \\}} \\left| \\mathcal {W}_\\mathcal {H} (\\psi , \\textbf{a}, \\textbf{b}) \\right| \\le (d - 1) \\cdot p\\)</span>, where <span>\\(d = \\deg \\left( E \\right) \\)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"13 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on the Walsh spectrum of the Flystel\",\"authors\":\"Matthias Johann Steiner\",\"doi\":\"10.1007/s10623-025-01589-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><span>Anemoi</span> is a family of compression and hash functions over finite fields <span>\\\\(\\\\mathbb {F}_q\\\\)</span> for efficient Zero-Knowledge applications. Its round function is based on a novel permutation <span>\\\\(\\\\mathcal {H}: \\\\mathbb {F}_q^2 \\\\rightarrow \\\\mathbb {F}_q^2\\\\)</span>, called the open <span>Flystel</span>, which is parametrized by a permutation <span>\\\\(E: \\\\mathbb {F}_q \\\\rightarrow \\\\mathbb {F}_q\\\\)</span> and two functions <span>\\\\(Q_\\\\gamma , Q_\\\\delta : \\\\mathbb {F}_q \\\\rightarrow \\\\mathbb {F}_q\\\\)</span>. Over a prime field <span>\\\\(\\\\mathbb {F}_p\\\\)</span> with <i>E</i> a power permutation and <span>\\\\(Q_\\\\gamma \\\\)</span>, <span>\\\\(Q_\\\\delta \\\\)</span> quadratic functions with identical leading coefficient, the <span>Anemoi</span> designers conjectured for the absolute value of the Walsh transform that <span>\\\\(\\\\max _{\\\\textbf{a} \\\\in \\\\mathbb {F}_p^2,\\\\ \\\\textbf{b} \\\\in \\\\mathbb {F}_p^2 {\\\\setminus } \\\\{ \\\\textbf{0} \\\\}} \\\\left| \\\\mathcal {W}_\\\\mathcal {H} (\\\\psi , \\\\textbf{a}, \\\\textbf{b}) \\\\right| \\\\le p \\\\cdot \\\\log \\\\left( p \\\\right) \\\\)</span>. By exploiting that the open <span>Flystel</span> is CCZ-equivalent to the closed <span>Flystel</span>, we prove in this note that <span>\\\\(\\\\max _{\\\\textbf{a} \\\\in \\\\mathbb {F}_p^2,\\\\ \\\\textbf{b} \\\\in \\\\mathbb {F}_p^2 {\\\\setminus } \\\\{ \\\\textbf{0} \\\\}} \\\\left| \\\\mathcal {W}_\\\\mathcal {H} (\\\\psi , \\\\textbf{a}, \\\\textbf{b}) \\\\right| \\\\le (d - 1) \\\\cdot p\\\\)</span>, where <span>\\\\(d = \\\\deg \\\\left( E \\\\right) \\\\)</span>.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2025-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-025-01589-w\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-025-01589-w","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

Anemoi是一组有限域上的压缩和哈希函数\(\mathbb {F}_q\),用于高效的零知识应用程序。它的圆函数基于一种新的排列\(\mathcal {H}: \mathbb {F}_q^2 \rightarrow \mathbb {F}_q^2\),称为开放的Flystel,它由一个排列\(E: \mathbb {F}_q \rightarrow \mathbb {F}_q\)和两个函数\(Q_\gamma , Q_\delta : \mathbb {F}_q \rightarrow \mathbb {F}_q\)参数化。在一个素数域\(\mathbb {F}_p\)上,E a幂排列和\(Q_\gamma \), \(Q_\delta \)二次函数具有相同的前导系数,Anemoi设计者推测了Walsh变换的绝对值\(\max _{\textbf{a} \in \mathbb {F}_p^2,\ \textbf{b} \in \mathbb {F}_p^2 {\setminus } \{ \textbf{0} \}} \left| \mathcal {W}_\mathcal {H} (\psi , \textbf{a}, \textbf{b}) \right| \le p \cdot \log \left( p \right) \)。通过利用开放的Flystel与封闭的Flystel是ccz等效的,我们在本笔记中证明\(\max _{\textbf{a} \in \mathbb {F}_p^2,\ \textbf{b} \in \mathbb {F}_p^2 {\setminus } \{ \textbf{0} \}} \left| \mathcal {W}_\mathcal {H} (\psi , \textbf{a}, \textbf{b}) \right| \le (d - 1) \cdot p\),其中\(d = \deg \left( E \right) \)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A note on the Walsh spectrum of the Flystel

Anemoi is a family of compression and hash functions over finite fields \(\mathbb {F}_q\) for efficient Zero-Knowledge applications. Its round function is based on a novel permutation \(\mathcal {H}: \mathbb {F}_q^2 \rightarrow \mathbb {F}_q^2\), called the open Flystel, which is parametrized by a permutation \(E: \mathbb {F}_q \rightarrow \mathbb {F}_q\) and two functions \(Q_\gamma , Q_\delta : \mathbb {F}_q \rightarrow \mathbb {F}_q\). Over a prime field \(\mathbb {F}_p\) with E a power permutation and \(Q_\gamma \), \(Q_\delta \) quadratic functions with identical leading coefficient, the Anemoi designers conjectured for the absolute value of the Walsh transform that \(\max _{\textbf{a} \in \mathbb {F}_p^2,\ \textbf{b} \in \mathbb {F}_p^2 {\setminus } \{ \textbf{0} \}} \left| \mathcal {W}_\mathcal {H} (\psi , \textbf{a}, \textbf{b}) \right| \le p \cdot \log \left( p \right) \). By exploiting that the open Flystel is CCZ-equivalent to the closed Flystel, we prove in this note that \(\max _{\textbf{a} \in \mathbb {F}_p^2,\ \textbf{b} \in \mathbb {F}_p^2 {\setminus } \{ \textbf{0} \}} \left| \mathcal {W}_\mathcal {H} (\psi , \textbf{a}, \textbf{b}) \right| \le (d - 1) \cdot p\), where \(d = \deg \left( E \right) \).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信