{"title":"在锌晶格的基础上","authors":"Shashank K. Mehta, M. Rajasree","doi":"10.1109/SYNASC57785.2022.00025","DOIUrl":null,"url":null,"abstract":"The ${\\mathbb{Z}^n}$ lattice is the lattice generated by the set of all orthogonal unit integer vectors. Since it has an orthonormal basis, the shortest vector problem and the closest vector problem are easy to solve in this particular lattice. But, these problems are hard to solve when we consider a rotation of ${\\mathbb{Z}^n}$ lattice. In-fact, even though it is known that the ${\\mathbb{Z}^n}$-isomorphism problem is in NP ∩ Co-NP, we still don’t have an efficient algorithm to solve it. Motivated by the above, in this paper we investigate the properties of the bases of ${\\mathbb{Z}^n}$ lattice which are the sets of column/row vectors of unimodular matrices. We show that an integer primitive vector of norm strictly greater than 1 can be extended to a unimodular matrix U such that the remaining vectors have norm strictly smaller than the initial primitive vector. We also show a reduction from SVP in any lattice isomorphic to ${\\mathbb{Z}^n}$ to SVP in n − 1 dimensional sublattice of ${\\mathbb{Z}^n}$. We define two new classes of lattice bases and show certain results related to ${\\mathbb{Z}^n}$ bases. Finally, we study the relation between any solution to Successive Minima Problem and the set of Voronoi relevant vectors and present some bounds related to the compact bases of ${\\mathbb{Z}^n}$.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the bases of Zn lattice\",\"authors\":\"Shashank K. Mehta, M. Rajasree\",\"doi\":\"10.1109/SYNASC57785.2022.00025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ${\\\\mathbb{Z}^n}$ lattice is the lattice generated by the set of all orthogonal unit integer vectors. Since it has an orthonormal basis, the shortest vector problem and the closest vector problem are easy to solve in this particular lattice. But, these problems are hard to solve when we consider a rotation of ${\\\\mathbb{Z}^n}$ lattice. In-fact, even though it is known that the ${\\\\mathbb{Z}^n}$-isomorphism problem is in NP ∩ Co-NP, we still don’t have an efficient algorithm to solve it. Motivated by the above, in this paper we investigate the properties of the bases of ${\\\\mathbb{Z}^n}$ lattice which are the sets of column/row vectors of unimodular matrices. We show that an integer primitive vector of norm strictly greater than 1 can be extended to a unimodular matrix U such that the remaining vectors have norm strictly smaller than the initial primitive vector. We also show a reduction from SVP in any lattice isomorphic to ${\\\\mathbb{Z}^n}$ to SVP in n − 1 dimensional sublattice of ${\\\\mathbb{Z}^n}$. We define two new classes of lattice bases and show certain results related to ${\\\\mathbb{Z}^n}$ bases. Finally, we study the relation between any solution to Successive Minima Problem and the set of Voronoi relevant vectors and present some bounds related to the compact bases of ${\\\\mathbb{Z}^n}$.\",\"PeriodicalId\":446065,\"journal\":{\"name\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC57785.2022.00025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

${\mathbb{Z}^n}$晶格是由所有正交单位整数向量的集合生成的晶格。由于它有一个标准正交基,在这个特殊的晶格中,最短向量问题和最近向量问题很容易解决。但是,当我们考虑${\mathbb{Z}^n}$晶格的旋转时,这些问题很难解决。事实上,即使我们知道${\mathbb{Z}^n}$-同构问题是NP∩Co-NP,我们仍然没有一个有效的算法来解决它。在此基础上,研究了${\mathbb{Z}^n}$格的基的性质,这些基是非模矩阵的列/行向量的集合。我们证明了范数严格大于1的整数原向量可以推广到一个单模矩阵U,使得剩下的向量的范数严格小于初始原向量。我们还证明了从${\mathbb{Z}^n}$的任意格同构中的SVP到${\mathbb{Z}^n}$的n - 1维子格中的SVP。我们定义了两个新的格基类,并给出了与${\mathbb{Z}^n}$基相关的一些结果。最后,我们研究了连续极小问题的任意解与Voronoi相关向量集之间的关系,并给出了${\mathbb{Z}^n}$紧基的一些界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the bases of Zn lattice
The ${\mathbb{Z}^n}$ lattice is the lattice generated by the set of all orthogonal unit integer vectors. Since it has an orthonormal basis, the shortest vector problem and the closest vector problem are easy to solve in this particular lattice. But, these problems are hard to solve when we consider a rotation of ${\mathbb{Z}^n}$ lattice. In-fact, even though it is known that the ${\mathbb{Z}^n}$-isomorphism problem is in NP ∩ Co-NP, we still don’t have an efficient algorithm to solve it. Motivated by the above, in this paper we investigate the properties of the bases of ${\mathbb{Z}^n}$ lattice which are the sets of column/row vectors of unimodular matrices. We show that an integer primitive vector of norm strictly greater than 1 can be extended to a unimodular matrix U such that the remaining vectors have norm strictly smaller than the initial primitive vector. We also show a reduction from SVP in any lattice isomorphic to ${\mathbb{Z}^n}$ to SVP in n − 1 dimensional sublattice of ${\mathbb{Z}^n}$. We define two new classes of lattice bases and show certain results related to ${\mathbb{Z}^n}$ bases. Finally, we study the relation between any solution to Successive Minima Problem and the set of Voronoi relevant vectors and present some bounds related to the compact bases of ${\mathbb{Z}^n}$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FERPModels: A Certification Framework for Expansion-Based QBF Solving Reducing Adversarial Vulnerability Using GANs Fully-adaptive Model for Broadcasting with Universal Lists An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem* IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1