New NTRU Cryptosystem with Pauli Matrix

Authors

  • Priya Verma Department of Mathematics, Kalinga University, Raipur, Chhattisgarh, India Author
  • Swati Verma O.P. Jindal University, Raigarh, Chhattisgarh, India Author
  • G.V.V Jagannada Rao Department of Mathematics, Kalinga University, Raipur, Chhattisgarh, India Author

DOI:

https://doi.org/10.32628/IJSRST25122257

Keywords:

NTRU, Pauli Matrix, Encryption, Decryption

Abstract

The NTRU public key cryptosystem was first presented by J. Hoffstein,J. H. Silverman and J. Pipher in 1996. This system is based on shortest and closest vector problem in a lattice and its operations are based on objects of a truncated polynomial ring. In this paper, we have show that applying Pauli Matrix for the matrix formulation algorithm in NTRU public key cryptosystem substantially increases its efficiency as compared to other matrix formulation for NTRU cryptosystem with invertible matrix, such as Nayak et al. [8]. The Pauli Matrix facilitates the development and understanding of numerical algorithms.

Downloads

Download data is not yet available.

References

Brassard G. and Bratley P. “ Fundamentals of Algorithm", PHI, 1996.

Cohen H., “A Course in Computational Algebraic Number Theory",Springer-Verlag, Berlin, 1993.

Coppersmith and A. Shamir,” Lattice attacks on NTRU, in Proc. of EUROCRYPT 97", Lecture Notes in Computer Science, Springer-Verlag,1997.

Hoffstein J., Pipher J. and Silverman J.H., Silverman "Invertibility inTruncated Polynomial Rings", NTRU Cryptosystems, Technical Report No.9. Available at http://www.ntru.com, (1998).

Hoffstein J., Lieman D., Silverman J. Polynomial Rings and EfficientPublic Key Authentication", Proceeding of the International Workshopon Cryptographic Techniques and E-Commerce (CrypTEC 99), M.Blumand C.H.Lee, eds., City University of Hong Kong Press, 1999.

Horowitz E., Sahani S., and Rajasekharan S. “Fundamental of computer algorithm", Galgotia, 1998.

J. Hoffstein, J. Pipher and J. H. Silverman, “NTRU: A Ring-Based Public Key Cryptosystem". Algorithmic Number Theory (ANTS III), Springer- Verlag, 1998, pp. 267 288.

Nayak R., Sastry C. V., and Pradhan J. “A Matrix Formulation for NTRU Cryptosystems", Proc. 16th IEEE International conference on Network(ICON-2008), New Delhi, India, pp. 12-14, 2008.

Roja P. P., Avadhani P. S. and Prasand E. V. “An Efficient Method of Shared Key Generation Based on Truncated Polynomials", IJCSNS International Journal of Computer Science and Network Security, VOL.6 No. 8B, pp. 156-161, 2006.

Silverman J. H., “NTRU": A Ring Based Public Key Cryptosystem, In Proc. Of ANTS III, volume 1423 of LNCS.Springer-Verlag, Available athttp://www.ntru.com, pp. 267-288, 2001.

Wells A. L., “A polynomial form for logarithms modulo a prime", IEEE Transactions on Information Theory, pp. 845-846, 1984.

Downloads

Published

28-03-2025

Issue

Section

Research Articles

How to Cite

[1]
Priya Verma, Swati Verma, and G.V.V Jagannada Rao , Trans., “New NTRU Cryptosystem with Pauli Matrix”, Int J Sci Res Sci & Technol, vol. 12, no. 2, pp. 446–449, Mar. 2025, doi: 10.32628/IJSRST25122257.