Abstract
Lattices in Euclidean spaces are important research objects in geometric number theory, and they have important applications in many areas, such as cryptology. The shortest vector problem (SVP) and the closest vector problem (CVP) are two famous computational problems about lattices. In this paper, we consider p-adic lattices in local fields, and define the p-adic analogues of SVP and CVP in local fields. The authors find that, in contrast with lattices in Euclidean spaces, the situation is different and interesting. The SVP in Euclidean spaces corresponds to the Longest Vector Problem (LVP) in local fields. The authors develop relevant algorithms, indicating that these problems are computable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fröhlich A and Taylor M J, Algebraic Number Theory, Cambridge University Press, Cambridge, 1991.
Siegel C L, Lectures on the Geometry of Numbers, Springer, New York, 1989.
Micciancio D and Goldwasser S, Complexity of Lattice Problems, A Cryptographic Perspective, Kluwer, Boston, 2002.
Eisenträger K, Hallgren S, Lauter K, et al., Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions, Eds. by Nielsen J B and Rijmen V, EUROCRYPT 2018, LNCS 10822, 2018, 329–368.
Kohel D, Endomorphism rings of elliptic curves over finite fields, Ph.D. thesis, University of California, Berkeley, 1996.
Koblitz N, p-adic Numbers, p-adic Analysis, and Zeta-Functions, Second edition, Springer, New York, 1984.
Cassels J W S, Local Fields, Cambridge University Press, Cambridge, 1986.
Serre J P, Local Fields, Springer, New York, 1979.
Narkiewicz W, Elementary and Analytic Theory of Algebraic Numbers, Third Edition, Springer, New York, 2004.
Weil A, Basic Number Theory, Third Edition, Springer, New York, 1974.
Inoue H and Naito K, The shortest vector problems in p-adic approximation lattices and their applications to cryptography, Proceedings of Kyoto University Institute of Mathematics and Physical Sciences, 2015, 1963: 16–23.
Author information
Authors and Affiliations
Corresponding authors
Additional information
This research was supported by the National Key Research and Development Project under Grant No. 2018YFA0704705.
This paper was recommended for publication by Editor MANUEL Kauers.
Rights and permissions
About this article
Cite this article
Deng, Y., Luo, L., Pan, Y. et al. On Some Computational Problems in Local Fields. J Syst Sci Complex 35, 1191–1200 (2022). https://doi.org/10.1007/s11424-021-0074-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-021-0074-8