Author:
Ragunathan M.,Kathirvalavakumar T.,Prasath Rajendra
Publisher
Springer International Publishing
Reference10 articles.
1. Alphonse, P.J.A., Venkatramana Reddy, Y.: Scalable and secure group key agreement for wireless ad-hoc networks by extending RSA scheme. Concurrency Comput. Pract. Experience 31(14), e4969 (2018). https://doi.org/10.1002/cpe.4969
2. Gao, S., Hoeiji, M.V., Kaltofen, E., Shoup, V.: The Computational complexity of polynomial factorization. American institute of Mathematic, 364, 1–5, Palo Alto, California (2006)
3. Guo, H., Zheng, Y., Li, X., Li, Z., Xia, C.: Self healing group key distribution protocol in wireless sensor networks for secure IoT communications. Future Gener. Comput. Syst. 89, 713–721 (2018)
4. Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson course Technology, Boston (2006)
5. Roche, D.S., Space- and time- efficient polynomial multiplication. In: ACM International Symposium and Algebraic Computation, pp. 28–31. ACM, Seoul Republic of Korea (2009)