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全过程图解[总论]
亚洲云-浙江高防BGP.提供自助防火墙高防各种offer高防BGP！
亚洲云Asiayun怎么样？亚洲云Asiayun好不好？亚洲云成立于2021年，隶属于上海玥悠悠云计算有限公司（Yyyisp），是一家新国人IDC商家，且正规持证IDC/ISP/CDN，商家主要提供数据中心基础服务、互联网业务解决方案，及专属服务器租用、云服务器、云虚拟主机、专属服务器托管、带宽租用等产品和服务。Asiayun提供源自大陆、香港、韩国和美国等地骨干级机房优质资源，包括B...
CYUN(29元/月)美国、香港、台湾、日本、韩国CN2,续费原价
关于CYUN商家在之前有介绍过一次，CYUN是香港蓝米数据有限公司旗下的云计算服务品牌，和蓝米云、蓝米主机等同属该公司。商家主要是为个人开发者用户、中小型、大型企业用户提供一站式核心网络云端部署服务，促使用户云端部署化简为零，轻松快捷运用云计算。目前，CYUN主要运营美国、香港、台湾、日本、韩国CN2线路产品，包括云服务器、站群服务器和独立服务器等。这次看到CYUN夏季优惠活动发布了，依然是熟悉的...
Boomer.Host(年付3.5美)休斯敦便宜VPS
Boomer.Host是一家比较新的国外主机商，虽然LEB自述 we’re now more than 2 year old，商家提供虚拟主机和VPS，其中VPS主机基于OpenVZ架构，数据中心为美国得克萨斯州休斯敦。目前，商家在LET发了两款特别促销套餐，年付最低3.5美元起，特别提醒：低价低配，且必须年付，请务必自行斟酌确定需求再入手。下面列出几款促销套餐的配置信息。CPU：1core内存：...
ubuntu12.10为你推荐
-
8080端口如何关闭8080端口brandoff国际大牌包包都有哪些呐？johncusack约翰·库萨克好看的的恐怖片全集广东GDP破10万亿想知道广东城市的GDP排名百度关键词价格查询百度关键词排名价格是多少冯媛甑尸城女主角叫什么名字百度关键词分析百度关键字分析是什么意思？ip在线查询我要用eclipse做个ip在线查询功能，用QQwry数据库，可是我不知道怎么把这个数据库放到我的程序里面去，高手帮忙指点下，小弟在这谢谢了m.2828dy.combabady为啥打不开了，大家帮我提供几个看电影的网址www.585ccc.com手机ccc认证查询,求网址