A fast approach to determine co-primality of two positive integer numbers

Modern cryptographic algorithm relies heavily on number theory and its various principles. In accordance to the time, the main emphasis has been on increasing the security quotient of the algorithm while keeping the operational cost minimum. Necessity of security algorithms is to maintain safety of business transactions and financial applications. RSA Algorithm is the most widely used cryptographic algorithm based on public-key cryptography, owing to its properties like: data secrecy, integrity and safety. The resources and time taken by encryption and decryption using RSA proves expensive. The security in RSA is maintained by using the prime and co-prime numbers. Presently Euclid´s Algorithm is used to calculate co-primality between two positive integer numbers. This paper proposes the design and implementation of a novel and fast approach to deduce the co-primality between two positive integer numbers.