Exchange Protocol Research Articles

High-Performance RNS Modular Exponentiation by Sum-Residue Reduction

With rapid development and application of artificial intelligence and block chain, the requirement of information and data security is also increased, in which the public-key cryptography, such as Rivest-Shamir-Adleman (RSA) cryptography, plays a significant role. Modular exponentiation is fundamental in computer arithmetic and is widely applied in cryptography, such as ElGamal cryptography, Diffie–Hellman key exchange protocol, and RSA cryptography. The implementation of modular exponentiation in a residue number system leads to high parallelism in computation and has been applied in many hardware architectures. While most residue number system (RNS)-based architectures utilize RNS Montgomery algorithm with two residue number systems, the recent modular multiplication algorithm with sum residues performs modular reduction in only one residue number system with about the same parallelism. In this work, it is shown that the high-performance modular exponentiation and RSA cryptography can be implemented in RNS. Both the algorithm and architecture are improved to achieve high performance with extra area overheads, where a 1024-bit modular exponentiation can be completed in 0.567 ms in Xilinx XC6VLX195t-3 platform, costing 26 489 slices, 87 357 LUTs, 363 dedicated multipilers of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$18$</tex-math> </inline-formula> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\times $</tex-math> </inline-formula> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$18$</tex-math> </inline-formula> bits, and 65 block RAMs.

ГЕОИНФОРМАЦИОННАЯ СИСТЕМА ОЦЕНКИ ВОЗНИКНОВЕНИЯ ПОЖАРНОЙ ОПАСНОСТИ СОПРЯЖЕННЫХ УЧАСТКОВ РАСТИТЕЛЬНОСТИ ПО ПРИРОДНО-АНТРОПОГЕННЫМ УСЛОВИЯМ

On the basis of a deterministic-probabilistic model for assessing the occurrence of fires of interconnected vegetation areas according to natural and anthropogenic conditions, a geoinformation system has been developed, consisting of a database and blocks for access to open data and searching adjacent neighborhoods, calculating meteorological and anthropogenic fire danger, and for regulating forest protection measures. Databases contain information about vegetation fires, data from hydrometeorological stations and anthropogenic sources. To account for the influence of interconnected areas on fire danger, a complex with an algorithm for searching vegetation quarters was used and its integration with the blocks of the geoinformation system was carried out. The architecture of the geoinformation system is based on a three-tier distribution, including a database server with API access support, an application broker and an application for visualization of calculation results. The API server stores structured data from open sources accessible via application exchange protocols, the application broker contains functions for data collection, calculation of indicators and their visualization in third-party applications. To build electronic maps, open data from the OpenStreetMap resource for the districts of the Russian Federation in the WSG 84 cartographic projection was used. Individual vegetation fires were obtained according to MODIS satellite monitoring data from 2013 to 2022. The attribute data of fires contain the identifier, the coordinates of the center, the area of ignition, the date of detection and elimination, the forest and non-forest area. Verification of the system is planned to be carried out in the fire season 2023–2024.

ВИМОГИ З КІБЕРЗАХИСТУ IНФОРМАЦІЙНО-КОМУНІКАЦІЙНИХ СИСТЕМ ТА СЕРВІСІВ ЗВ’ЯЗКУ ПІД ЧАС ЇХ РОЗГОРТАННЯ ТА ЕКСПЛУАТАЦІЇ НА ПУНКТАХ УПРАВЛІННЯ СКЛАДОВИХ СИЛ ОБОРОНИ ТА БЕЗПЕКИ

