pairwiseubuntu12.10
ubuntu12.10 时间:2021-04-01 阅读:()
ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithm:SolvingtheIdealLatticeChallengeof128dimensionsTsukasaIshiguro1ShinsakuKiyomoto1YutakaMiyake1TsuyoshiTakagi2KDDIR&DLaboratoriesInc.
1InstituteofMathematicsforIndustry,KyushuUniversity22014/3/281/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentBackgroundSomecontestsfromTUDarmstadt-SVPChallenge,IdealLatticeChallenge,LatticeChallenge2/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentBackgroundSomecontestsfromTUDarmstadt-SVPChallenge,IdealLatticeChallenge,LatticeChallengeOurcontributions·AparallelversionofanalgorithmforsolvingSVP·Improvementsusingidealstructures·Solvingthe128dimensionalSVPoverideallattice2/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentndimensionallatticeandSVPb1b2ShortestvectorsLatticebasisB=(b1,bn)∈Zn*n,bi∈ZnLatticeL(B)=1≤i≤nαibi,αi∈Z(Euclidean)normofv=(v1,.
.
,vn)||v||=1≤i≤nv2iDenition(ShortestVectorProblem(SVP))GivenalatticeL(B),ndashortestnon-zerovectorinL(B).
3/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentndimensionalideallatticevrot(v)rot2(v)Polynomialrepresentationv=(v1,vn)∈L(B)v(x)=1≤i≤nvixi1∈Z[x]Vectorrotationrot(v)=xv(x)modg(x)g(x):monic,deg(g(x))=nIfrot(v)∈L(B)forallv∈L(B),thentheL(B)iscalledideallattice4/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGauss-reducedDenition(Gauss-reduced)Iftwodifferentvectorsa,b∈L(B)satisfy||a±b||≥max(||a||,||b||),thena,barecalledGauss-reduced.
abb′=ababa+bbaab′a+b′Reducea,barenotGauss-reduced.
a,b′areGauss-reduced.
Wesaythatb(orb′)wasreducedbya.
5/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentPairwise-reducedDenition(Pairwise-reduced)LetAbeasetofdvectorsinL(B).
Ifeverypairoftwovectors(ai,aj)inAfori,j=1,d,ijisGauss-reduced,thentheAiscalledpairwise-reduced.
AnypairofvectorsareGauss-reducedSetofvectors6/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(1)chosenatrandomorpoppedfromstackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(2)checkandreducev(3)ifvwasreduced,movevintostackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(4)checkandreducei(5)ifiwasreduced,moveiintostackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(6)appendvtoL7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reducedGaussSievealgorithmconstructsabiglistLoflatticevectors,whichisalwayspairwise-reduced.
Finally,ashortestvectorappearedinthelistL.
7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithm8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithmOurgoalWeproposeafullyparallelizedGaussSievealgorithm.
8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithmOurgoalWeproposeafullyparallelizedGaussSievealgorithm.
OurstrategyOuralgorithmalwayskeepsthelistLpairwise-reducedwithoutreferencetothenumberofthreads.
8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(1)chooseatrandomorpoppedfromstackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(2)checkandreducevi(3)ifviwasreduced,moveviintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(4)checkandreducevi(5)ifviwasreduced,moveviintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(6)checkandreducei(7)ifiwasreduced,moveiintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(8)appendvitoLv4v3v2v19/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentIsanewLpairwise-reducedListL12345ListVv4v3v2v1·LandVarepairwise-reduced,respectivery·Allpairs(i,vj)areGauss-reduced→V∪Lispairwise-reducedanewL=ListV∪L12345v4v3v2v1+10/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingthe72dimensionalSVP02004006008001000120048121620242832Time(minutes)ThenumberofthreadsTotaltime·Thisinstancehas16cores·Therunningtimedereasesuntil16threads·ThesizesofthelistLaremostofthesame11/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentListoftheimprovementsofGaussSieveGenericimprovements-Samplingshortvectors·Reductionoflengthsofsamplingvectors→about5timesfaster-Improvementofimplementation·UsingSIMDoperations→n=80,96,128→about4timesfastersSpecicimprovements-IdealGaussSieveforn=2α(Anti-cycliclattice)[Schneider,'11]→n=128-Trinomiallatticeforn=2s3t·Inverserotationrot1(v)=x1v(x)modg(x)·Updatingtoshortvectors→n=96→morethan25timesfaster12/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentExperimentenvironmentAmazonEC2cc1.
8xlargeinstanceOS:Ubuntu12.
10IntelXeonE5-2670(2.
6Ghz),total16coresgsievelibrary[Voulgaris]compiler:g++4.
1.
2,OpenMP,OpenMPIImprovementofimplementationOurassumptions-Allabsolutevaluesofnormsofvectorsarelessthan216-CalculatingtimeofinnerproductismostexpensiveWeoptimizedinnerproductbyusingSIMDoperations-8-parallelizationof16-bitadditionandmultiplication(SSE4.
2)→about4timesfaster13/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingtheChallengesSVPChallengedimnCPUhours#instances#threadstype800.
9132Randomlattice962004128RandomlatticeIdealLatticeChallengedimnCPUhours#instances#threadstype800.
9132Ideallattice968132Trinomiallattice12829,994842,688Anti-cycliclatticeOriginalgsievelibraryrequiresabout1weekforsolvinga80dimensionalSVPTrinomiallattice:25timesfaster14/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentConclusionWeproposedaparallelversionoftheGaussSievealgorithmWefoundthenewconditionstospeeduptheGaussSievealgorithmWesolveda128dimensionalSVPoverideallattice,whichhadnotbeensolvedbeforeThefull-versionispublishedin[ePrint2013/388]Openproblems-HowisthetheoreticalcomplexityoftheGaussSieve,theParallelGaussSieve,andtheIdealGaussSieve-DoesthereexistotherconditionsortechniquestospeeduptheGaussSievealgorithm15/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperiment16/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingthe80dimensionalSVP01000200030004000500001000020000300004000050000Runningtime(seconds)Thenumberofsamples$r$17/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSamplingshortvectorOptimizationofsamplingalgorithm,namelySampleDalgorithminKlein'srandomizedroundingalgorithm.
Wetrytoadjusttheparameterwhichdeterminesthetradeoffbetweenthelengthofthenormofsamplevectorsandtherunningtimeofouralgorithm.
Average:6.
24GHMaximum:10.
58GH→Average:1.
66GHMaximum:2.
07GHGHistheGaussianheuristicbound:GH=(1/√π)Γ(n2+1)1n·det(L(B))1n18/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentApplyingIdealGaussSieve[Schneider,ePrint2011/458]Anti-cycliclattice-n=2α,α∈N-Cyclotomicpolynomial:g(x)=xn+1Vectorrotationrot(v)=(vn,v1,vn1)||roti(v)||=||v||,(1≤i≤n)Itiseasytogenerate(n1)independentvectorsroti(v)ofsamelengthfromonevectorvListL1234ListL1234rot(1)rot(2)rot(3)rot(4)rotn1(1)rotn1(2)rotn1(3)rotn1(4)19/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentTrinomialLattice(1/2)Cyclotomicpolynomial:g(x)=xn±xn/2+1-(case1)n=2·3m,m>0-(case2)n=2s3t,s>1,t>0Vectorrotationrot(v)=(vn,v1,vn22,vn21vn1,vn2vn1)Differentialofnorm||rot(v)||||v||=(vn1)22vn21vn1→If(vn1)22vn21vn1<0,normofalatticevectordecreases.
20/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentTrinomialLattice(2/2)Improvement3-1:Inverserotation-rot1(v)=x1v(x)modg(x)x1:inverseofxmodulog(x)Improvement3-2:Vectorupdate-choosingtheshortestvectorinfollowingvectorsrot(v),rot2(v)rotk(v)rot1(v),rot2(v)rotk(v)Solvingthe72dimensionalSVP4080120160200240048121620Runningtime(seconds)Onlyrotation[22]InverserotationInverserotation+Updatingvector21/15
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithm:SolvingtheIdealLatticeChallengeof128dimensionsTsukasaIshiguro1ShinsakuKiyomoto1YutakaMiyake1TsuyoshiTakagi2KDDIR&DLaboratoriesInc.
1InstituteofMathematicsforIndustry,KyushuUniversity22014/3/281/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentBackgroundSomecontestsfromTUDarmstadt-SVPChallenge,IdealLatticeChallenge,LatticeChallenge2/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentBackgroundSomecontestsfromTUDarmstadt-SVPChallenge,IdealLatticeChallenge,LatticeChallengeOurcontributions·AparallelversionofanalgorithmforsolvingSVP·Improvementsusingidealstructures·Solvingthe128dimensionalSVPoverideallattice2/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentndimensionallatticeandSVPb1b2ShortestvectorsLatticebasisB=(b1,bn)∈Zn*n,bi∈ZnLatticeL(B)=1≤i≤nαibi,αi∈Z(Euclidean)normofv=(v1,.
.
,vn)||v||=1≤i≤nv2iDenition(ShortestVectorProblem(SVP))GivenalatticeL(B),ndashortestnon-zerovectorinL(B).
3/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentndimensionalideallatticevrot(v)rot2(v)Polynomialrepresentationv=(v1,vn)∈L(B)v(x)=1≤i≤nvixi1∈Z[x]Vectorrotationrot(v)=xv(x)modg(x)g(x):monic,deg(g(x))=nIfrot(v)∈L(B)forallv∈L(B),thentheL(B)iscalledideallattice4/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGauss-reducedDenition(Gauss-reduced)Iftwodifferentvectorsa,b∈L(B)satisfy||a±b||≥max(||a||,||b||),thena,barecalledGauss-reduced.
abb′=ababa+bbaab′a+b′Reducea,barenotGauss-reduced.
a,b′areGauss-reduced.
Wesaythatb(orb′)wasreducedbya.
5/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentPairwise-reducedDenition(Pairwise-reduced)LetAbeasetofdvectorsinL(B).
Ifeverypairoftwovectors(ai,aj)inAfori,j=1,d,ijisGauss-reduced,thentheAiscalledpairwise-reduced.
AnypairofvectorsareGauss-reducedSetofvectors6/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(1)chosenatrandomorpoppedfromstackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(2)checkandreducev(3)ifvwasreduced,movevintostackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(4)checkandreducei(5)ifiwasreduced,moveiintostackS7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reduced(6)appendvtoL7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentGaussSieveAlgorithm[Micciancio,2009]ListLVectorvStackS12345Lisalwayspairwise-reducedGaussSievealgorithmconstructsabiglistLoflatticevectors,whichisalwayspairwise-reduced.
Finally,ashortestvectorappearedinthelistL.
7/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithm8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithmOurgoalWeproposeafullyparallelizedGaussSievealgorithm.
8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelizationTheGaussSievealgorithmisnoteasytobeparallelizedMildeandSchneiderproposedaparallelimplementationoftheGaussSieve[MildeandSchneider,'10]ThemalgorithmdoesnotkeepthelistLpairwise-reducedWhentheyused10threads,thelistLdoubledsizeoforiginalalgorithmOurgoalWeproposeafullyparallelizedGaussSievealgorithm.
OurstrategyOuralgorithmalwayskeepsthelistLpairwise-reducedwithoutreferencetothenumberofthreads.
8/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(1)chooseatrandomorpoppedfromstackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(2)checkandreducevi(3)ifviwasreduced,moveviintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(4)checkandreducevi(5)ifviwasreduced,moveviintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(6)checkandreducei(7)ifiwasreduced,moveiintostackS9/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentParallelGaussSieveAlgorithmListLStackS12345Lisalwayspairwise-reducedListVv4v3v2v1(8)appendvitoLv4v3v2v19/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentIsanewLpairwise-reducedListL12345ListVv4v3v2v1·LandVarepairwise-reduced,respectivery·Allpairs(i,vj)areGauss-reduced→V∪Lispairwise-reducedanewL=ListV∪L12345v4v3v2v1+10/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingthe72dimensionalSVP02004006008001000120048121620242832Time(minutes)ThenumberofthreadsTotaltime·Thisinstancehas16cores·Therunningtimedereasesuntil16threads·ThesizesofthelistLaremostofthesame11/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentListoftheimprovementsofGaussSieveGenericimprovements-Samplingshortvectors·Reductionoflengthsofsamplingvectors→about5timesfaster-Improvementofimplementation·UsingSIMDoperations→n=80,96,128→about4timesfastersSpecicimprovements-IdealGaussSieveforn=2α(Anti-cycliclattice)[Schneider,'11]→n=128-Trinomiallatticeforn=2s3t·Inverserotationrot1(v)=x1v(x)modg(x)·Updatingtoshortvectors→n=96→morethan25timesfaster12/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentExperimentenvironmentAmazonEC2cc1.
8xlargeinstanceOS:Ubuntu12.
10IntelXeonE5-2670(2.
6Ghz),total16coresgsievelibrary[Voulgaris]compiler:g++4.
1.
2,OpenMP,OpenMPIImprovementofimplementationOurassumptions-Allabsolutevaluesofnormsofvectorsarelessthan216-CalculatingtimeofinnerproductismostexpensiveWeoptimizedinnerproductbyusingSIMDoperations-8-parallelizationof16-bitadditionandmultiplication(SSE4.
2)→about4timesfaster13/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingtheChallengesSVPChallengedimnCPUhours#instances#threadstype800.
9132Randomlattice962004128RandomlatticeIdealLatticeChallengedimnCPUhours#instances#threadstype800.
9132Ideallattice968132Trinomiallattice12829,994842,688Anti-cycliclatticeOriginalgsievelibraryrequiresabout1weekforsolvinga80dimensionalSVPTrinomiallattice:25timesfaster14/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentConclusionWeproposedaparallelversionoftheGaussSievealgorithmWefoundthenewconditionstospeeduptheGaussSievealgorithmWesolveda128dimensionalSVPoverideallattice,whichhadnotbeensolvedbeforeThefull-versionispublishedin[ePrint2013/388]Openproblems-HowisthetheoreticalcomplexityoftheGaussSieve,theParallelGaussSieve,andtheIdealGaussSieve-DoesthereexistotherconditionsortechniquestospeeduptheGaussSievealgorithm15/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperiment16/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSolvingthe80dimensionalSVP01000200030004000500001000020000300004000050000Runningtime(seconds)Thenumberofsamples$r$17/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentSamplingshortvectorOptimizationofsamplingalgorithm,namelySampleDalgorithminKlein'srandomizedroundingalgorithm.
Wetrytoadjusttheparameterwhichdeterminesthetradeoffbetweenthelengthofthenormofsamplevectorsandtherunningtimeofouralgorithm.
Average:6.
24GHMaximum:10.
58GH→Average:1.
66GHMaximum:2.
07GHGHistheGaussianheuristicbound:GH=(1/√π)Γ(n2+1)1n·det(L(B))1n18/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentApplyingIdealGaussSieve[Schneider,ePrint2011/458]Anti-cycliclattice-n=2α,α∈N-Cyclotomicpolynomial:g(x)=xn+1Vectorrotationrot(v)=(vn,v1,vn1)||roti(v)||=||v||,(1≤i≤n)Itiseasytogenerate(n1)independentvectorsroti(v)ofsamelengthfromonevectorvListL1234ListL1234rot(1)rot(2)rot(3)rot(4)rotn1(1)rotn1(2)rotn1(3)rotn1(4)19/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentTrinomialLattice(1/2)Cyclotomicpolynomial:g(x)=xn±xn/2+1-(case1)n=2·3m,m>0-(case2)n=2s3t,s>1,t>0Vectorrotationrot(v)=(vn,v1,vn22,vn21vn1,vn2vn1)Differentialofnorm||rot(v)||||v||=(vn1)22vn21vn1→If(vn1)22vn21vn1<0,normofalatticevectordecreases.
20/15ParallelGaussSieveAlgorithmT.
Ishiguro,S.
Kiyomoto,Y.
Miyake,T.
TakagiOutlineBackgroundProposedAlgorithmImprovementsExperimentTrinomialLattice(2/2)Improvement3-1:Inverserotation-rot1(v)=x1v(x)modg(x)x1:inverseofxmodulog(x)Improvement3-2:Vectorupdate-choosingtheshortestvectorinfollowingvectorsrot(v),rot2(v)rotk(v)rot1(v),rot2(v)rotk(v)Solvingthe72dimensionalSVP4080120160200240048121620Runningtime(seconds)Onlyrotation[22]InverserotationInverserotation+Updatingvector21/15
- pairwiseubuntu12.10相关文档
- 矩阵ubuntu12.10
- 2019年铜陵学院机器人工程基础实验室
- 文件linux下安装hadoop完全分布式（ubuntu12.10）
- 分区Win7和ubuntu12.10双系统安装教程[方案]
- 文件Linux下安装Hadoop完全分布式（Ubuntu12.10）
- 安装u盘装置ubuntu12.10全过程图解[总论]
Spinservers美国圣何塞服务器$111/月流量10TB
Spinservers是Majestic Hosting Solutions，LLC旗下站点，主营美国独立服务器租用和Hybrid Dedicated等，数据中心位于美国德克萨斯州达拉斯和加利福尼亚圣何塞机房。TheServerStore.com，自 1994 年以来，它是一家成熟的企业 IT 设备供应商，专门从事二手服务器和工作站业务，在德克萨斯州拥有 40,000 平方英尺的仓库，库存中始终有...
ZJI-全场八折优惠，香港服务器 600元起，还有日本/美国/韩国服务器
ZJI怎么样？ZJI是一家成立于2011年的商家，原名维翔主机，主要从事独立服务器产品销售，目前主打中国香港、日本、美国独立服务器产品，是一个稳定、靠谱的老牌商家。详情如下：月付/年付优惠码：zji??下物理服务器/VDS/虚拟主机空间订单八折终身优惠（长期有效）一、ZJI官网点击直达香港葵湾特惠B型 CPU：E5-2650L核心：6核12线程内存：16GB硬盘：480GB SSD带宽：5Mbps...
LightNode(7.71美元),免认证高质量香港CN2 GIA
LightNode是一家位于香港的VPS服务商.提供基于KVM虚拟化技术的VPS.在提供全球常见节点的同时，还具备东南亚地区、中国香港等边缘节点.满足开发者建站，游戏应用，外贸电商等应用场景的需求。新用户注册充值就送，最高可获得20美元的奖励金！成为LightNode的注册用户后，还可以获得属于自己的邀请链接。通过你的邀请链接带来的注册用户，你将直接获得该用户的消费的10%返佣，永久有效！平台目前...
ubuntu12.10为你推荐
-
广东GDP破10万亿想知道广东城市的GDP排名access数据库access数据库主要学什么同ip网站查询同ip地址站点查询 我本地怎么查询不了百度关键词工具常见百度关键词挖掘方法分别是什么请列举？长尾关键词挖掘工具大家是怎么挖掘长尾关键词的？同一服务器网站同一服务器上的域名/网址无法访问haole012.com说在:012qq.com这个网站能免费挂ＱＱ，是真的吗？www.cn12365.org全国公民身份证号码查询服务中心(http://www.nciic.com.cn/)这个网站怎么查不了啊?官人放题《墨竹题图诗》 大意bihaiyinshaBailo 是什么意思？