Encryption by Pairing
Abstract
Introduction: Studying the mathematical problems which underlie modern public-key cryptosystems has led to a significant increase in the lengths of the keys and, consequently, to an increase in the computational complexity of encryption and decryption. Purpose: The goal is to create cryptosystems based on new mathematical challenges which would have more computationally efficient encryption and decryption, and cryptographic resistance higher than that of the existing systems. Results: We proved that it is possible to create cryptosystems based on bilinear pairing, and gave examples of such systems based on large integer factorization and on discrete logarithms. The essence of this approach is to increase the speed of encryption and decryption of messages using pairing in local fields, with a high reliability of the obtained systems. Cryptanalysis of the proposed systems showed that the complexity of compromising either of them is equivalent to the complexity of compromising RSA cryptosystem as these systems are based on the same computationally hard problem. Practical relevance: The developed cryptographic systems can be used in applications for protecting software or in electronic signature systems.Published
2016-06-01
How to Cite
Abramov, A., & Vostokova, E. (2016). Encryption by Pairing. Information and Control Systems, (3), 79-84. https://doi.org/10.15217/issn1684-8853.2016.3.79
Issue
Section
Information coding and transmission