Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security

Hassan Khodaiemehr, D. Panario, Mohammad-Reza Sadeghi
{"title":"Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security","authors":"Hassan Khodaiemehr, D. Panario, Mohammad-Reza Sadeghi","doi":"10.1109/ISCISC.2018.8546855","DOIUrl":null,"url":null,"abstract":"We present an overview of recent advances in the Area of information security using algebraic number fields. This overview indicates the importance of modular lattices in information security and in recently proposed methods for obtaining modular lattices using algebraic number fields. Obtaining Construction a unimodular lattices using cyclotomic number fields of prime orders have been addressed in the literature. Recently, a new lattice invariant called secrecy gain has been defined and it has been shown that it characterizes the confusion at the eavesdropper when using lattices in the Gaussian wiretap channels. There is a symmetry point, called weak secrecy gain, in the secrecy function of modular lattices. It is conjectured that the weak secrecy gain is the secrecy gain. It is known that d-modular lattices with high level d are more likely to have a large length for the shortest nonzero vector, which results in a higher weak secrecy gain. In search of such lattices, we prove that there is no modular lattices built using Construction A over cyclotomic fields of prime power order $p^{n}$, with $n > 1$. We also present a new framework based on Construction A lattices and cyclotomic number fields that gives a family of p-modular lattices with $p\\equiv 1 (\\mathrm {m}\\mathrm {o}\\mathrm {d}~4)$.","PeriodicalId":318403,"journal":{"name":"2018 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCISC.2018.8546855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We present an overview of recent advances in the Area of information security using algebraic number fields. This overview indicates the importance of modular lattices in information security and in recently proposed methods for obtaining modular lattices using algebraic number fields. Obtaining Construction a unimodular lattices using cyclotomic number fields of prime orders have been addressed in the literature. Recently, a new lattice invariant called secrecy gain has been defined and it has been shown that it characterizes the confusion at the eavesdropper when using lattices in the Gaussian wiretap channels. There is a symmetry point, called weak secrecy gain, in the secrecy function of modular lattices. It is conjectured that the weak secrecy gain is the secrecy gain. It is known that d-modular lattices with high level d are more likely to have a large length for the shortest nonzero vector, which results in a higher weak secrecy gain. In search of such lattices, we prove that there is no modular lattices built using Construction A over cyclotomic fields of prime power order $p^{n}$, with $n > 1$. We also present a new framework based on Construction A lattices and cyclotomic number fields that gives a family of p-modular lattices with $p\equiv 1 (\mathrm {m}\mathrm {o}\mathrm {d}~4)$.
基于环切场的格的模块化构造及其在信息安全中的应用
我们提出了在信息安全领域使用代数数字领域的最新进展的概述。本文概述了模格在信息安全中的重要性,以及最近提出的使用代数数域获得模格的方法。利用素阶环切数域构造非模格的方法已经在文献中得到了讨论。最近,我们定义了一种新的晶格不变量,称为保密增益,并证明了它表征了在高斯窃听信道中使用晶格时窃听者的混乱。模格的保密函数中存在一个称为弱保密增益的对称点。推测弱保密增益即为保密增益。已知d阶高的d模格对于最短的非零向量更有可能具有较大的长度,从而获得较高的弱保密增益。为了寻找这样的格,我们证明了在素数幂次$p^{n}$的环切场上不存在模格,且$n > 1$。我们还提出了一个基于构造a格和环分数域的新框架,该框架给出了一类p模格$p\equiv $ (\ mathm {m}\ mathm {o}\ mathm {d}~4)$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信