The relevance of this work is due to the fact that in recent years the communication forces have been constantly developing and equipped with the latest digital means of communication, which allows them to successfully perform their assigned tasks. Today, information and communication systems that are deployed at the control points of various branches of management ensure the implementation of priority tasks for the management of troops. Functionally, the communication system and information systems are deployed at control points as a single information and communication environment based on the implementation of the latest information and communication technologies, information exchange protocols, complexes, systems and means of communication, which ensures the exchange of all types of information between bodies military management (management bodies) and control points at all levels of management. An active communication system ensures the exchange of information with guaranteed security in a single information space as a set of material functions (including personnel and other resources) that combine to perform a certain task. In turn, information systems, as a set of equipment, methods and procedures, and, if necessary, personnel organized to perform information processing functions operate in accordance with a defined structure, namely: - services, in the context of communication and information systems; - architecture, in the context of communication and information systems; - functions in the context of service-oriented architecture; - interoperability; - information protection and cyber protection. It is clear that the more important the object of management, the more capacious flow of information can be directed to it. This allows the adversary/attacker to identify the most important targets and direct other types of information to them or suppress them in various ways. Thus, in the interests of ensuring cyber protection of electronic information resources, communication and technological systems of the control points of the Armed Forces of Ukraine, the technological infrastructure of cyber protection of the Armed Forces of Ukraine has been deployed and is functioning, which is a component of the unified system of information protection and cyber protection in the information and communication systems of the Ministry of Defense and the Armed Forces of Ukraine. In these conditions, to solve the tasks of preventing unwanted interventions, disruption of the stable functioning of the information and communication environment at control points, counterweights in obtaining confidential information, data theft, and other minimally necessary components of the cyber protection infrastructure are deployed. The main components of the relevant technological infrastructure of cyber protection are the security information event management system (SIEM), the threat information exchange platform (Malware Information Sharing Platform &amp; Threat Sharing, MISP), the centralized management system of inter-network screens and the system for detecting and countering cyber threats. including computer viruses on end equipment. Therefore, solving the tasks of ensuring cyber protection in the course of deployment and operation of electronic communication networks and communication services at the control points of various branches of management turns out to be quite a serious and urgent task.

PRE-PROJECT SOLUTIONS FOR BUILDING AN AUTHORIZATION SYSTEM BASED ON THE ZERO TRUST CONCEPT

This article describes the task of building effective solutions to increase the level of cyber security of state-level information systems in the conditions of weapons of aggression and powerful cyber attacks on critical infrastructure. A descriptive supplement to the security threat model has been developed, taking into account the concept of Zero Trust, and the threat model has been visualized, which allows you to determine the potential vulnerabilities of existing solutions regarding the construction of identification and access control subsystems. Requirements for contactless authentication hardware are defined. A functional diagram of the interaction of radio frequency identification components with passive electrical oscillating circuits has been built. A block diagram has been created algorithm of the identification system to the hardware authentication device. Defined functional and engineering solutions for the construction of contactless hardware authentication of clients during access to system devices. Grounded sketch decisions regarding the construction of a steganographic data exchange protocol in identification and access management procedures.

Public key exchange protocols based on tropical lower circulant and anti circulant matrices

&lt;abstract&gt;&lt;p&gt;In recent years, many efficient key exchange protocols have been proposed based on matrices over the tropical semirings. The tropical addition of two elements is the minimum of the elements, while the tropical multiplication is the sum of the two elements. This paper proposes a novel key exchange protocol based on the min-plus semiring ($ \mathbb{Z}\cup\{\infty\}, \oplus, \otimes $) by introducing anti-$ s $-$ p $-circulant matrices, which forms a commutative subset of $ M_{n \times n}(\mathbb{Z}\cup \{\infty\}) $. We have given further analysis of the protocol in detail using upper or lower-$ s $-circulant matrices. Additionally, we prove that the set of all lower-$ s $-circulant matrices is a sub-semiring of the tropical semiring $ M_{n \times n}(\mathbb{Z}\cup \{\infty\}) $. We discuss the detailed security analysis of the protocol with upper or lower-$ s $-circulant matrices and provide cryptographic algorithms for both key exchange protocols with detailed explanations. We compare the protocol based on upper or lower-$ s $-circulant matrices and our proposed protocol in terms of time complexity and memory usage. Finally, we analyse the security and show that our protocol is safe against popular attacks of tropical key exchange protocols. The security of these protocols relies on the difficulty of solving tropical non-linear equations.&lt;/p&gt;&lt;/abstract&gt;

“Password Authentication Key Exchange Protocol using Fish Tank Image based True Random Number Generator”

Abstract: We employ a straightforward configuration of a fish tank as the changeable environment, recording its photos over time, in order to limit the computational complexity. To create the initial seed, the image data is then submitted to a reduction method and hash function. In order to get true random numbers, we suggest a method for economically removing the true seed from the image data and applying it to a pseudo-random generator, in this case, a Linear Congruential Generator (LCG). The need for information security is increasing across a range of industries, and security concerns are receiving more and more attention as a result of the Internet's explosive growth in recent years. Any future value cannot be accurately anticipated based on the current set of values and random numbers are those that are a part of a sequence in which values are uniformly distributed over a defined set. A safe session key can be provided to a pair of users interacting over an unstable channel using password-based encrypted key exchange protocols, even if the top secret key or password they share is chosen at random from a tiny set of values. We offer two straightforward Bellovin and Merritt-based encrypted key exchange systems..

