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全过程图解[总论]
星梦云：四川100G高防4H4G10M月付仅60元
星梦云怎么样?星梦云资质齐全，IDC/ISP均有，从星梦云这边租的服务器均可以备案，属于一手资源，高防机柜、大带宽、高防IP业务，一手整C IP段，四川电信，星梦云专注四川高防服务器,成都服务器,雅安服务器。星梦云目前夏日云服务器促销,四川100G高防4H4G10M月付仅60元;西南高防月付特价活动，续费同价，买到就是赚到!点击进入：星梦云官方网站地址1、成都电信年中活动机(成都电信优化线路，封锁...
SpinServers（月89美元） 2*e5-2630L v2，美国独立服务器
SpinServers服务商也不算是老牌的服务商，商家看介绍是是2018年成立的主机品牌，隶属于Majestic Hosting Solutions LLC旗下。商家主要经营独立服务器租用和Hybrid Dedicated服务器等，目前包含的数据中心在美国达拉斯、圣何塞机房，自有硬件和IP资源等，商家还自定义支持用户IP广播到机房。看到SpinServers推出了美国独服的夏季优惠促销活动，最低月...
HTTPS加密协议端口默认是多少且是否支持更换端口访问
看到群里网友们在讨论由于不清楚的原因，有同学的网站无法访问。他的网站是没有用HTTPS的，直接访问他的HTTP是无法访问的，通过PING测试可以看到解析地址已经比较乱，应该是所谓的DNS污染。其中有网友提到采用HTTPS加密证书试试。因为HTTP和HTTPS走的不是一个端口，之前有网友这样测试过是可以缓解这样的问题。这样通过将网站绑定设置HTTPS之后，是可以打开的，看来网站的80端口出现问题，而...
ubuntu12.10为你推荐
-
淘宝门户淘宝电脑端登录首页今日油条油条每周最多能吃多少中老铁路老挝磨丁经济特区的前景如何？www.7160.com电影网站有那些陈嘉垣马德钟狼吻案事件是怎么回事ip在线查询通过对方的IP地址怎么样找到他的详细地址?广告法中国的广告法有哪些。www.cn12365.orgwww.12365china.net是可靠的网站吗？还是骗子拿出来忽悠人的dpscycleDPScycle插件为什么没有猎人模块 最好详细点朴容熙给我介绍几个韩国 ulzzang 最好是像柳惠珠那样的 不要出道的...