50120140504016

130
-1

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
130
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

50120140504016

  1. 1. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 150 SECURED PATTERN BASE ENCRYPTION APPROACH FOR INTRANET CHAT SERVER FOR WIRED NETWORK OmarAbdulmagedHammood, Dr. AliMakkiSagheer*, Mr. Surya PrakashMishra** Department of Computer Science, ALTURATH UNIVERSITY, BAGHDAD IRAQ -10001 *Department of Computer Science, ALANBAR UNIVERSITY, ALANBAR,IRAQ -31001 **Department of Computer Science & Information Technology, SHEPHERD SCOOL OF ENGINEERING & TECHNOLOGY / SHIATS, Allahabad (U.P.) INDIA-211007. ABSTRACT A system server for a channel-based network including one or more Internet sites and one or more user terminals. The system server includes a channel table database storing a master channel table that includes a list of channel numbers, each channel number having an associated Internet address and an associated Internet site name. Each Internet site of the network is addressable by an associated Internet address stored in the master channel table. The system server includes a network database and an update manager database. The system server identifies each user terminal requesting service by comparing transmitted identification information with authorized user information stored in the network database. The system server also compares a channel table version number from the requesting user terminal with a version number stored in the update manager database that is associated with the master channel table, and notifies each requesting user terminal when updated channel table information is available. At each user terminal, a user reads the channel numbers and associated Internet site names from a menu displaying the downloaded channel table, selects an Internet site name from the displayed menu, and enters the channel number associated with the selected Internet site name using an input device that is similar to a television remote control. INTRODUCTION The goal of this thesis is to present a novel and systematic approach to a P2P (Point-to point) non-repudiation and adaptive-multimedia-based communication. A non-reputable communication often involves a transparent mechanism through which, no party involved in the communication can deny having participated in the whole or a part of the communication Therefore security is one of the key points being considered in this thesis. As traffic between involved parties is multimedia-enabled, INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) ISSN 0976 – 6367(Print) ISSN 0976 – 6375(Online) Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME: www.iaeme.com/ijcet.asp Journal Impact Factor (2014): 8.5328 (Calculated by GISI) www.jifactor.com IJCET © I A E M E
  2. 2. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 151 (including voice, text, file-sharing.) In the past few years, local computer networks for the interconnection of computers and shared resources within a small area such as a building or a campus have rapidly increased in popularity. These networks support applications such as file transfers and electronic mail between autonomous computers. They shared the use of large computers and expensive peripherals, and distributed computation. Typically, these networks have bandwidths in the range 0.1-10 Mbps and span distances of 0.1-10 km. Interest has focused on the use of local computer networks for voice and other real-time applications. A local computer network can be used to support voice communications (in addition to data traffic)., thereby supplementing or eliminating the internal telephone exchanges (PBX"s) currently used in offices and campuses. New levels of functionality can be achieved by the integration of digitized voice into data systems such as text editors and electronic mail systems. In this paper we present the results of some measurements aimed at evaluating the feasibility of a 3 Mbps experimental Ethernet located at the Xerox Palo Alto Research Centers., for packet-voice applications. These measurements show that, within certain bounds. The network can be used to carry voice traffic successfully. These results can also be used to validate theoretical models which can then be used to predict the performance of other implementations of Ethernet like architectures, Traditionally, several methods can be used to encrypt data streams, all of which can easily be implemented through software, but not so easily decrypted when either the original or its encrypted data stream are unavailable. (When both source and encrypted data are available, code-breaking becomes much simpler, though it is not necessarily easy). Architecture Design The purpose of this document is to provide an architectural design for the Text / Voice server. The design will show the presentation tier, the middle tier consisting of classes, sequence diagrams, and the data tier consisting of the database design diagram. Figure 1: Cloud Implementation model
  3. 3. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 152 TYPES OF CRYPTOGRAPHIC ALGORITHMS There are several ways of classifying cryptographic algorithms. For purposes of this report they will be categorized based on the number of keys that are employed for encryption and decryption, and further defined by their application and use. The following are the three types of Algorithm that are discussed * Secret Key Cryptography (SKC): Uses a single key for both encryption and decryption * Public Key Cryptography (PKC): Uses one key for encryption and another for decryption * Hash Functions: Uses a mathematical transformation to irreversibly "encrypt" information Figure 2: Three types of cryptography: secret-key, public key, and hash function Website Functions This website will allow access only to authorized users with specific roles (administrator, user) depending upon user’s role, he/she will be able to access only specific modules of the system. A summary of the major functions that the website will perform are as follows:- Login facility for enabling only authorized access to the system. - User will be able to request/accept the selected entries from the list - Administrator will be able to add/modify/delete/update and alter data (i.e. product details) at the back-end as per the requirements. - Administrator will be responsible for managing user account.
  4. 4. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. REGISTER TO BE A MEMBER: photographs. PROFILE: Logged users can see their details and if they wish to chang they can edit it. FRIENDZ: Logged users can see their friend list and if they wish to add friends. SCRAPBOOK: This module enables the user to send the scarps to their friends. TESTIMONIAL: This module enables the user to send the PHOTO GALLERY: This module enables the user to upload the photos to their photo gallery and mention their album. Figure International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 153 REGISTER TO BE A MEMBER: Logged users can EDIT their PROFILE, and upload the Logged users can see their details and if they wish to change any of their information Logged users can see their friend list and if they wish to add friends. This module enables the user to send the scarps to their friends. This module enables the user to send the testimonial to their friends. This module enables the user to upload the photos to their photo gallery and Figure 3: The Pattern Matching Process International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), Logged users can EDIT their PROFILE, and upload the e any of their information testimonial to their friends. This module enables the user to upload the photos to their photo gallery and
  5. 5. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 154 Figure 4: Process to recognize 4.1 Result The application will be defined for text or voice communications, this has been done by using security key basis as encryption and decryption, the key will be modulated by the crypto-graphical model, the encryption has been done by encrypted model, by using this model the system is generated the communication channel for message sending and receiving, the automated system generated by encrypted environment so that the system will be secured. 4.2 DISCUSSION Two very different groups of techniques are known in the domain of string pattern matching. One deals with exact string pattern matching, while the other deals with partial or incomplete string pattern matching. The latter group addresses automatic word correction and the identification of typographic errors. Assuming that the pattern length is no longer than the unit memory size of the machine, the shift-or algorithm is an efficient algorithm that adapts easily to a wide range of approximate string matching problems. This algorithm is based on finite automata theory, such as the Knuth-Morris-Pratt algorithm, and exploits the finiteness of the alphabet, as in the Boyer-Moore algorithm.In pattern recognition works, genetic algorithms are widely used to identify occurrences of complex patterns, although they are regarded primarily as a problem-solving method. Genetic algorithms are based on ideas from population genetics; they feature populations of genotypes (characteristics of an individual) stored in memory, differential reproduction of these genotypes, and variations that are created in a manner analogous to the biological processes of mutation and crossover. Genetic algorithms are powerful tools for solving complex pattern-matching problems, especially when the matching is incomplete or inexact or when it occurs on repetitive patterns separated by unmatched patterns, as it can be in searches for long DNA sequences that take into account possible alterations, from single deletions or insertions to crossovers.Most exact string pattern-matching algorithms are easily adapted to deal with multiple string pattern searches or with wildcards. We present the full code and concepts underlying two major different classes of exact string search pattern algorithms, those working with hash tables and those based on heuristic skip tables. Exact string matching consists of finding one or, more generally, all of the occurrences of a
  6. 6. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 155 pattern in a target. The algorithmic complexity of the problem is analyzed by means of standard measures of the running time and amount of memory space required by the computations. SUMMARY AND CONCLUSION Automatically scanning a message for certain information according to predefined rules; setting a security attribute to a voice channel security level (VCSL) associated with the message when the certain information is present, the certain information including one or more words, phrases, or addresses that satisfy the predefined rules, storing the message in a mailbox of a recipient in the UMS, receiving a request from the recipient to listen to the message over a voice communication channel, encrypting the voice communication channel over which to play the message. REFERENCES 1. EOTP – Static Key Transfer. Defuse.ca (2012-07-13). Retrieved on 2012-12-21. 2. Barkan, Elad; Eli Biham; Nathan Keller (2003). "Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication". Cryptome 2003: 600–16. 3. Barkan, Elad; Eli Biham; Nathan Keller. "Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication by Barkan and Biham of Technion (Full Version)". 4. Gueneysu, Tim; Timo Kasper; Martin Novotný; Christ of Paar; Andy Rupp (2008). "Cryptanalysis with COPACOBANA". Transactions on Computers Nov. 2008 57: 1498–1513. 5. Nohl, Karsten; Chris Paget (2009-12-27). "GSM: SRSLY?". 26th Chaos Communication Congress (26C3):. Retrieved 2009-12-30. 6. "Yubico AB". Bloomberg Businessweek. Retrieved July 13, 2011. 7. Ericka Chickowski (2010-11-03). "Images Could Change the Authentication Picture". Dark Reading. 8. "Confident Technologies Delivers Image-Based, Multifactor Authentication to Strengthen Passwords on Public-Facing Websites". 2010-10-28. 9. BRB – Banco de Brasília – BRB Banknet. Portal.brb.com.br. Retrieved on 2012-12-21. 10. The Register article. The Register article (2005-10-12). Retrieved on 2012-12-21. 11. Washington Post Security Blog. Blog.washingtonpost.com. Retrieved on 2012-12-21 12. D. P. Agrawal and Q-A. Zeng, Introduction to Wireless and Mobile Systems (2nd Edition, published by Thomson, April 2005) ISBN 978-0-534-49303-5 13. J.K. and K. Ross, Computer Networking (2nd Ed, Addison Wesley, 2003) ISBN 978-0-321- 17644-8 14. The schematics are illustrated in U.S. Patent 613, 809 and describes "rotating coherers". 15. Rina Damdoo, “Machine Translation using Mutiplexed PDT for Chatting Slang”, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 2, 2013, pp. 125 - 134, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375. 16. Prof. Maher K. Mahmood and Jinan N. Shehab, “Image Encryption and Compression Based on Compressive Sensing and Chaos”, International Journal of Computer Engineering & Technology (IJCET), Volume 5, Issue 1, 2014, pp. 68 - 84, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375. 17. Muna Ghazi and Dr. Hanaa M. A. Salman, “A Harmonic Secret Sharing and Permutation Based Document Image Authentication”, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 5, 2014, pp. 23 - 30, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375.
  7. 7. International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 5, Issue 4, April (2014), pp. 150-156 © IAEME 156 AUTHORS Omar AbdulmagedHammood was born in Falluja at June 1986, he received his B.Sc. from Baghdad, ALTURATH University, in computer science at 2010, Ministry of higher education and scientific research, Republic of Iraq, he completed his M.Sc in computer science form Sam higginbottom Institute of Agriculture Technology & sciences at 2014, Allahabad, U.P, India. Dr. Ali Makki Sagheer was born in Basrah 1979. He got his B.SC. of Information system in computer Science department at the university of Technology (2001)- Iraq, M.Sc. in Data security from the university of Technology (2004)-Iraq and Ph.D in computer science from the university of Technology (2007) –Iraq. He is interesting in the following fields (Cryptology, Information security, Number Theory, Multimedia Compression, Image Processing, Coding Systems and Artificial Intelligence). He published many papers in different conferences and scientific journals. Mr. Surya Prakash Mishra is born in 1982, (Uttar Pradesh) India. He received his B.Sc. Degree from Allahabad University (AU), M.C.A in Computer Science from U.P. Tech University and he is pursuing Ph.D. SHIATS- DU Allahabad in 2014. His Area of specialization in Computer Algorithms, Java programing, DBMS. He is interested in Database Mgt. System; Data Structure; Java Programming; and Object Oriented Programming.

×