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

An NTRU-like Message Recoverable Signature Algorithm

Author

Listed:
  • Tingle Shen

    (School of Information Engineering, Ningxia University, Yinchuan 750021, China)

  • Li Miao

    (School of Information Engineering, Ningxia University, Yinchuan 750021, China)

  • Bin Hua

    (School of Information Engineering, Ningxia University, Yinchuan 750021, China)

  • Shuai Li

    (School of Information Engineering, Ningxia University, Yinchuan 750021, China)

Abstract

An important feature of Nyberg-Rueppel type digital signature algorithms is message recovery, this signature algorithm can recover the original information from the signature directly by the verifier in the verification phase after signing the message. However, this algorithm is currently vulnerable to quantum attacks and its security cannot be guaranteed. Number Theory Research Unit (NTRU) is an efficient public-key cryptosystem and is considered to be one of the best quantum-resistant encryption schemes. This paper proposes an NTRU-like message recoverable signature algorithm to meet the key agreement requirements in the post-quantum world. This algorithm, designed for the Internet of Things (IoT), constructs a secure system using the Group-Based Message Recoverable Signature Algorithm (NR-GTRU), by integrating a Group-Based NTRU-Like Public-Key Cryptosystem (GTRU) with an efficient Nyberg-Rueppel type of NTRU digital signature algorithm (NR-NTRU). This signature algorithm, resistant to quantum algorithm attacks, offers higher security at the cost of a slight efficiency reduction compared to traditional NTRU signature algorithms, and features Nyberg-Rueppel message recovery, making it well-suited for IoT applications.

Suggested Citation

  • Tingle Shen & Li Miao & Bin Hua & Shuai Li, 2024. "An NTRU-like Message Recoverable Signature Algorithm," Mathematics, MDPI, vol. 12(13), pages 1-17, June.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2051-:d:1426478
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/13/2051/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/13/2051/
    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:12:y:2024:i:13:p:2051-:d:1426478. 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.