典型文献
On Some Computational Problems in Local Fields
文献摘要：
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.
文献关键词：
中图分类号：
作者姓名：
DENG Yingpu;LUO Lixia;PAN Yanbin;XIAO Guanju
作者机构：
Key Laboratory of Mathematics Mechanization,NCMIS,Academy of Mathematics and Systems Science,Chi-nese Academy of Sciences,Beijing 100190,China;School of Mathematical Sciences,University of Chinese Academy of Sciences,Beijing 100049,China
文献出处：
引用格式：
[1]DENG Yingpu;LUO Lixia;PAN Yanbin;XIAO Guanju-.On Some Computational Problems in Local Fields)[J].系统科学与复杂性学报（英文版）,2022(03):1191-1200
A类：
Lattices,cryptology,Longest
B类：
On,Some,Computational,Problems,Local,Fields,Euclidean,spaces,important,research,objects,geometric,number,theory,they,have,applications,many,areas,such,shortest,vector,SVP,closest,CVP,two,famous,computational,problems,about,lattices,In,this,paper,we,consider,adic,local,fields,define,analogues,authors,find,that,contrast,situation,different,interesting,corresponds,Vector,LVP,develop,relevant,algorithms,indicating,these,computable
AB值：
0.55896
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
