Many of the public key cryptosystems deal with two-party communication keeping confidentiality and authentication as primary goals. However there are many applications like banking that require multi-party communication. In bank, we keep valuable articles in lockers. We need two dependent keys to open the locker. In corporate sector it may be thought of as multi-party communication. RSA provided multi-party communication using shared key approach. But the overhead of RSA seem to be more because it has to choose n pairs of numbers such that the summation of these numbers is a large prime number. This needs to be done without revealing the shares of the numbers [1, 2].

1. C.Cocks, “Split Knowledge Generation Of RSA Parameters, Cryptography and Coding” 6 Th IMA Conference, Lecture Notes In Computer Science Style, Vol 1423, pp 237- 251,Springer Verlag, New York, 1997.
2. Boneh.D., Franklin M., “ Efficient Generation of shared RSA keys “ in proceedings of Crypto - 97, 1997, pp 425 – 439.
3. J. Hoffstein, D. Lieman, J. Silverman“ Polynomial Rings and Efficient Public Key Authentication”, Proceeding of the International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC '99), M. Blum and C.H. Lee, eds., City University of Hong Kong Press,1999.
4. Rakesh Nayak, C.V.Sastry, Jayaram Pradhan, “A matrix formulation for NTRU cryptosystem.” Proceedings 16th IEEE, International Conference on Networks (ICON-2008), New Delhi, from date 12th-14th Dec’08.
5. Rakesh Nayak, C.V.Sastry, Jayaram Pradhan, “An algorithmic Comparison between polynomial base and Matrix based NTRU cryptosystem”,International Journal of Computer and Network Security(IJCNS) Vol.2, No.7,July 2010.
6. Rakesh Nayak, C.V.Sastry, Jayaram Pradhan, “NTRU Digital Signature Scheme - A Matrix Approach.”, International Journal of Advanced Research in Computer Science (IJARCS) Volume II issue I,Feb. 2011.
7. Joffrey Hoffstein, Joseph H Silverman “Optimizations for NTRU”Proceedings of conference on Public key Cryptography and Computational number theory, Warsaw, De Gruyter ,2000 (Sep 11-15), 77-88.
8. NTRU Cryptosystem, Technical Reports 2002 available at http://www.ntru.comWikipedia , the free encyclopedia “ NTRU Cryptosystems Inc.,”
9. Gills Brassard & Paul Bratley “Fundamentals of Algorithm”,PHI,1996.
10. E.Horowitz, S.Sahani & S.Rajasekharan “Fundamental of Computer Algorithm”,Galgotia,1998.
11. User Manual of “Mathematica 5.1”.

Encryption Polynomial Matrix