Exchange Protocol Research Articles

Dynamic Key Replacement Mechanism for Lightweight Internet of Things Microcontrollers to Resist Side-Channel Attacks

5G technology and IoT devices are improving efficiency and quality of life across many sectors. IoT devices are often used in open environments where they handle sensitive data. This makes them vulnerable to side-channel attacks (SCAs), where attackers can intercept and analyze the electromagnetic signals emitted by microcontroller units (MCUs) to expose encryption keys and compromise sensitive data. To address this critical vulnerability, this study proposes a novel dynamic key replacement mechanism specifically designed for lightweight IoT microcontrollers. The mechanism integrates Moving Target Defense (MTD) with a lightweight Diffie–Hellman (D-H) key exchange protocol and AES-128 encryption to provide robust protection against SCAs. Unlike traditional approaches, the proposed mechanism dynamically updates encryption keys during each cryptographic cycle, effectively mitigating the risk of key reuse—a primary vulnerability exploited in SCAs. The lightweight D-H key exchange ensures that even resource-constrained IoT devices can securely perform key exchanges without significant computational overhead. Experimental results demonstrate the practicality and security of the proposed mechanism, achieving key updates with minimal time overhead, ranging from 12 to 50 milliseconds per encryption transmission. Moreover, the approach shows strong resilience against template attacks, with only two out of sixteen AES-128 subkeys compromised after 20,000 attack attempts—a notable improvement over existing countermeasures. The key innovation of this study lies in the seamless integration of MTD with lightweight cryptographic protocols, striking a balance between security and performance. This dynamic key replacement mechanism offers an effective, scalable, and resource-efficient solution for IoT applications, particularly in scenarios that demand robust protection against SCAs and low-latency performance.

An analytic study of a novel algebraic public key encryption scheme based on polynomials over noncommutative matrix ring

Different public key exchange protocols can be employed to design a cryptosystem. The most famous example is the ElGamal cryptosystem which is based on the Diffie–Hellman key establishment to do encryption and decryption. In the same fashion, we propose a public key cryptosystem using a public key exchange protocol. This variant uses the polynomials over noncommutative matrix ring as underlying work structure. The useful feature of the proposed cryptosystem is that it provides favorable security because of use of the generalized decomposition problem over the noncommutative ring of matrices. The issues regarding the choice of parameters and platform are discussed. Further, a brief note on security analysis of the proposed cryptosystem is also presented.

A homoleptic rare-earth-metal tetramethylindate.

The homoleptic complex La(InMe4)3 is obtained from the respective aluminium congener La(AlMe4)3via a donor-assisted tetramethylaluminate/tetramethylindate exchange protocol. Compound La(InMe4)3 exhibits interesting thermal lability as well as distinct cluster formation like La4In7(C)(CH)2(CH2)2(CH3)19 and La5In9(CH)6(CH3)24 upon addition of an excess of donor or thermal treatment. The neutral potentially tridentate ligand Me3TACN (1,4,7-trimethyl-1,4,7-triazacyclononane) is used to investigate donor-triggered intermediates. Compound La(InMe4)3 is the first crystallographically characterized homoleptic rare-earth-metal tetramethylindate and may readily be used as a precursor for follow-up chemistry distinct from La(AlMe4)3 and La(GaMe4)3.

تقنيات شبكات LoRa-Man المدمجة للتغلب على عدم وجود اتصال -خدمات الإنترنت لتطبيقات إنترنت الأشياء -تصميم مقترح جديد

This paper proposes a singular layout for a combined LoRa (Long Range) and MAN (Metropolitan Area Network) over the constraints of no-internet offerings for Internet of Things (IoT). The integration of LoRa generation with MAN network abilities pursuits to provide reliable verbal exchange in regions lacking traditional net infrastructure. The problem addressed in these studies is the dearth of net connectivity in faraway and underserved regions, which hinders the deployment and effectiveness of IoT packages. Current solutions often rely upon internet get right of entry to, making them unsuitable for no-internet situations. The primary aim of this look at is to discover the ability of mixing LoRa and MAN technology to enhance connectivity, reduce latency, and improve information transmission efficiency in IoT applications. by leveraging the long-range competencies of LoRa and the dynamic, of MAN, the proposed layout seeks to permit strong and reliable IoT networks in regions without internet get right of entry. The proposed solution includes growing a hybrid LoRa-MAN network structure that could operate independently of the internet. Key aspects of the layout include node sorts (sensor nodes, relay nodes, and sink nodes), network topology (mesh topology), verbal exchange protocols (routing and data transmission), and implementation techniques (simulation, testing, and real-global deployment). The successful integration of LoRa and MAN technologies has the potential to significantly enhance IoT applications in remote and underserved areas, where net connectivity is limited or unavailable. This research contributes to addressing the demanding situations of IoT in phrases of no-net offerings with the aid of providing a unique solution that combines the strengths of LoRa, MAN, and intranet services within organizations to meet the challenge of no-internet connectivity. Keywords: LoRa, Man (Metropolitan Area Network), IoT, no connectivity- Internet.

