IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i14p1618-d591055.html
   My bibliography  Save this article

Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography

Author

Listed:
  • Hami Satılmış

    (Department of Computer Engineering, Ondokuz Mayıs University, Samsun 55200, Turkey)

  • Sedat Akleylek

    (Department of Computer Engineering, Ondokuz Mayıs University, Samsun 55200, Turkey)

  • Cheng-Chi Lee

    (Department of Library and Information Science, Research and Development Center for Physical Education, Health, and Information Technology, Fu Jen Catholic University, New Taipei City 242, Taiwan
    Department of Photonics and Communication Engineering and Department of Computer Science and Information Engineering, Asia University, Taichung 413, Taiwan)

Abstract

The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ have been proposed to solve these hard problems. Several implementations of these algorithms have been developed. On the other hand, the implementations of these algorithms are expected to be efficient in terms of run time and memory space. In this paper, a modular software package/library containing efficient implementations of GaussSieve, ProGaussSieve, HashSieve, and BKZ algorithms is developed. These implementations are considered efficient in terms of run time. While constructing this software library, some modifications to the algorithms are made to increase the performance. Then, the run times of these implementations are compared with the others. According to the experimental results, the proposed GaussSieve, ProGaussSieve, and HashSieve implementations are at least 70%, 75%, and 49% more efficient than previous ones, respectively.

Suggested Citation

  • Hami Satılmış & Sedat Akleylek & Cheng-Chi Lee, 2021. "Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography," Mathematics, MDPI, vol. 9(14), pages 1-19, July.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:14:p:1618-:d:591055
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/14/1618/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/14/1618/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:14:p:1618-:d:591055. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.