Explore the vast range of titles available.

One of the most important components of intelligent transportation systems (ITS) is the automotive self-organizing VANET network (vehicular ad hoc network). Its nodes are vehicles with specialized onboard units (OBU) installed on them. Such a network can be subject to various attacks. To reduce the effectiveness of a number of attacks on the VANET, it is advisable to use authentication protocols. Well-known authentication protocols support a security policy with full trust in roadside unit (RSU) base stations. The disadvantage of these authentication protocols is the ability of the RSU to track the route of the vehicle. This leads to a violation of the privacy and anonymity of the vehicle’s owner. To eliminate this drawback, the article proposes an adaptive authentication protocol. An advantage of this protocol is the provision of high imitation resistance without using symmetric and asymmetric ciphers. This result has been achieved by using a zero-knowledge authentication protocol. A scheme for adapting the protocol parameters depending on the intensity of the user’s traffic has been developed for the proposed protocol. The scientific novelty of this solution is to reduce time spent on authentication without changing the protocol execution algorithm by reducing the number of modular exponentiation operations when calculating true and “distorted” digests of the prover and verifying the correctness of responses, as well as by reducing the number of responses. Authentication, as before, takes place in one round without changing the bit depth of the modulus used in the protocol. To evaluate the effectiveness of the adaptive authentication protocol, the VANET model was implemented using NS-2. The obtained research results have shown that the adaptation of the authentication protocol in conditions of increased density of vehicles on the road makes it possible to increase the volume of data exchange between OBU and RSU by reducing the level of confidentiality. In addition, a mechanism for verifying the authority of the vehicle’s owner for provided services has been developed. As a result of the implementation of this mechanism, vehicle registration sites (VRS) calculate the public key of the vehicle without using encryption and provide necessary services to the owner.

The problem of cybersecurity of vehicular ad hoc network (VANET) is far from being fully solved. This is due to the fact that when exchanging data between On Board Units (OBUs) and Roadside Units (RSUs) a wireless channel is used, which is subject to many cyberattacks. It is known that the use of encryption algorithms, particularly Advanced Encryption Standard (AES), can effectively counter many of them. However, during the operation of AES encryption systems, failures may occur, as a result of which closed communication channels may become open and accessible to attackers. Therefore, giving the property of fault tolerance to the used encryption systems is an urgent task. To solve this problem, the article proposes to use redundant residue codes in the polynomial ring (RCPR). The article describes a method of providing fault tolerance of AES encryption systems based on RCPR. Using the developed error correction algorithm for RCPR with one control module, the redundant RCPR can detect 100% of single and double errors, as well as correct 100% of single and 75% of double errors that occur during encryption and decryption. Thus, the developed method based on error correction of AES encryption system allows to parry cyberattacks on vehicles and ensure a higher level of cyber security of VANET.

There has been a tendency to use the theory of finite Galois fields, or GF(2n), in cryptographic ciphers (AES, Kuznyechik) and digital signal processing (DSP) systems. It is advisable to use modular codes of the polynomial residue number system (PRNS). Modular codes of PRNS are arithmetic codes in which addition, subtraction and multiplication operations are performed in parallel on the bases of the code, which are irreducible polynomials. In this case, the operands are small-bit residues. However, the independence of calculations on the bases of the code and the lack of data exchange between the residues can serve as the basis for constructing codes of PRNS capable of detecting and correcting errors that occur during calculations. The article will consider the principles of constructing redundant codes of the polynomial residue number system. The results of the study of codes of PRNS with minimal redundancy are presented. It is shown that these codes are only able to detect an error in the code combination of PRNS. It is proposed to use two control bases, the use of which allows us to correct an error in any residue of the code combination, in order to increase the error-correction abilities of the code of the polynomial residue number system. Therefore, the development of an algorithm for detecting and correcting errors in the code of the polynomial residue number system, which allows for performing this procedure based on modular operations that are effectively implemented in codes of PRNS, is an urgent task.

Authentication protocols are expanding their application scope in wireless information systems, among which are low-orbit satellite communication systems (LOSCS) for the OneWeb space Internet, automatic object identification systems using RFID, the Internet of Things, intelligent transportation systems (ITS), Vehicular Ad Hoc Network (VANET). This is due to the fact that authentication protocols effectively resist a number of attacks on wireless data transmission channels in these systems. The main disadvantage of most authentication protocols is the use of symmetric and asymmetric encryption systems to ensure high cryptographic strength. As a result, there is a problem in delivering keys to the sides of the prover and the verifier. At the same time, compromising of keys will lead to a decrease in the level of protection of the transmitted data. Zero-knowledge authentication protocols (ZKAP) are able to eliminate this disadvantage. However, most of these protocols use multiple rounds to authenticate the prover. Therefore, ZKAP, which has minimal time costs, is developed in the article. A scheme for adapting protocol parameters has been developed in this protocol to increase its efficiency. Reductions in the level of confidentiality allow us to reduce the time spent on the execution of the authentication protocol. This increases the volume of information traffic. At the same time, an increase in the confidentiality of the protocol entails an increase in the time needed for authentication of the prover, which reduces the volume of information traffic. The FPGA Artix-7 xc7a12ticsg325-1L was used to estimate the time spent implementing the adaptive ZKAP protocol. Testing was performed for 32- and 64-bit adaptive authentication protocols.

The integration of the Internet of Vehicles (IoV) and low-orbit satellite Internet not only increases the efficiency of traffic management but also contributes to the emergence of new cyberattacks. Spoofing interference occupies a special place among them. To prevent a rogue satellite from imposing unauthorized content on vehicle owners, a zero-knowledge authentication protocol (ZKAP) based on a modular polyalphabetic polynomial code (MPPC) was developed. The use of MPPC allowed for increasing the authentication speed of the satellite performing the role of RSU. As a result, a reduction in the time needed to guess the prover’s signal also reduces the probability of granting a rogue satellite the communication session and increases the imitation resistance of the satellite IoV. At the same time, the MPPC allows for improving the noise resistance of the ZKAP. An algorithm for calculating the control residuals for a noise-resistant MPPC was developed for this purpose, as well as an algorithm for correcting errors arising in the communication channel due to interference. Thus, the developed authentication protocol based on a noise-resistant modular code allows for simultaneously reducing the probabilities of the first-order and second-order errors, which leads to the increased cybersecurity of satellite IoV.

Low-orbit satellite internet (LOSI) expands the scope of the Industrial Internet of Things (IIoT) in the oil and gas industry (OGI) to include areas of the Far North. However, due to the large length of the communication channel, the number of threats and attacks increases. A special place among them is occupied by relay spoofing interference. In this case, an intruder satellite intercepts the control signal coming from the satellite (SC), delays it, and then imposes it on the receiver located on the unattended OGI object. This can lead to a disruption of the facility and even cause an environmental disaster. To prevent a spoofing attack, a satellite authentication method has been developed that uses a zero-knowledge authentication protocol (ZKAP). These protocols have high cryptographic strength without the use of encryption. However, they have a significant drawback. This is their low authentication speed, which is caused by calculations over a large module Q (128 bits or more). It is possible to reduce the time of determining the status of an SC by switching to parallel computing. To solve this problem, the paper proposes to use residue codes (RC). Addition, subtraction, and multiplication operations are performed in parallel in RC. Thus, a correct choice of a set of modules of RC allows for providing an operating range of calculations not less than the number Q. Therefore, the development of a spacecraft authentication method for the satellite internet system using RC that allows for reducing the authentication time is an urgent task.