Seminar Presentation

On Address book and applying security algorithm

PURPOSE OF THE PROJECT

The Address Book is a free, open source contact management system. It is designed for private use by a single user, or to be shared within a larger organization, such as a club, church, or just a group of friends. Also, one of its primary goals is to take advantage the Internet's global connectivity to access contact information from virtually anywhere in the world that has a connection to the World Wide Web.

PROJECT SCOPE

Utilizes the combined power of PHP scripting and MySQL databases Flexible, robust system allows you to add a virtually unlimited number of addresses, phone numbers, and any other type of information to contacts Administration and user-level accounts to share contact information securely with clubs, organizations, co-workers, or friends. Organize contacts to one or more groups for selected listings. Display upcoming birthdays, allowing early preparation for gifts and parties. Support for languages other than English.

Modules of our project:

Addition of new contacts.

Editing the contacts. Removing the contact details. Searching the contact Viewing the contact details Online calendar maintenance. Notes, tasks and documentation.

Mailing option.
Messages on mobile Scratch pad option.

Mugshot option.
Picture uploading option. Exporting the contacts

Data FlowDiagram
6

E-R DIAGRAM

Why Message Authentication?

Message authentication is important where undetected manipulation of messages can have disastrous effects. Examples include Internet Commerce and Network Management.

Message Authentication Using Plain Encryption

Use of Encryption for MAC

10

Message Authentication with Hash Functions using Conventional Encryption

11

Message Authentication with Hash Functions using Public Key Encryption

12

What is a hash function?

A hash function H is a transformation that takes an input m and returns a fixed-size string, which is called the hash value h (that is, h = H(m)). Hash functions with just this property have a variety of general computational uses, but when employed in cryptography, the hash functions are usually chosen to have some additional properties.
13

Requirements for Cryptographic Hash Functions

The basic requirements for a cryptographic hash function are as follows.
The input can be of any length. The output has a fixed length. H(x) is relatively easy to compute for any given x. H(x) is one-way. H(x) is collision-free.

14

H(x) is one-way ...

A hash function H is said to be one-way if it is hard to invert, where ``hard to invert'' means that given a hash value h, it is computationally infeasible to find some input x such that H(x) = h.

15

Hash Functions as Message Digests

The hash value represents concisely the longer message or document from which it was computed; this value is called the message digest. One can think of a message digest as a ``digital fingerprint'' of the larger document. Examples of well known hash functions are MD2 and MD5 and SHA

16

MD5 Steps
The following five steps are performed to compute the message digest of the message. Step 1. Append Padding Bits Step 2. Append Length Step 3. Initialize MD Buffer Step 4. Process Message in 16-Word Blocks Step 5. Output

17

Step 1. Append Padding Bits

The message is "padded" (extended) so that its length (in bits) is congruent to 448, modulo 512. That is, the message is extended so that it is just 64 bits shy of being a multiple of 512 bits long. Padding is always performed, even if the length of the message is already congruent to 448, modulo 512.

18

Padding is performed as follows: a single "1" bit is appended to the message, and then "0" bits are appended so that the length in bits of the padded message becomes congruent to 448, modulo 512. In all, at least one bit and at most 512 bits are appended.
19

Step 2. Append Length

A 64-bit representation of b (the length of the message before the padding bits were added) is appended to the result of the previous step. In the unlikely event that b is greater than 2^64, then only the loworder 64 bits of b are used. (These bits are appended as two 32-bit words and appended low-order word first in accordance with the previous conventions.)
20

Step 3. Initialize MD Buffer

A four-word buffer (A,B,C,D) is used to compute the message digest. Here each of A, B, C, D is a 32-bit register. These registers are initialized to the following values in hexadecimal, loworder bytes first):
21

Step 4. Process Message in 16-Word Blocks (4 Rounds)

22

Step 4. Continued (4 Rounds)

23

Step 5. Output
The message digest produced as output is A, B, C, D. That is, we begin with the low-order byte of A, and end with the high-order byte of D.

24

Test Case < Validate Conductor >

S.No

Description Conductor entered registered Conductor_id and correct password

Expected Result

Actual Result

Status

Access Granted 1

Access Granted Pass

Conductor entered unregistered Conductor_id and correct Password Access Denied 2 Access Denied Pass

Conductor entered unregistered Conductor_id and wrong password Access Denied 3 Access Denied Pass

Conductor entered registered Conductor_id and wrong password Access Denied 4 Access Denied Pass

Conductor entered Conductor_id which does not start with an alphabet. Invalid Conductor_id 5 Invalid Conductor_id Pass

31

SNAP SHOTS

32

33

34

35

36

37

38

CONCLUSION
The system has successfully does the job of providing training to the user of the site. The expert panel suggestion and the impartment of training by the academician are scheduled properly to make every participant useful and successful. This feature is more powerful to skim the knowledge acquired by the users. There is a mine of gold which can fetch the users the technical feast by the system in the form of User Groups. The user groups contain technically expert solution and unsolved puzzle. MD5 algorithm is proved effective in the encryption and the confidentiality. It makes use of the hashing technique. So it is better to 39 implement.

THANK YOU
QUERIES IF ANY???

40