Scholarlink

<p>In this work, lightweight hyperchaotic encryption method for vehicle ad hoc networks (VANETs) is proposed for secure communication. With a low computational overhead, the suggested method is meant to be adaptable and scalable, guaranteeing conditional privacy, data integrity, and protection against a variety of threats. The simulation for urban mobility–objective modular networks testbed (SUMO–OMNeT++) was used to construct and test the method in C + + with a Python interface. Quantitative analysis, security strength, and computational cost are assessed in order to conduct latency. Comparing the suggested approach to more traditional encryption techniques, such digital signature methods and privacy-preserving techniques, reveals that it is more effective and secure. Its use of hyperchaotic keys, which are produced at random on the momentous, is the main reason for this; it makes the procedure more unexpected and accelerates up processing.The system is extremely susceptible and the data is exceedingly hard to predict, as evidenced by its 99.8% NPCR and about 8 entropy value. The cost of computation is lower than that of typical encryption methods, at just 8.75%.The results show that the suggested system achieves an ideal compromise between security and compute effectiveness, making it suitable for actual time VANET systems applications where dependability and speed are crucial.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Resilient VANET Communication via Hyper-Chaotic Cryptographic Mechanisms

  • 期刊论文

  • 发表日期：

    2025年12月3日

查看全文
  • G. Kothai,
  • Alagar Karthick,
  • S. Sankar Ganesh,
  • S. Kalimuthu Kumar

摘要

In this work, lightweight hyperchaotic encryption method for vehicle ad hoc networks (VANETs) is proposed for secure communication. With a low computational overhead, the suggested method is meant to be adaptable and scalable, guaranteeing conditional privacy, data integrity, and protection against a variety of threats. The simulation for urban mobility–objective modular networks testbed (SUMO–OMNeT++) was used to construct and test the method in C + + with a Python interface. Quantitative analysis, security strength, and computational cost are assessed in order to conduct latency. Comparing the suggested approach to more traditional encryption techniques, such digital signature methods and privacy-preserving techniques, reveals that it is more effective and secure. Its use of hyperchaotic keys, which are produced at random on the momentous, is the main reason for this; it makes the procedure more unexpected and accelerates up processing.The system is extremely susceptible and the data is exceedingly hard to predict, as evidenced by its 99.8% NPCR and about 8 entropy value. The cost of computation is lower than that of typical encryption methods, at just 8.75%.The results show that the suggested system achieves an ideal compromise between security and compute effectiveness, making it suitable for actual time VANET systems applications where dependability and speed are crucial.