3CVP Algorithm

3CVP Algorithm

ID:40022341

大小:74.01 KB

页数:4页

时间:2019-07-17

3CVP Algorithm_第1页
3CVP Algorithm_第2页
3CVP Algorithm_第3页
3CVP Algorithm_第4页
资源描述:

《3CVP Algorithm》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TelAvivUniversity,Fall2004Lecture3Lecturer:OdedRegevLatticesinComputerScienceCVPAlgorithmScribe:EyalKaplanInthislecture,wedescribeanapproximationalgorithmtotheClosestVectorProblem(CVP).Thisalgorithm,knownastheNearestPlaneAlgorithm,wasdevelopedbyL.Babaiin1986.It2n

2、obtainsa2(p)approximationratio,wherenistherankofthelattice.Inmanyapplications,this3algorithmisappliedforaconstantn;insuchcases,weobtainaconstantapproximationfactor.Onecandefineapproximate-CVPasasearchproblem,asanoptimizationproblem,orasadecisionproblem(wherethelat

3、terisoftenknownasagapproblem).Inthefollowingdefinitions,°¸1istheapproximationfactor.Bysetting°=1weobtaintheexactversionoftheproblems.DEFINITION1(CVP°,SEARCH)GivenabasisB2Zm£nandapointt2Zm,findapointx2L(B)suchthat8y2L(B);kx¡tk·°ky¡tk.DEFINITION2(CVP°,OPTIMIZATION)Gi

4、venabasisB2Zm£nandapointt2Zm,findr2Qsuchthatdist(t;L(B))·r·°¢dist(t;L(B)).DEFINITION3(CVP°,DECISION)GivenabasisB2Zm£n,apointt2Zmandr2Q,decideifdist(t;L(B))·rordist(t;L(B))>°¢r.2nBabai’snearestplanealgorithmsolvesthesearchvariantofCVP°for°=2(p).Itiseasy3toseethatth

5、isimpliesasolutiontotheothertwovariantsofCVP°astheyarenotharderthanthensearchversion.Forsimplicity,thealgorithmwepresenthereachieves°=22.Itispossibleto2nachieve°=2(p)byastraightforwardmodificationoftheparameters.31TheNearestPlaneAlgorithmThealgorithmhastwomainstep

6、s.First,itappliestheLLLreductiontotheinputlattice.Itthenlooksforanintegercombinationofthebasisvectorsthatisclosetothetargetvectort.ThisstepisessentiallythesameasoneinnerloopinthereductionstepoftheLLLalgorithm.INPUT:BasisB2Zm£n,t2ZmnOUTPUT:Avectorx2L(B)suchthatkx¡

7、tk·22dist(t;L(B))1.Run±-LLLonBwith±=342.bÃtforj=nto1dobÃb¡cjbjwherecj=dhb;~bji=h~bj;~bjicOutputt¡bItcanbeseenthatthisalgorithmrunsinpolynomialtimeintheinputsize;indeed,theLLLprocedurerunsinpolynomialtimeandthereductionstepwasalreadyanalyzedinthepreviousclass.Noti

8、cethatunlikeourdescriptionoftheLLLalgorithm,hereweconsiderthealgorithmforarbitrarylatticesthatarenotnecessarilyfull-rank.Thiswill,infact,makeouranalysisslightl

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。