Skip to Main Content
The RSA algorithm proposed by Rivest, Shamir and Adleman as a public key cryptosystem is used in different communication networks in order to ensure data confidentiality. Different weaknesses of this algorithm could be observed and many attacks against it are developed successfully. Improving this algorithm was performed in this paper in order to ensure a higher data security and an increased computing process speed. We propose an optimized encryption method which may be associated with the RSA key generation mechanism. The proposed method is based on a detailed analysis of the algebraic finite fields (AFF). The improved algorithm can be implemented on new generation networks (second generation networks and so on) and applies to wireless networks with Bluetooth devices which need an increased security by enlargement of the utilization area. In the same time, we have used a maximum acceptable length encryption key and algorithm complexity, which increases the computing speed and security degree, but allows the processor to work properly.