CFP last date
20 December 2024
Reseach Article

An Efficient SKM Framework for Data Authentication and its Application to the Adhoc Networks

by Suma Christal Mary, Pallikonda Rajasekaran, Chrisbin Jeeva
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 43 - Number 8
Year of Publication: 2012
Authors: Suma Christal Mary, Pallikonda Rajasekaran, Chrisbin Jeeva
10.5120/6127-8359

Suma Christal Mary, Pallikonda Rajasekaran, Chrisbin Jeeva . An Efficient SKM Framework for Data Authentication and its Application to the Adhoc Networks. International Journal of Computer Applications. 43, 8 ( April 2012), 38-43. DOI=10.5120/6127-8359

@article{ 10.5120/6127-8359,
author = { Suma Christal Mary, Pallikonda Rajasekaran, Chrisbin Jeeva },
title = { An Efficient SKM Framework for Data Authentication and its Application to the Adhoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 43 },
number = { 8 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 38-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume43/number8/6127-8359/ },
doi = { 10.5120/6127-8359 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:33:18.244162+05:30
%A Suma Christal Mary
%A Pallikonda Rajasekaran
%A Chrisbin Jeeva
%T An Efficient SKM Framework for Data Authentication and its Application to the Adhoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 43
%N 8
%P 38-43
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Internet and various other forms of electronic communication is such an essential thing to move up with this periodic global world and indulging security is another gradient to climb defeating those black hats. One essential aspect for secure communications is that of cryptography. In previous approaches RSA and ECC algorithms plays a vital role however both algorithms are lacking of mathematical problems monotonously. In our proposed approach a novel protocol called Shared Key Management (SKM) is employed. In this approach McEliece algorithm is embedded with Dispense Key designed for key generation and for the key distribution. This scheme is highly scalable with respect to memory moreover number of keys are drastically reduced. Experimental results are being encountered that our proposed approach increases its efficiency in terms of memory and execution time for performing both encryption and decryption. As a result this algorithm is providing a high-performance platform to execute key generation, key distribution encryption and decryption scenarios.

References
  1. "An Exact A* Method for Deciphering Letter-Substitution Ciphers" - Eric Corlett and Gerald Penn, Jul 2010
  2. "A Summary of McEliece-Type Cryptosystems and Their Security" - D. Engelbert, R. Overbeck, and A. Schmidt , 2006
  3. "Attacking and defending the McEliece cryptosystem" - Daniel J. Bernstein, Tanja Lange, and Christiane Peters, Aug 2008
  4. "Reducing Key Length of the McEliece Cryptosystem" - Thierry P. Berger, Pierre-Louis Cayrel, Philippe Gaborit, and Ayoub Otmani,2009
  5. "Elliptic Curve Cryptography" - An implementation Guide , Anoop MS, anoopms@tataelxsi. co. in
  6. R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
  7. "Securing Ad-hoc Networks. IEEE Network Magazine " - L. Zhou and Z. J. Haas , Nov. 1999.
  8. S. A. Camtepe and B. Yener, Combinatorial design of key distribution mechanisms for wireless sensor networks. In Proceedings of 9th European Symposium On Research in Computer Security (ESORICS 04), 2004.
  9. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy, pages 197-213, 2003.
  10. W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A pairwise key predistribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS), pages 42-51, Washington, DC, USA, October 27-31 2003.
  11. D. Liu and P. Ning. Establishing pairwise keys in distributed sensor networks. In Proceedings of 10th ACM Conference on Computer and Communications Security (CCS'03), pages 52-61, October 2003.
  12. F. Delgosha and F. Fekri. Threshold Key-Establishment in Distributed Sensor Networks Using a Multivariate Scheme. In Proceedings of 25th IEEE INFOCOM, April 2006.
  13. P. Traynor, H. Choi, G. Cao, S. Zhu, T. La Porta. Establishing Pair-Wise Keys in Heterogeneous Sensor Networks. In Proceedings of 25th IEEE INFOCOM, April 2006
  14. D. J. Bernstein, T. Lange, and C. Peters, "Attacking and defending the McEliece cryptosystem," Post-Quantum Cryptography, LNCS, vol. 5299, pp. 31–46, 2008.
  15. K. Kobara and H. Imai, "Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC," Lecture Notes in Computer Science, pp. 19–35, 2001.
  16. S. Balasubramanian et. al. , "Fast Multivariate Signature Generation in Hardware: The Case of Rainbow," 19th IEEE Int. Conf. on Application-specific Systems, Architectures and Processors ASAP 2008, 2008.
  17. D. J. Bernstein, T. Lange, and C. Peters, "Attacking and Defending the McEliece Cryptosystem," Post-Quantum Cryptography, pp. 31- 46, Springer, 2008.
  18. J. Buchmann, Introduction to Cryptography (Undergraduate Texts in Mathematics). Springer, 2004.
  19. D. Engelbert, R. Overbeck, and A. Schmidt, "A Summary of McEliece-Type Cryptosystems and Their Security," Math. Cryptology, vol. 1, pp. 151-191, 2007.
  20. D. J. Bernstein, J. Buchmann, and E. Damen, Post-Quantum Cryptography. Springer, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Skm Framework Data Authentication Adhoc Networks