Modular dual-mobility constructs outperformed large femoral heads in 299 revision total hip arthroplasties at mid-term follow-up.

The purpose of this study was to directly compare the Modular Dual Mobility (MDM) Mobile Bearing Hip System (Stryker, USA) and large femoral heads (LFHs) in revision total hip arthroplasties (THAs) at mid-term follow-up, with specific emphasis on survival free of re-revision for dislocation, any re-revision, dislocation, and the risk of metal-related complications. We identified 299 revision THAs performed at a single tertiary care academic institution from March 2011 to July 2014. Aseptic loosening of the acetabular component (n = 65), dislocation (n = 58), and reimplantation as part of a two-stage exchange protocol (n = 57) were the most common reasons for index revision. MDM constructs were used in 123 cases, and LFHs were used in 176 cases. Mean age was 66 years (28 to 93), mean BMI was 31 kg/m2 (18 to 55), and 45% (n = 136) were female. Mean follow-up was seven years (2 to 12). The ten-year survival free of re-revision for dislocation was 99% (95% CI 95 to 100) in the MDM cohort and 91% (95% CI 84 to 96) in the LFH cohort, with a significantly increased risk of re-revision for dislocation in the LFH cohort (HR 7.1 (95% CI 1.3 to 40.8); p = 0.023). The ten-year survival free of any re-revision was 92% (95% CI 82 to 99%) in the MDM cohort and 84% (95% CI 74 to 90) in the LFH cohort with a significantly increased risk of any re-revision in the LFH cohort (HR 2.6 (95% CI 1.1 to 5.9); p = 0.024). The ten-year survival free of any dislocation was 95% (95% CI 85 to 99) in the MDM cohort and 87% (95% CI 78 to 92) in the LFH cohort with a significantly increased risk of any dislocation in the LFH cohort (HR 2.7 (95% CI 1.1 to 6.3); p = 0.028). There were no re-revisions or reoperations for metallosis or corrosion in the MDM cohort. In this head-to-head comparison, revision THAs with a MDM construct safely and effectively lowered the risk of re-revision for dislocation, any re-revision, and any dislocation compared to LFH at mid-term follow-up. There were no re-revisions or reoperations for metallosis or corrosion in the MDM cohort.

Editorial: Institutional Repository of the Kyiv Medical University: A New Open Access Database for Authors and Peer-Reviewed Journals

Open access repository is a database, or a virtual archive established to collect, disseminate and preserve scientific output like scientific articles and datasets and to make them freely available. An institutional repository is one of four types of repositories. The purposes of this article are (1) to highlight the most important points of the Regulation on the Institutional Repository of the Kyiv Medical University (IRKMU) and (2) to explain the advantages for authors and peer-reviewed journals of colonization of the repository of such type. Also, this paper highlights the experience of the Department of Oral and Maxillofacial Surgery and the Journal of Diagnostics and Treatment of Oral and Maxillofacial Pathology (JDTOMP) in depositing peer-reviewed articles in this repository. The Regulation on the IRKMU was put into effect by Order No. 29 of January 26, 2024. In the same year, all structural units of the university, including dental departments, joined the process of depositing their scientific and clinical works. The IRKMU was created using the open-source software DSpace, which supports the Open Access Initiative Protocol for Metadata Harvesting (OAI-PMH) data exchange protocol, allowing the repository to be integrated into the international registers of the Registry of Open Access Repositories (ROAR), Directory of Open Access Repositories (OpenDOAR), and other search engines. The article is reinforced with screenshots of the stages of depositing data of scientific works. Carlile Butterfield and colleagues (2022) emphasized, that despite all benefits, however, their research indicates that it can be difficult to encourage all faculties to upload the research reports onto the institutional repository. Moreover, the authors propose a potential route to maximize the number of publications that are uploaded to a university institutional repository. They utilize student workers and the resources of the institutional repository manager to get materials uploaded. The experience of our department consists in attracting a competent editor from the editorial staff of the JDTOMP with appropriate payment for services. In sum, colonizing this new institutional repository as a new database, authors and peer-reviewed journals can and will increase the visibility of their publications. Thus, it can bear fruit in terms of increasing the citation of articles and the journals as well.

