文章基本信息

标题：A Scheme for Source Message Authentication
本地全文：下载
作者：Manasa K ; Lata S H
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2015
卷号：4
期号：4
页码：1516-1519
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Messages are transmitted over the network through motes. Message authentication is essential as the channel is not secure. It helps messages to travel all along the channel safely without the intervention of the obtruder. It ensures only intended sender should deliver the message to a particular receiver. Hop-by-hop authentication is very much necessary. If intermediate motes are authenticated, no problem of rectifying the whole message at the destination. There are several message authentication techniques like symmetric-key cryptography and public-key cryptography. Symmetric encryption is catagorized into block cipher and stream cipher. Security is not reliable in case of symmetric-key cryptosystem as the sender and receiver use the same key. To overcome this problem public-key cryptography is used. It uses two keys along with the signature. Security is reliable compared to symmetric encryption. It has huge calculations and transmission cost, scalability inadequacy as a drawback. To abode these argument, the polynomial evaluation based scheme came into existence. Here the degree of the polynomial decides the threshold. If the message transmission becomes larger than this threshold, the polynomial system fails. A substitute method is to add noise to the system for making difficult to solve the polynomial equations, but even this difficulty is solved by using error correcting codes. (Hence, in this paper message authentication is established using Source Anonymous Message Authentication (SAMA) on QR factorization is proposed.
关键词：Channel; obtruder; public-key ; cryptosystem; polynomial system; Symmetric-key ; cryptosystem; threshold