Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 130–131 (Mi pdma118)  

Computational methods in discrete mathematics

Implementation of the parallel shortest vector enumeration in the block Korkin–Zolotarev method

V. S. Usatyuk

Bratsk State University
References:
Abstract: A parallel CPU implementation of Kannan algorithm is presented for solving shortest vector problem in block Korkin–Zolotarev lattice reduction method. The implementation is based on Native POSIX Thread Library and shows the linear decrease of runtime with the number of threads.
Keywords: shortest vector problem, SVP, block Korkin–Zolotarev, BKZ, lattices, parallel algorithms.
Document Type: Article
UDC: 511.9
Language: Russian
Citation: V. S. Usatyuk, “Implementation of the parallel shortest vector enumeration in the block Korkin–Zolotarev method”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 130–131
Citation in format AMSBIB
\Bibitem{Usa13}
\by V.~S.~Usatyuk
\paper Implementation of the parallel shortest vector enumeration in the block Korkin--Zolotarev method
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 130--131
\mathnet{http://mi.mathnet.ru/pdma118}
Linking options:
  • https://www.mathnet.ru/eng/pdma118
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p130
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025