Imran Alam - Academia.edu (original) (raw)
Related Authors
College of Computer Science & Engineering, Taibah University, Madinah, Saudi Arabia
Uploads
Papers by Imran Alam
IARJSET
Nowadays security is very important to protect our sensitive information in computer or over the ... more Nowadays security is very important to protect our sensitive information in computer or over the internet such as in online banking, online shopping, stock market and bill payments etc. Without security our information exchanged over internet are not safe. Encryption Algorithms provides the security to the information which is exchanged over the internet. In this project we are proposing a new cryptographic algorithm AEDS (Advanced Encryption and Decryption Standard) which is developed by combining properties of DES and AES algorithms. Then we compared all these three algorithms and we found that AEDS is more secure and robust for data security.
RSA encryption and decryption algorithm talks about secrecy of messages between two users. It inv... more RSA encryption and decryption algorithm talks about secrecy of messages between two users. It involves a public key and a private key generation. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. The private key is not publicly known, it is only known to receiver so that she/he can decrypt the encrypted message. These keys (public and private keys) for the RSA algorithm are generated using some mathematical operations. The principal goal of design of any encryption algorithm must be security against unauthorized attacks. Within the last decade, there has been a vast increase in the accumulation and communication of digital computer data in both the private and public sectors. Much of this information has a significant value, either directly or indirectly, which requires protection. RSA is an Asymmetric key cryptography which provides security against unauthorized attacks. Problem Definition What is RSA Algorithm and mathematics behind it ? RSA Algorithm: Some idea of RSA algorithm has been given in abstract above. You may refer that again for more information. The encryption and decryption in the RSA algorithm as follows: First, I had to generate the key pair and then those keys were to be used for encryption and decryption. Key generation RSA involves a public key and a private key. The mathematics behind RSA algorithm is as follows: Mathematics behind RSA Firstly two distinct prime numbers 'p' and 'q' need to be generated between the range 64 to 127. The reason for choosing prime numbers between this range is : (i) Both primes have to be of similar bit-length. (ii) Since these primes are converted into binary while doing encryption of the message, and then some general operations are performed on these binary numbers, selection of large range of primes was not done because their binary conversions may get out of range and thus may create problems in further calculations. .1. After this a number n is computed which is equal to pq. (n = pq) o This n is used as the modulus for both the public and private keys 2. Then I computed phi(n) = (p – 1)(q – 1). 3. I choose an integer public exponent e such that 1 < e < phi(n) and greatest common divisor of (e, phi(n)) = 1; i.e e and phi(n) are co-prime. We use here some functions such gcd (int , int) to return exponent e and gcd2(int , int) to find out gcd of two numbers. (gcd() and gcd2() are the functions used in the original program code of the algorithm, code can be made available on request.)
IARJSET
Nowadays security is very important to protect our sensitive information in computer or over the ... more Nowadays security is very important to protect our sensitive information in computer or over the internet such as in online banking, online shopping, stock market and bill payments etc. Without security our information exchanged over internet are not safe. Encryption Algorithms provides the security to the information which is exchanged over the internet. In this project we are proposing a new cryptographic algorithm AEDS (Advanced Encryption and Decryption Standard) which is developed by combining properties of DES and AES algorithms. Then we compared all these three algorithms and we found that AEDS is more secure and robust for data security.
RSA encryption and decryption algorithm talks about secrecy of messages between two users. It inv... more RSA encryption and decryption algorithm talks about secrecy of messages between two users. It involves a public key and a private key generation. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. The private key is not publicly known, it is only known to receiver so that she/he can decrypt the encrypted message. These keys (public and private keys) for the RSA algorithm are generated using some mathematical operations. The principal goal of design of any encryption algorithm must be security against unauthorized attacks. Within the last decade, there has been a vast increase in the accumulation and communication of digital computer data in both the private and public sectors. Much of this information has a significant value, either directly or indirectly, which requires protection. RSA is an Asymmetric key cryptography which provides security against unauthorized attacks. Problem Definition What is RSA Algorithm and mathematics behind it ? RSA Algorithm: Some idea of RSA algorithm has been given in abstract above. You may refer that again for more information. The encryption and decryption in the RSA algorithm as follows: First, I had to generate the key pair and then those keys were to be used for encryption and decryption. Key generation RSA involves a public key and a private key. The mathematics behind RSA algorithm is as follows: Mathematics behind RSA Firstly two distinct prime numbers 'p' and 'q' need to be generated between the range 64 to 127. The reason for choosing prime numbers between this range is : (i) Both primes have to be of similar bit-length. (ii) Since these primes are converted into binary while doing encryption of the message, and then some general operations are performed on these binary numbers, selection of large range of primes was not done because their binary conversions may get out of range and thus may create problems in further calculations. .1. After this a number n is computed which is equal to pq. (n = pq) o This n is used as the modulus for both the public and private keys 2. Then I computed phi(n) = (p – 1)(q – 1). 3. I choose an integer public exponent e such that 1 < e < phi(n) and greatest common divisor of (e, phi(n)) = 1; i.e e and phi(n) are co-prime. We use here some functions such gcd (int , int) to return exponent e and gcd2(int , int) to find out gcd of two numbers. (gcd() and gcd2() are the functions used in the original program code of the algorithm, code can be made available on request.)