Secure message authentication system for node to node network

14th International Conference on Science, Engineering and Technology

自然科学;工业技术

Sindhu, R.^1 ; Vanitha, M.M.^1 ; Norman, J.^1

School of Information Technology and Engineering, VIT University, Vellore

Tamil Nadu

632014, India^1

关键词: Elliptic curve cryptography;    Modeling effects;    Polynomial approach;    Privacy points;    Public key cryptosystems;    Secure messages;    Symmetric key cryptography;    Verification systems;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/263/4/042025/pdf
DOI  :  10.1088/1757-899X/263/4/042025

来源: IOP

【 摘 要 】

The Message verification remains some of the best actual methods for prevent the illegal and dis honored communication after presence progressed to WSNs (Wireless Sensor Networks). Intend for this purpose, several message verification systems must stand established, created on both symmetric key cryptography otherwise public key cryptosystems. Best of them will have some limits for great computational then statement above in count of deficiency of climb ability then flexibility in node settlement occurrence. In a polynomial based system was newly presented for these problems. Though, this system then situations delay will must the dimness of integral limitation firm in the point of polynomial: once the amount of message transferred remains the greater than the limitation then the opponent will completely improve the polynomial approaches. This paper suggests using ECC (Elliptic Curve Cryptography). Though using the node verification the technique in this paper permits some nodes to transfer a limitless amount of messages lacking misery in the limit problem. This system will have the message cause secrecy. Equally theoretic study then model effects show our planned system will be effective than the polynomial based method in positions of calculation then statement above in privacy points though message basis privacy.