期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN:2347-6710
电子版ISSN:2319-8753
出版年度:2016
卷号:5
期号:12
页码:20488
DOI:10.15680/IJIRSET.2016.0512035
出版社:S&S Publications
摘要:The encryption and decryption algorithms for secure communication using truncated polynomials havebecome a research interest for many researchers due to their fact that they are easily implementable. In this paperencryption and decryption algorithms based on polynomials are presented. The coefficients of polynomials used inthese algorithms need to satisfy some specific conditions. Hence it is required to find the coefficients of the polynomialfrom a given set of points. Two efficient algorithms, one recursive and one non-recursive, are presented for generatingthe coefficients using Lagrangian interpolation.