31-03-2014, 03:46 PM
SECURE MAILING SYSTEM
SECURE MAILING.pptx (Size: 1.79 MB / Downloads: 16)
INTRODUCTION
The project entitled SECURE MAILING SYSTEM will consist of “A Public Mailing Web Site”.
The website will be accessible to all. New Users can sign up by entering their basic details on the website and making their account to create their username and password.
Existing Users can use their username and password to access their respective accounts. They can send and receive mails. Users can manage their mails in the Inbox, Drafts, Trash and several other folders.
An interface will be created so that the user can easily manage their respective accounts.
Users will be having an additional facility to discuss various problems on the forums section that would be made available to the users on the website.
PROJECT AIMS
The project aims to create a public mailing system that can securely send and receive email messages for all users who wish to sing up. It is open to all and anyone can sign up for the website to create their own email id’s and then use the id to send emails over the internet. Also we have implemented security algorithms on the email system, over the ones already provided in the POP3 Protocols. These provide an added layer of security to our emails which allows two users to share a private encryption key between them so that their emails can then be encrypted. Thus we have added an extra layer of security in our email system using RSA Algorithm to allow encrypted conversations between users.
RSA ALGORITHM
The RSA algorithm involves three steps: key generation, encryption and decryption.
KEY GENERATION
RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted in a reasonable amount of time using the private key. The keys for the RSA algorithm are generated the following way:
1. Choose two distinct prime numbers p and q.
For security purposes, the integers p and q should be chosen at random, and should be of similar bit-length. Prime integers can be efficiently found using a primality test.
2.Compute n = pq.
n is used as the modulus for both the public and private keys. Its length, usually expressed in bits, is the key length.
3.Choose an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e. e and φ(n) are coprime.
e is released as the public key exponent.
4.Determine d as d−1 ≡ e (mod φ(n)), i.e., d is the multiplicative inverse of e (modulo φ(n)).
This is more clearly stated as solve for d given de ≡ 1 (mod φ(n))
FUNCTIONAL COMPONENTS
New User can sign up by entering his information and creating username and password to get access to a new account.
Existing Users can use their username and password to login to their accounts.
User can send mail to anyone across the world in encrypted form and can attach any file.
User can receive the mails and decrypt by the corresponding secure key to read the message.
User can manage his mails through various folders like Inbox, Sent mails, Trashed Items etc.
Users can interact among themselves and discuss on various topics in different forums maintained on the website.