NTRU Digital Signature Scheme - A Matrix Approach

Rakesh Nayak, Dr. Jayaram Pradhan, C.V.Sastry


Procedures used for digital signature development rely on the algorithms provided for data confidentiality. The decryption algorithms
used for data confidentiality are generally inverse of the encryption algorithms and hence can be used for authentication purposes. Existing
Algorithms based on truncated polynomials offer many advantages compared to RSA. At the same time these truncated polynomial algorithms
suffer from the drawback that the encryption and decryption algorithms are not inverses of each other as in the case of RSA, and hence require
separate computation for generation of digital signature.
In this paper we propose an algorithm based on matrix approach of NTRU[3] that combines the advantages of both RSA and the algorithms
based on truncated polynomials and at the same time overcoming the difficulties faced in each. This proposed algorithm does not require either
large prime number to be generated or extra computational effort for digital signature generation.


Keywords: Encryption, Decryption, Digital Signature, Message Digest

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v2i1.255


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science