Advance in Applied Cryptography Theory: Survey and Some New Results. Part 2. Keyless Cryptography

Actuality. The current paper is the second part of the paper “Advance in Applied Cryptography Theory: Survey and Some New Results. Part 1. Key Cryptography” published in the journal PTU, n.4, 2024. It is devoted to such specific area of applied cryptography as keyless one (KC\ Actuality of the current paper consists in the fact that considered in it methods allow to provide a confidentiality of information transmission over public communication channels, either without any its encryption in advance, executing a natural properties of communication channels or executing conventional key cryptography but with the keys which are elaborated before by means of KC. The natural properties of communication channels can be the following: additive noise, multiray wave propagation, MIMO technology and existence of feedback channel.Our paper starts with a consideration of Wyner’s concept of wire-tap channels and corresponding to it encoding and decoding methods providing very reliable information transmission over the main channels and negligible amount of information leaking over the wire-tap channels to eavesdroppers. Next it is investigated scenario with a commutative encryption (CE) and corresponding protocol of message exchange over ordinary noiseless public channel that provides security of encrypted information but without any key exchange between users in advance. It is proved which of well known symmetric and asymmetric ciphers are commutative or non-commutative ones. Next model concerns a fading channels under the application of Dean-Goldsmith protocol in frames of MIMO technology. We are proving that this protocol is secure if, and only if, the number of eavesdropper antennas is less than the number of antennas at legitimate users. Next scenario executes variable directional antennas (VDA) and it is proved for which conditions on a locations of legitimate users and eavesdroppers such approach occurs secure given the number of propagation rays is at least two.. We show in the next chapter that there is an attack compromising of recently proposed EVESkey cryptosystem and hence such one is not secure in spite of the statement of its authors.Finally, we investigate several protocols intended for key sharing over noiseless constant public channels (like Internet) and established that they are mostly insecure because have all zero secret capacity. Only one protocol based on matrix channel exchange is able to provide security of key sharing but in terms of the required breaking complexity. Thus such approach can be used only for the case when legitimate users belong to low level of security requirements.At the end of the paper we formulate several fundamental problems of applied cryptography which after of their solutions could be very useful for practice.

CAKE-PUF: A Collaborative Authentication and Key Exchange Protocol Based on Physically Unclonable Functions for Industrial Internet of Things

CAKE-PUF: A Collaborative Authentication and Key Exchange Protocol Based on Physically Unclonable Functions for Industrial Internet of Things

Multi-party key exchange scheme based on supertropical semiring

In an era where digital communication and data sharing are everywhere, ensuring the security of sensitive information is important. Cryptographic protocols are essential for establishing secure communication over potentially insecure networks. This paper introduces a novel three-party key exchange protocol based on a newly constructed supertropical semiring. By leveraging the unique algebraic properties of supertropical semirings, our protocol aims to provide enhanced security against known attacks on tropical based cryptographic schemes. We demonstrate the security and efficiency of our protocol through detailed analysis and examples, showing its robustness in protecting confidential information.

A tropical algebraic collatz conjecture based key exchange protocol for IoT environment

A tropical algebraic collatz conjecture based key exchange protocol for IoT environment

ПРОГРАМНА РЕАЛІЗАЦІЯ КРИПТОГРАФІЧНИХ ПРИМІТИВІВ

Developed on the C# platform (.NET Framework 5.0), which provides high flexibility in work, a program for performing operations (addition, multiplication, raising to the power of a large natural number, finding the inverse relatively to multiplication) on elements of extended finite fields and general linear groups over such fields. The general linear group is one of the well-known non-Abelian groups, the application of which is actively studied in the field of post-quantum cryptography. Using these operations, a number of cryptographic primitives have been implemented: the well-known Diffie-Hellman, Stickel secret key exchange protocols, and recently proposed generalizations of the Lizama-Romero protocol and the Kanwal-Ali asymmetric cryptosystem. The program allows you to explore the features of known and verify new cryptographic primitives. Using it, the trustiness of the two mentioned new primitives for different values of parameters was confirmed. Key words: finite field, general linear group, cryptographic primitive

ПРОГРАМНА РЕАЛІЗАЦІЯ КРИПТОГРАФІЧНИХ ПРИМІТИВІВ

Developed on the C# platform (.NET Framework 5.0), which provides high flexibility in work, a program for performing operations (addition, multiplication, raising to the power of a large natural number, finding the inverse relatively to multiplication) on elements of extended finite fields and general linear groups over such fields. The general linear group is one of the well-known non-Abelian groups, the application of which is actively studied in the field of post-quantum cryptography. Using these operations, a number of cryptographic primitives have been implemented: the well-known Diffie-Hellman, Stickel secret key exchange protocols, and recently proposed generalizations of the Lizama-Romero protocol and the Kanwal-Ali asymmetric cryptosystem. The program allows you to explore the features of known and verify new cryptographic primitives. Using it, the trustiness of the two mentioned new primitives for different values of parameters was confirmed. Key words: finite field, general linear group, cryptographic primitive

On implementation of Stickel's key exchange protocol over max-min and max-T semirings

Abstract Given that the tropical Stickel protocol and its variants are all vulnerable to the generalized Kotov–Ushakov attack, we suggest employing the max-min semiring and, more generally, max- T T semiring where the multiplication is based on a T T -norm, as a framework to implement the Stickel protocol. While the Stickel protocol over max-min semiring or max- T T semiring remains susceptible to a form of Kotov–Ushakov attack, we demonstrate that it exhibits significantly increased resistance against this attack when compared to the tropical (max-plus) implementation.

A secure key exchange protocol for Industrial Internet of Things based on tropical triad matrix semiring

A secure key exchange protocol for Industrial Internet of Things based on tropical triad matrix semiring

Efficacy of a Standardized Regimen of Therapeutic Plasma Exchange and IVIG for Treatment of Antibody-Mediated Rejection in Lung Transplant Recipients.

Antibody-mediated rejection (AMR) in lung transplantation has been associated with poor long-term clinical course and is a risk factor for chronic lung allograft dysfunction and graft loss. Appropriate management of AMR is necessary to improve graft survival in lung transplant recipients. There is currently no standardized approach to the treatment of lung AMR, and practices vary by institution. We sought to examine the efficacy of a standardized protocol of plasma exchange (PLEX) and IVIG in decreasing donor-specific antibodies (DSAs) and improving AMR in lung transplant recipients. A retrospective chart review was conducted on all lung transplant recipients who completed a course of PLEX per UT Southwestern AMR protocol between January 2012 and December 2019 for diagnosis of AMR. Data were collected on the patient clinical course, treatment regimen, pre-PLEX DSA, post-PLEX DSA, follow-up (> 1-month post-PLEX) DSA, and pre-and post-PLEX biopsy, when available. Of 527 patients who underwent lung transplantation during the study period, 56 (11%) received an acute course of PLEX every other day per protocol for AMR of lung transplant. Forty (71%) of 56 patients had one episode of AMR requiring PLEX; 16 patients (29%) had repeat episodes of AMR within 6 weeks to 47 months of the first episode. Most patients showed improvement in AMR on biopsy (69%) and a decline in DSA (68%). Our data suggest that treatment with combined PLEX and IVIG protocol appears effective for treating lung AMR.

Calcium has a direct effect on thick filament activation in porcine myocardium.

Sarcomere activation in striated muscle requires both thin filament-based and thick filament-based activation mechanisms. Recent studies have shown that myosin heads on the thick filaments undergo OFF to ON structural transitions in response to calcium (Ca2+) in permeabilized porcine myocardium in the presence of a small molecule inhibitor that eliminated active force. The changes in X-ray diffraction signatures of OFF to ON transitions were interpreted as Ca2+ acting to activate the thick filaments. Alternatively, Ca2+ binding to troponin could initiate a Ca2+-dependent crosstalk from the thin filament to the thick filament via interfilament connections such as the myosin binding protein-C. Here, we exchanged native troponin in permeabilized porcine myocardium for troponin containing the cTnC D65A mutation, which disallows the activation of troponin through Ca2+ binding to determine if Ca2+-dependent thick filament activation persists in the absence of thin filament activation. After the exchange protocol, over 95% of the Ca2+-activated force was eliminated. Equatorial intensity ratio increased significantly in both WT and D65A exchanged myocardium with increasing Ca2+ concentration. The degree of helical ordering of the myosin heads decreased by the same amount in WT and D65A myocardium when Ca2+ concentration increased. These results are consistent with a direct effect of Ca2+ in activating the thick filament rather than an indirect effect due to Ca2+-mediated crosstalk between the thick and thin filaments.

Elliptic curve cryptography: Theory, security, and applications in modern network security

Abstract. Due to the swift advancement of Internet and computer technology in the 21st century, the demand for network security is increasing. Classic cryptographic algorithms like Rivest-Shamir-Adleman (RSA) and Digital Signature Algorithm (DSA) are insufficient in the face of modern network environments, while elliptic curve cryptography (ECC) has become a research hotspot due to its high security and high efficiency. The purpose of this paper is to discuss the theoretical basis, security analysis, and practical application cases of elliptic curve cryptography, to provide readers with a comprehensive understanding and trigger further research and thinking. This paper analyzes the theoretical basis of ECC, including group theory, domain theory, and the definition and properties of elliptic curves, and analyzes the application of ECC in combination with practical application cases, such as the SM2 algorithm. The article first introduces the concept of groups, the definition of domains, and the basic properties of elliptic curves. Then, the security of ECC is analyzed, especially the complexity of the Elliptic Curve Discrete Logarithm Problem (ECDLP) and the selection of key length. In addition, the security of ECC in practical applications is discussed, including digital signatures, key exchange protocols, and applications in blockchain technology. The results show that ECC provides comparable security to traditional public key algorithms at a short key length, and shows strong security and efficiency in practical applications. As technology progresses and new threats arise, research in ECC will also evolve.

MODRED: A code-based non-interactive key exchange protocol

How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interactive error reconciliation mechanism is presented and applied to MODRED, which enables the two sides of communication to “approximately agree” on the shared key. This is of great significance because it may lead to a more generic framework construction. Furthermore, our proposal is competitive and practical. We provide an initial choice of parameters for MODRED, tailored to 120-bit post-quantum security level, yielding the public keys of less than 1.2 MBs.

Decentralized Machine Learning Framework for the Internet of Things: Enhancing Security, Privacy, and Efficiency in Cloud-Integrated Environments

The Internet of things (IoT) presents unique challenges for the deployment of machine learning (ML) models, particularly due to constraints on computational resources, the necessity for decentralized processing, and concerns regarding security and privacy in interconnected environments such as the Internet of cloud. In this paper, a novel decentralized ML framework is proposed for IoT environments characterized by wireless communication, dynamic data streams, and integration with cloud services. The framework integrates incremental learning algorithms with a robust decentralized model exchange protocol, ensuring that data privacy is preserved, while enabling IoT devices to participate in collaborative learning from distributed data across cloud networks. By incorporating a gossip-based communication protocol, the framework ensures energy-efficient, scalable, and secure model exchange, fostering effective knowledge sharing among devices, while addressing the potential security threats inherent in cloud-based IoT ecosystems. The framework’s performance was evaluated through simulations, demonstrating its ability to handle the complexities of real-time data processing in resource-constrained IoT environments, while also mitigating security and privacy risks within the Internet of cloud.

Determining optimal parameters of algebraic fractals in zero-knowledge authentication protocols

Most information systems, especially on the Internet, have a distributed architecture with remote access and an insecure communication channel. In such systems, the tasks of permanent authorization mean implementing time intervals of user work without re-authentication are especially actual. The problem is that repeatedly sending a password increases the likelihood of it corruption. One solution is to use zero-knowledge protocols. In these protocols, passwords are not transmitted over the channel but are included in the algorithms as parameters. However, the computational complexity, as well as the finite number of passwords, limit their use, ensuring the relevance of further research. Focusing on object of the exchange protocols security, the use of algebraic fractal sets has been proposed as a potentially infinite source of data for passwords. In this work, algorithms were developed, implemented, and tested, which proved the higher reliability of fractal protocols in comparison with the reference generator of random bits (with an error probability of 0.5). It was also noted that the calculation operations have an insignificant influence on the overall time complexity of the exchange protocol as a whole. Practical recommendations for the use of fractals with a Hausdorff dimensionally of about 1.6 on the boundary of the Mandelbrot set are given. The paper also highlights the advantages of including color information in fractal sets, which gives about 3 times improving of confidential security indicators of communication protocol. The proposed algorithms do not require specialized software and can be implemented in the majority of network information systems as an additional module.