A sharper lower bound on Rankin's constant

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Kang Li , Fengjun Xiao , Bingpeng Zhou , Jinming Wen
{"title":"A sharper lower bound on Rankin's constant","authors":"Kang Li ,&nbsp;Fengjun Xiao ,&nbsp;Bingpeng Zhou ,&nbsp;Jinming Wen","doi":"10.1016/j.ipl.2023.106379","DOIUrl":null,"url":null,"abstract":"<div><p><span>Rankin's constant is an important lattice constant which has applications in many fields including cryptography and communications. In spite of its importance, few of exact values of Rankin's constant are known. In this paper, we develop a lower bound on Rankin's constant </span><span><math><msub><mrow><mi>γ</mi></mrow><mrow><mn>2</mn><mi>k</mi><mo>,</mo><mi>k</mi></mrow></msub></math></span> which corresponds to the <em>half volume problem</em>. Compared with the previous best lower bound developed by Wen et al., ours is more than <span><math><mfrac><mrow><msqrt><mrow><mi>k</mi></mrow></msqrt></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> times better. This improved lower bound on Rankin's constant directly leads to a sharper lower bound on Schnorr's constant and helps to better understand the intrinsic limitations of the 2<em>k</em>-block-Rankin reduction.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"182 ","pages":"Article 106379"},"PeriodicalIF":0.7000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019023000224","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Rankin's constant is an important lattice constant which has applications in many fields including cryptography and communications. In spite of its importance, few of exact values of Rankin's constant are known. In this paper, we develop a lower bound on Rankin's constant γ2k,k which corresponds to the half volume problem. Compared with the previous best lower bound developed by Wen et al., ours is more than k2 times better. This improved lower bound on Rankin's constant directly leads to a sharper lower bound on Schnorr's constant and helps to better understand the intrinsic limitations of the 2k-block-Rankin reduction.

Rankin常数的一个更尖锐的下界
兰金常数是一个重要的格常数,在密码学和通信等领域有着广泛的应用。尽管兰金常数很重要,但它的确切值却鲜为人知。本文给出了与半体积问题相对应的Rankin常数γ2k,k的下界。与Wen等人提出的最优下界相比,我们的最优下界提高了k2倍以上。Rankin常数的这个改进的下界直接导致Schnorr常数的一个更尖锐的下界,并有助于更好地理解2k块Rankin约简的内在局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing Letters
Information Processing Letters 工程技术-计算机:信息系统
CiteScore
1.80
自引率
0.00%
发文量
70
审稿时长
7.3 months
期刊介绍: Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.
×
引用
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学术官方微信