نتایج جستجو برای: svp
تعداد نتایج: 532 فیلتر نتایج به سال:
Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) arguably most important problem cryptanalysis lattice-based cryptography, and many schemes have security claims based on its hardness. best quantum algorithm SVP due to Laarhoven [] runs in (heuristic) time \(2^{0.2653d + o(d)}\). In this article, we present an improvement...
Saougkos Dimitrios. PhD Candidate, Computer Science Department, University of Ioannina, Greece. Graduation Month, Graduation Year. “Mapping Loop-Based Programs onto a Multithreaded Processor”. Thesis Supervisor: Manis George. This thesis offers some insight into the automatic parallelization of loops by introducing and describing a source-to-source parallelizing compiler developed from scratch ...
To harness the potential of CMPs for scalable, energy-efficient performance in general-purpose computers, the Apple-CORE project has co-designed a general machine model and concurrency control interface with dedicated hardware support for concurrency management across multiple cores. Its SVP interface combines dataflow synchronisation with imperative programming, towards the efficient use of pa...
Above we have used the fact that dist(t,L) = minv∈L‖t − v‖ = minx∈t+L‖x‖, because L = −L. The two versions of CVP are equivalent by associating each v ∈ L with t − v ∈ t + L, and vice versa. Although the former version of the problem is the more “obvious” formulation, the latter version is often more convenient in algorithmic settings, so we will use it throughout these notes. We first show tha...
We report a detailed dynamics study on the mode-specificity of Cl + C2H6 → HCl C2H5 H-abstraction reaction. perform quasi-classical trajectory simulations using recently developed high-level ab initio full-dimensional potential energy surface by exciting five different vibrational modes ethane at four collision energies. find that all studied excitations, except CC-stretching mode, clearly prom...
nesse período peculiar de pandemia do coronavírus, o objetivo presente estudo é replicar parcialmente um experimento “priming” e comunicação sobre a satisfação com vida publicado em 1988. Para isso, uma amostra 591 indivíduos foi subdividida aleatoriamente três grupos: “priming”, conversacional controle, aos quais foram feitas duas perguntas sequenciais avaliativas: lazer geral vida. Os grupos ...
The bounded distance decoding (BDD) is a fundamental problem in lattice-based cryptography which derived from the closest vector (CVP). In this paper, we adapt lattice enumeration with discrete pruning, burgeoning method for shortest (SVP), to solve BDD various cryptanalysis scenarios using direct method. We first transfer basic definition involved pruning technique SVP CVP, prove corresponding...
In this paper, the peak migration line of cross-correlation output is utilized to discriminate depth an underwater acoustic source in shallow water environment with a negative thermocline through studying modal arrival structure at different depths. The discrimination can be done according position when delay zero since type dominant normal mode determined by source. Firstly, using beam vertica...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید