Application of automorphic forms to lattice problems

Author:

Düzlü Samed1,Krämer Juliane1

Affiliation:

1. Universität Regensburg , Regensburg , Germany

Abstract

Abstract In this article, we propose a new approach to the study of lattice problems used in cryptography. We specifically focus on module lattices of a fixed rank over some number field. An essential question is the hardness of certain computational problems on such module lattices, as the additional structure may allow exploitation. The fundamental insight is the fact that the collection of those lattices are quotients of algebraic manifolds by arithmetic subgroups. Functions in these spaces are studied in mathematics as part of the number theory. In particular, those form a module over the Hecke algebra associated with the general linear group. We use results on these function spaces to define a class of distributions on the space of lattices. Using the Hecke algebra, we define Hecke operators associated with collections of prime ideals of the number field and show a criterion on distributions to converge to the uniform distribution, if the Hecke operators are applied to the chosen distribution. Our approach is motivated by the work of de Boer, Ducas, Pellet-Mary, and Wesolowski (CRYPTO’20) on self-reduction of ideal lattices via Arakelov divisors.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computer Science Applications

Reference52 articles.

1. Micciancio D. The shortest vector problem is NP-hard to approximate to within some constant. SIAM J Comput. 2001 Mar;30(6):2008–35. Preliminary version in FOCS 1998.

2. Micciancio D, Goldwasser S. Complexity of lattice problems. vol. 671 of The Kluwer International Series in Engineering and Computer Science. Boston, MA: Kluwer Academic Publishers; 2002. A cryptographic perspective. 10.1007/978-1-4615-0897-7.

3. Bos J, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, et al. CRYSTALS - Kyber: A CCA-Secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS P). 2018. p. 353–67.

4. Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schwabe P, Seiler G, et al. CRYSTALS-Dilithium: A lattice-based digital signature scheme. IACR TCHES. 2018;2018(1):238–68. https://tches.iacr.org/index.php/TCHES/article/view/839.

5. Prest T, Fouque PA, Hoffstein J, Kirchner P, Lyubashevsky V, Pornin T, et al. FALCON. National Institute of Standards and Technology; 2020. Available at https://csrc.nist.gov/projects/post-quantum-cryptography/round-3-submissions.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3