• DocumentCode
    2592149
  • Title

    A matrix formulation for NTRU cryptosystem

  • Author

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

  • Author_Institution
    Dept. of Comput. Applic., Regency Inst. of Technol., Yanam, India
  • fYear
    2008
  • fDate
    12-14 Dec. 2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In many business sectors sending secure information over public channels has become a challenging task. Data encryption is not the most efficient method to counteract attacks by adversaries. One form of encryption is to use the same key by the sender for encryption as well as the receiver for decryption. World-wide encryption standards such as DES and AES are used in Government and public domains. However symmetric key encryptions are prone to attacks by intruders. Asymmetric key encryption has been proposed in the literature wherein the key to be used to send a message to A is made public and A uses his own private key to decrypt the message. NTRU [23] Labs have used truncated polynomials to generate public and private keys. In this paper we propose matrices as an alternative to truncated polynomials.
  • Keywords
    matrix algebra; private key cryptography; public key cryptography; NTRU cryptosystem; asymmetric key encryption; business sectors; data encryption; matrix formulation; message decryption; private key generation; public channels; public key generation; secure information; symmetric key encryption; Algebra; Arithmetic; Business; Computer applications; Equations; Government; Identity-based encryption; Polynomials; Public key; Public key cryptography; Decryption; Encryption; Modular Operation; NTRU; Private Key; Public Key;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networks, 2008. ICON 2008. 16th IEEE International Conference on
  • Conference_Location
    New Delhi
  • ISSN
    1556-6463
  • Print_ISBN
    978-1-4244-3805-1
  • Type

    conf

  • DOI
    10.1109/ICON.2008.4772602
  • Filename
    4772602