Application of Bio-inspired Algorithms to the Cryptanalysis of Asymmetric Ciphers on the Basis of Composite Number

In some cases, the confidentiality of cryptographic algorithms used in digital communication is related to computational complexity mathematical problems, such as calculating the discrete logarithm, the knapsack problem, decomposing a composite number into prime divisors etc. This article describes the application of insolvability of factorization of a large composite number, and reviews previous work integer factorization using either the deterministic or the bio-inspired algorithms. This article focuses on the possibility of using bio-inspired methods to solve the problem of cryptanalysis of asymmetric encryption algorithms, which ones based on factorization of composite numbers. The purpose of this one is to reviewing previous work in integer factorization algorithms, developing a prototype of either the deterministic and the bio-inspired algorithm and the effectiveness of the developed algorithms and recommendations are made for future research paths.

I. Introduction

For secure Internet communication, for example to protect transactions and prevent unauthorized access to information on the Internet, websites use a kind of unique digital signature-a TLS certificate or its previous one SSL. The reliability of which is carried out using asymmetric cryptography for authentication and key exchange; symmetric encryption to ensure confidentiality; messages with authentication codes to ensure their integrity. It should be noted that TLS is approved by the IETF and described in RFC 5246, according to which the two sides of the connection establish an RSA-based «preliminary master secret» (PMC) without exchanging the actual value in clear text.