Classification and analysis of vulnerabilities of modern information systems from classical and quantum attacks

Recent advances in quantum technology and the potential that practical quantum computers may become a reality in the future have led to renewed interest in developing cryptographic technologies that are secure against conventional and quantum attacks. Currently, virtually all asymmetric cryptographic schemes in use are threatened by the potential development of powerful quantum computers. Post-quantum cryptography is one of main the ways to combat this threat. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently, even with the help of quantum computers. The security of information systems is ensured through protection against various threats that use system vulnerabilities. Security protocols are the building blocks of secure communication. They implement security mechanisms to provide security services. Security protocols are considered abstract when analyzed, but may have additional vulnerabilities in implementation. This work contains a holistic study of security protocols. Basics of security protocols, taxonomy of attacks on security protocols and their implementation are considered, as well as various methods and models of protocol security analysis. In particular, the differences between information-theoretic and computational security, computational and symbolic models are specified. In addition, an overview of the computational security models for Authenticated Key Exchange (AKE) and Password Authentication Key Exchange (PAKE) protocols is provided. The most important security models for the AKE and PAKE protocols were also described. With the emergence of new technologies that may have different security requirements, as well as with increased opportunities for competition, there is always a need to develop new protocols. Thus, the purpose of this article is to review, classify, analyze, and research the vulnerabilities of information systems from classical, quantum, and special attacks, performed taking into account the forecast regarding the possibilities of attacks on post-quantum cryptographic transformations; studying security assessment models for existing cryptographic protocols, as well as reviewing and benchmarking security models and providing suggestions for protection against existing potential attacks.

SHARING KEYS USING CIRCULANT MATRICES AND LOGISTIC MAPS THROUGH QUANTUM CHANNAL

To ensure confidentiality and avoid humain attacks against our data, we exchange encryption and decryption keys. In our proposal scheme, we use the commutative properties of the product of circular matrices to create a common encryption key by applying the protocol of { \it Diffie-Hellman} exchange through a classic channel. To raise the security level of our system we have introduced the sensibility of chaotic logistic maps in another exchange protocol which is the $BB84$ throuth a quantum channal.

An Attack on a Non-Interactive Key Exchange from Code Equivalence

Abstract A recent paper by Zhang and Zhang claims to construct the first code-based non-interactive key exchange protocol, using a modified version of the Code Equivalence Problem. In this paper we explain why this approach is flawed. Namely, we describe an attack which involves only linear algebra and completely breaks the protocol with overwhelming probability. A simple Magma script confirms our results.

A Novel Smart Home Lightweight Authentication Protocol using IoT Applications

The Internet of Things (IoT) introduces innovative real-time applications that use sensors to collect data that exchange between things to things and things to humans through the network. In this aspect, security and privacy is the primary concern for researchers to protect these systems. This paper proposes a real-time authentication algorithm based on the one-time pad (OTP) principle. The keys are dynamically exchanged, and the data is encrypted via dynamic encryption, depending on random sensors’ data. The key is generated and exchanged dynamically using the dynamic encryption technique, thus enhancing the users’ data privacy and security. Moreover, a lightweight key generation, exchange, and authentication protocol are proposed for data collecting from smart home sensors. The proposed protocol guarantees security and privacy demand, which are the user’s primary concern. The proposed protocol is developed for smart home applications with interfacing requirements, which makes the system real and applicable. The operation principle of the proposed protocol is illustrated sufficiently if there is any desynchronization or emergency.

Microservice Architecture of Virtual Training Complexes

The task of automating and reducing the complexity of the process of developing virtual training complexes is considered. The analysis of the subject area showed the need to move from a monolithic to a service-oriented version of the architecture. It is found that the use of a monolithic architecture in the implementation of virtual training complexes limits the possibility of modernizing the system, increases its software complexity, and makes it difficult to implement an interface for managing and monitoring the training process. The general concept of the microservice architecture of virtual training complexes is presented, and definitions of the main and secondary components are given. The scientific novelty of the research lies in the transition from the classical monolithic architecture in the subject area of the HTC to the microservice architecture; eliminating the shortcomings of this approach by implementing a single protocol for the exchange of information between modules; separation of network interaction procedures into software libraries to unify and improve the reliability of the system. The use of isolated, loosely coupled microservices allows developers to use the best technologies, platforms and frameworks for their implementation; separate the graphical interface of the simulator instructor from the visualization and virtual reality system; provide the ability to flexibly replace the main components (visualization, interface, interaction with virtual reality) without changing the architecture and affecting other modules. The decomposition of the structural model of the microservice architecture is carried out, and the specifics of the functioning of the main components are presented. The implementation of microservices networking libraries and a JSON-based data exchange protocol is considered. The practical significance of the proposed architecture lies in the possibility of parallelization and reducing the complexity of the development and modernization of training complexes. The features of the functioning of the systems implemented in the proposed microservice architecture are analyzed.

