Fast secure calculation of the open key cryptography procedures for IoT in clouds

The article proposes a method for accelerating the implementation of cryptographic data protection mechanisms on embedded IoT terminal microcontrollers, the basic operation of which is the modular exponentiation of high-capacity numbers. The method is based on the use of remote computer systems to speed up calculations and provides protection against the reconstruction of the secret keys of cryptosystems from data transmitted to the cloud. It has been theoretically and experimentally proven that the method allows, on average, 50 times, to speed up the implementation of cryptographic data protection protocols in IoT while providing a level of security sufficient for most practical applications

Organization of parallel execution of modular multiplication to speed up the computational implementation of public-key cryptography

The article theoretically substantiates, investigates and develops a method for parallel execution of the basic operation of public key cryptography - modular multiplication of numbers with high bit count. It is based on a special organization of the division of the components of modular multiplication into independent computational processes. To implement this, it is proposed to use the Montgomery modular reduction. The described solution is illustrated with numerical examples. It has been theoretically and experimentally proven that the proposed approach to parallelization of the arithmetical process of modular multiplication makes it possible to speed up this important for cryptographic tasks operation by 5-6 times

Organization of protected filtering of images in clouds

The article proposes an approach to using cloud technologies to accelerate the filtering of image streams while ensuring their protection during processing on remote computer systems. Homomorphic encryption of images during their remote filtering is proposed to be carried out by shuffling rows of pixel matrices. This provides a high level of protection against attempts to illegally restore images on computer systems that filter them. The developed approach makes it possible to speed up the performance of this important image processing operation by 1-2 orders of magnitude

Zero-knowledge identification of remote users by utilization of pseudorandom sequences

The article theoretically substantiates, proposes and investigates an identification scheme based on the concept of "zero knowledge" using irreversible generators of pseudorandom bit sequences. Session passwords form a chain generated by selective sequence values. Secondary identification sessions are provided in the proposed scheme to counter attacks with the displacement of one of the remote interaction parties. The main elements of the proposed identification scheme are developed in detail: authorization procedures, primary and secondary identification

Synchronization Error Correction for Asynchronous Channels Data Transmission

Loss of synchronization is a common source of errors in asynchronous data channels. Minute differences in the operating frequencies between the transmitter and the receiver result in data bits being lost or false bits being inserted. This paper presents an innovative technique, especially designed for detecting and correcting errors of this type. Data packets are preprocessed and areas that are susceptible to are determined. Suitable redundancy is introduced in the form of control symbols. On the receiver side, similar calculations take place and decisions are made on the occurrence and positions of the transmission errors due to loss of synchronization, which are hence corrected. The proposed method is computationally simple, since it uses a small number of simple mathematical operations, contrary to existing, general purpose techniques. The transmission overheads it imposes do not vary significantly from existing error control codes. Additionally, the number of errors that may be corrected is not subject to the same limits as existing techniques

A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations

This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation. The proposed approach is based on using finite field arithmetic to replace the usual modular arithmetic. The application of this efficient method that was developed using Galois Fields, renders feasible an exponential reduction of the computation time required for classical zero knowledge identification methods, such as FFSIS, Schnorr and Guillou & Quisquater. The new method for user registration and identification procedure for obtaining access to the system, are illustrated. It is shown, both theoretically and experimentally that the proposed method attains a per order acceleration of the execution time required for the user identification by 2 – 3 orders of magnitude, via a hardware implementation

A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations

This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation. The proposed approach is based on using finite field arithmetic to replace the usual modular arithmetic. The application of this efficient method that was developed using Galois Fields, renders feasible an exponential reduction of the computation time required for classical zero knowledge identification methods, such as FFSIS, Schnorr and Guillou & Quisquater. The new method for user registration and identification procedure for obtaining access to the system, are illustrated. It is shown, both theoretically and experimentally that the proposed method attains a per order acceleration of the execution time required for the user identification by 2 – 3 orders of magnitude, via a hardware implementation

A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations

This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation. The proposed approach is based on using finite field arithmetic to replace the usual modular arithmetic. The application of this efficient method that was developed using Galois Fields, renders feasible an exponential reduction of the computation time required for classical zero knowledge identification methods, such as FFSIS, Schnorr and Guillou & Quisquater. The new method for user registration and identification procedure for obtaining access to the system, are illustrated. It is shown, both theoretically and experimentally that the proposed method attains a per order acceleration of the execution time required for the user identification by 2 – 3 orders of magnitude, via a hardware implementation