On Some Computational Problems in Local Fields  

作　　者：DENG Yingpu LUO Lixia PAN Yanbin XIAO Guanju 

机构地区：[1]Key Laboratory of Mathematics Mechanization,NCMIS,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China [2]School of Mathematical Sciences,University of Chinese Academy of Sciences,Beijing 100049,China

出　　处：《Journal of Systems Science & Complexity》2022年第3期1191-1200,共10页系统科学与复杂性学报（英文版）

基　　金：supported by the National Key Research and Development Project under Grant No.2018YFA0704705。

摘　　要：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.

关 键 词：CVP LATTICE LVP local field SVP 

分 类 号：O156.3[理学—数学]