CFX: Contention-Free Channel Access for IEEE 802.11ax

Orthogonal frequency-division multiple access (OFDMA) has attracted great attention as a key technology for uplink enhancement for Wi-Fi, since it can effectively reduce network congestion and channel access delay. Unfortunately, the traditional random access protocol of Wi-Fi seldom allows these benefits to be achieved, especially in dense network environments, as the access point (AP) rarely gains the channel access needed to trigger OFDMA uplink transmissions due to severe frame collisions. To address this problem, we propose a new channel access scheme called Contention-Free Channel Access for 802.11ax (CFX). In the proposed scheme, users can access the channel without contention, since they are guaranteed a transmission opportunity immediately after another user's transmission. To realize CFX on top of the existing Buffer Status Report/BSR Poll (BSR/BSRP) exchange protocol of 802.11ax, we develop an additional scheme based on shared channel access that helps the AP to obtain the buffer status of users and manage a contention-free channel access schedule. In addition, in order to appropriately utilize the savings from the reduced frame collisions, we conduct sum throughput maximization using an actor-critic proximal policy optimization (PPO)-based deep reinforcement learning approach. The results of an extensive evaluation show that CFX not only significantly improves the uplink performance of Wi-Fi in terms of throughput and channel access delay but can also dynamically adjust the parameters in response to changes in the network status.

Control and Monitoring Subsystem of an Unmanned Aerial Vehicle

The object of the research is the unmanned aerial vehicle monitoring system, the data exchange protocol and the unmanned aerial vehicle control line. A study was conducted, based on the results of which the unmanned aerial vehicle protection protocol and criteria were selected. An algorithm has been developed that ensures the establishment of the fact that the received radio radiation belongs to the class of radio signals of unmanned aerial vehicle remote control systems with pulse-position and pulse-code modulations. The results of practical testing of possible solutions are presented and the results of the functioning of the developed communication components are given. The user interface was developed, and the hybrid data exchange protocol was implemented in software.

On the efficiency of a general attack against the MOBS cryptosystem

Abstract All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called telescoping equality; in some cases, this equality has been used to construct an attack. In this report, we present computational evidence suggesting that an instance of the scheme called “MOBS (matrices over bitstrings)” is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.

Synthesis of β-Deuterated Amino Acids via Palladium-Catalyzed H/D Exchange.

Despite several synthetic approaches that have been developed for α-deuterated amino acids, the synthesis of β-deuterated amino acids has remained a challenge. Herein, we disclose a palladium catalyzed H/D exchange protocol for a β-deuterated N-protected amino amide, which can be converted to a β-deuterated amino acid simply by removal of protecting groups. This protocol is highly efficient, simply manipulated, and appliable for deuterium-labeling of many amino amides. In addition, deuterium labeling of phenylalanine derivatives was also successful when pivalic acid served as an additive to promote the H/D exchange process.

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors

We study two basic problems regarding edit errors, document exchange and error correcting codes. Here, two parties try to exchange two strings with length roughly n and edit distance at most k , or one party tries to send a string of length n to another party through a channel that can introduce at most k edit errors. The goal is to use the least amount of communication or redundancy possible. Both problems have been extensively studied for decades, and in this article, we focus on deterministic document exchange protocols and binary codes for insertions and deletions (insdel codes). It is known that for small k (e.g., k ≤ n/4 ), in both problems the optimal communication or redundancy size is Θ ( k log n/k). In particular, this implies the existence of binary codes that can correct ε fraction of edit errors with rate 1-Θ (ε log 1/ε )). However, known constructions are far from achieving these bounds. In this article, we significantly improve previous results on both problems. For document exchange, we give an efficient deterministic protocol with communication complexity O ( k log 2 n/k . This significantly improves the previous best-known deterministic protocol, which has communication complexity O ( k 2 + k log 2 n ) [ 4 ]. For binary insdel codes, we obtain the following results: (1) An explicit binary insdel code with redundancy O ( k log 2 n/k). In particular this implies an explicit family of binary insdel codes that can correct ε fraction of insertions and deletions with rate 1-O(ε log 2 (1/ε))=1-Õ(ε). This significantly improves the previous best-known result, which only achieves rate 1-Õ(√ ε) [ 14 ], [ 15 ], and is optimal up to a log (1/ε factor. (2) An explicit binary insdel code with redundancy O ( k log n ). This significantly improves the previous best-known result of Reference [ 6 ], which only works for constant k and has redundancy O ( k 2 log k log n ); and that of Reference [ 4 ], which has redundancy O ( k 2 + k log 2 n ). Our code has optimal redundancy for k ≤ n 1-α , any constant 0&lt; α &lt; 1. This is the first explicit construction of binary insdel codes that has optimal redundancy for a wide range of error parameters k . In obtaining our results, we introduce several new techniques. Most notably, we introduce the notion of ε-self-matching hash functions and ε-synchronization hash functions . We believe our techniques can have further applications in the literature.

Provable Secure Authentication Protocol in Fog-Enabled Smart Home Environment

People can access and obtain services from smart home devices conveniently through fog-enabled smart home environments. The security and privacy-preserving authentication protocol play an important role. However, many proposed protocols have one or more security flaws. In particular, almost all the existing protocols for the smart home cannot resist gateway compromised attacks. The adversary can not only know the user’s identity but also launch impersonation attacks. Designing a provable secure authentication protocol that avoids all known attacks on smart homes is challenging. Recently Guo et al. proposed an authentication scheme based on symmetric polynomials in the fog-enabled smart home environment. However, we found that their scheme suffers from gateway compromised attack, desynchronization attack, mobile device loss/stolen and attack, and has no untraceability and perfect forward secrecy. Therefore, we adopt a Physical Unclonable Function (PUF) to resist gateway compromised attack, adopt Elliptic Curve Diffie–Hellman (ECDH) key exchange protocol to achieve perfect forward secrecy, and propose a secure and privacy-preserving authentication protocol, which is provably secure under the random oracle model. According to the comparisons with some related protocols, the proposed protocol has better security and transmission efficiency with the same computation cost level.

Smooth Projective Hash Function From Codes and its Applications

Nowadays, Smooth Projective Hash Functions (SPHFs) play an important role in constructing cryptographic tools such as secure Password-based Authenticated Key Exchange (PAKE) protocol in the standard model, oblivious transfer, and zero-knowledge proofs. Specifically, in this article, we focus on constructing PAKE protocol; that is, a kind of key exchange protocol which needs only a low entropy password to produce a cryptographically strong shared session key. In spite of relatively good progress of SPHFs in applications, it seems there has been little effort to build them upon quantum-resistant assumptions such as lattice-based cryptography and code-based cryptography to make them secure against quantum computer attacks. More precisely, there are two proposals based on lattice assumptions that utilize the SPHFs to construct PAKE secured in standard model. Considering quantum-resistant assumptions is less than straightforward and needs some relaxations. In this article, we introduce two new Approximate SPHF (ASPHFs) from error-correcting codes. Upon designing ASPHF, we can construct two efficient PAKE protocols. The security of our protocols could be proved based on the hardness of bounded decoding (BD) problem and learning with parity (LPN) problem in the standard model.

Deep-Learning-Based Cyber-Physical System Framework for Real-Time Industrial Operations

Automation in the industry can improve production efficiency and human safety when performing complex and hazardous tasks. This paper presented an intelligent cyber-physical system framework incorporating image processing and deep-learning techniques to facilitate real-time operations. A convolutional neural network (CNN) is one of the most widely used deep-learning techniques for image processing and object detection analysis. This paper used a variant of a CNN known as the faster R-CNN (R stands for the region proposals) for improved efficiency in object detection and real-time control analysis. The control action related to the detected object is exchanged with the actuation system within the cyber-physical system using a real-time data exchange (RTDE) protocol. We demonstrated the proposed intelligent CPS framework to perform object detection-based pick-and-place operations in real time as they are one of the most widely performed operations in quality control and industrial systems. The CPS consists of a camera system that is used for object detection, and the results are transmitted to a universal robot (UR5), which then picks the object and places it in the right location. Latency in communication is an important factor that can impact the quality of real-time operations. This paper discussed a Bayesian approach for uncertainty quantification of latency through the sampling–resampling approach, which can later be used to design a reliable communication framework for real-time operations.

Complete decomposition of dihedral groups with application to key exchange protocol

In this work, we perform an investigation on the hardness of finding complete decompositions of dihedral groups and show an application of complete decomposition by constructing a Diffie–Hellman-type key exchange protocol.