3 Pages

fit3105_2008_lab_exercises

Course: FIT 3105, Fall 2009
School: Allan Hancock College
Rating:
 
 
 
 
 

Word Count: 934

Document Preview

Semester FIT3105 1 2008 Security and Identity Management Lab exercises: System identity management and security are very important for any security person. You are advised to discuss the questions very carefully with your tutor and do the exercises with understanding. The lab exercises will provide you important knowledge and experience to understand security, authentication and identity management. Part I:...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Allan Hancock College >> FIT 3105

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Semester FIT3105 1 2008 Security and Identity Management Lab exercises: System identity management and security are very important for any security person. You are advised to discuss the questions very carefully with your tutor and do the exercises with understanding. The lab exercises will provide you important knowledge and experience to understand security, authentication and identity management. Part I: Linux installation (time: first two weeks) You will install the Linux OS and needed software for your lab exercises and some parts of your assignment. The installation note will be handed to you at the lab. Part II: You need to understand the computer system and network communication before you do authentication and system component identification. The following work will help you understand computer system, network communication, basic authentication and system component identification. (time: three to four weeks) 1. Find which shell are you using and its process ID. Then change to another shell and do ps to see which shell you are in now. 2. Can you terminate your shell by killing it using the kill command and its process id? 3. Find the first process in the system by looking at its process ID (Hint: ps ef | more and check the process ids). 4. Look at all the different dates that processes were started and find out which ones were started first, which ones were started some time ago and which ones were started recently. 5. Firstly, run the following program in the back ground: ps ef | more & , then find the process id of the new process. 6. Discuss how communication protocols like TCP, UDP, ICMP are identified in Unix environments. 7. Discuss how services such as ftp, sshd, dns are identified in Unix environments. 8. Discuss with students important host and network configuration files such as /etc/hosts, /etc/resolv.conf, /etc/xinetd.conf, etc. what can we tell from those files in terms of system ids? 9. Find the IP address of your machine. (Hint: ifconifg). Is it your machine id? 10. Check if your machine can talk to sng.its.monash.edu.au (Hint: ping sng). What is the id of sng machine? 11. Can we use the ping command to find the id of a networked computer? 12. Find the default gateway and its IP address of your local network (Hint: netstat r). does the gateway ip identify any thing in the network? 13. Exercise dig command and find out what information you can get by using dig. 14. Try to find all the services that your system may provide and their associated port number (Hint: see /etc/services). Are port numbers the ids of the services? 15. Discuss how well-known ports are used for providing network services (eg. How ssh service is provided, how mail service is provided) and work out the ids of those services. 16. What are the DNS main servers that your machine uses (Hint: see /etc/resolv.conf; and ping these servers). What will happen to your machine if those servers are down? Are the ids of those servers different from the ids of the client machines? 17. Try nmap command if it is available on your machine and discuss with our tutor what you can do with programs liike nmap in looking for the ids of some components (users, machines, software programs). 18. Discuss how setuid and setgid work and ids. 19. Try vmstat and discuss when this command should be used. 20. Try top command and discuss when this command should be used. 21. List the tasks of managing a Unix computer system. 22. List at least five rules that need to follow to secure a Unix system (Hint: account control, file sharing control (authentication, authorisation), system monitoring, id management.) 23. Think of how to secure programs which come with the OS. 24. Think of how to secure some of the important files in the file system. 25. List useful commands that you may need to use to manage and secure your Unix system. 26. Find a way to check someone connected to your network from other networks. 27. Try to find if there is an encryption program on your system and use it with the assistance from the tutor. 28. Explore the Internet with whois command. a. pick a domaim and whois that domain b. try to find the IP of the machine youve just found c. try further to find more details related to that machine. 29. Identify some gateways of Monash computer network (ask the tutor for the command). 30. Can you tell if someone is on Monash network or another network if the person tells you her/his IP address? 31. Find ...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Allan Hancock College - FIT - 3105
Schedule FIT3105 Security and Identity ManagementLecture 11. Introduction to computer system security and Identity management: management: software, hardware, data and users 2. Cryptography for authentication and identification 3. Smart card based
Allan Hancock College - CPE - 5002
CPE5002/CSE5210 Semester 1 2008 Lab exercises :The purpose of the exercises is for you to get familiar with the Linux system and understand the basics of information and network security 1. Create another account so two of you can log on the same s
Allan Hancock College - CPE - 5002
Outline Introduction to Wireless SecurityLecture 10The importance of Wireless communications Wireless networks and security risksWhy is it so hard to secure wireless communications?Wireless communications and network security issuesWEP WAP Blue
Allan Hancock College - CPE - 5002
Outline Cryptosystems, Hash Functions and Digital Signatures- Lecture 4 -Why public key cryptography ? General principles of public key cryptography The RSA public key cryptosystem One way hash functions Digital signatureInformation and Nework Sec
Allan Hancock College - CPE - 5002
Introduction to FirewallsLecture 8OutlineFirewall concepts s Firewall design principle s Firewall types s Firewall implementation s Firewall configurationsInformation and Nework Security2What is a Firewall? and Why we need it.ssss
Allan Hancock College - CPE - 5002
Security For Large computer systems Lecture 11OutlineChallenges in security s Information value and risks s Complexity of security s Security and intrusion detection s Security and preventionsInformation and Nework Security2ChallengeMany n
Allan Hancock College - CPE - 5002
Introduction to Cryptography- Foundations of information and network security -Lecture 3OutlineWhy study cryptology? s Basic terms, notations and structure of cryptography s Private & public key cryptography examples s Modern secret key ciphers :
Allan Hancock College - CPE - 5002
I planned to provide you some help in week 12. This is just some help for your informal test. We are not supposed to provide revision for the informal TEST and you do not need to follow this guide. 1. All lecture notes should be studied. 2. Here are
Allan Hancock College - IMS - 2603
This report aims to depict the main points from the research paper titled A comparison of the communication behaviours of temporary employees and new hires. The research paper was created to focus on temporary employees due to the increase in the num
Allan Hancock College - IMS - 2603
CRITICAL JOURNAL ANALYSISOF THE ANATOMY OF A LARGE SCALE HYPERTEXTUAL WEB OF THE ANATOMY OF A LARGE SCALE HYPERTEXTUAL WEB SEARCH ENGINE SEARCH ENGINEINTRODUCTIION NTRODUCT ONThe following paper provides a critical analysis of journal article `Th
Allan Hancock College - IMS - 2603
A Classification scheme has been described as a logical method or system for the arrangement of knowledge. The purpose of this process is to allow for information to, not only be organized in a relevant manner that allows for easy identification, loc
BYU - PHYSICS - 321
Physics 321 Homework 1 Due at midnight on the day of Hour 3. The purpose of this homework is to familiarize you with the procedure of doing and submitting homework and to give you review in doing basic mechanics problems such as those from Physics 12
Allan Hancock College - IMS - 2603
IMS2603 Information Management in OrganisationsLecture 17 MaRC as Metadatawww.sims.monash.edu.auRevision Last lecture looked at philosophical bases for thinking about metadata, in particular looking at ontology as an approach that might enable
Allan Hancock College - IMS - 2603
SHEDDING LIGHT WITH A HISTORICAL PERSPECTIVE: A critical analysis of The Truth about Taxonomies.Let me begin by stating that it is difficult to do ay true critical analysis on the article the truth about Taxonomies by Bruno and Richmond because it
Allan Hancock College - IMS - 2603
Management Information Systems in the Chinese Business Culture: An Explanatory Theory The sheer complexity and amount of access that we in the western society have, is astounding and something of which most of us take for granted. The ability to find
Allan Hancock College - IMS - 5401
IMS5401 Web-based systems development Tute 7: Web Systems Development: Design Content, layout and standards Aim The aim of this tutorial is to get you thinking about the issues involved in developing a design specification for a web site. It is the
Allan Hancock College - IMS - 9001
Office Use OnlyMonash UniversitySemester Two Examination Period 2004 Faculty Of Information TechnologyEXAM CODES: TITLE OF PAPER: EXAM DURATION: READING TIME: IMS 9001 SYSTEMS ANALYSIS AND DESIGN 3 hours writing time 10 minutes Open Learning St
Allan Hancock College - IMS - 5401
IMS5401 Web-based systems development Tute 5: Metadata, document mark-up and the semantic web Aim The aim of this tutorial is to introduce you to the basic concepts behind the semantic web. This is an extremely complex topic, which would make a unit
Allan Hancock College - IMS - 3470
SIMS, Monash UniversityIMS3470 Human-computer interactionDESIGNING USER DOCUMENTATIONKathy Lynch and Julie Fisher 2004www.monash.edu.auTopic Overview What constitutes user information? Designing user information: Online help Error messag
Allan Hancock College - IMS - 5042
Communications of the Association for Information Systems (Volume13, 2004) 443-455443FROM THE CIO POINT OF VIEW: THE "IT DOESN'T MATTER" DEBATELarry DeJarnett The Lamar Group larry.dejarnett@thelamargroup.com Robert Laskey Revelation 360 bob@rev
Allan Hancock College - IMS - 5042
IMS5042 Information Systems Strategic PlanningWeek 6: Elements of IS planning Theory: 3. Using IT/IS for Competitive Advantage: Strategic Information SystemsCopyright 2004 Monash UniversityAgenda1. Context for IT for CA 2. McFarlan and IT for CA
Allan Hancock College - CSE - 1402
README.txt for version 5.6 of Vim: Vi IMproved.WHAT IS VIMVim is an almost compatible version of the UNIX editor Vi. Many new featureshave been added: multi level undo, syntax highlighting, command line history,on-line help, filename completi
Purdue - CM - 300
From emcal at bilbo.bio.purdue.edu Wed Mar 4 11:05:37 2009From: emcal at bilbo.bio.purdue.edu (Electron Microscope Scheduling System)Date: Wed, 4 Mar 2009 11:05:37 -0500 (EST)Subject: [Cm300f-reservations] 3-5-2009 for time slot: 09:00-18:00Me
East Los Angeles College - IAUS - 245
Structure of nearby galaxiesMichele CappellariUniversity of Oxford Oxford Summer School, 12 July 2007Historical overview1930: Photographic plates: good morphology 1975: Kinematics of a few ellipticals 1985: CCD photometry from the groundDeviati
Allan Hancock College - SAPAP - 2008678
Published in Gazette 13.3.2008 p 1006South AustraliaStatutes Amendment (Petroleum Products) Act (Commencement) Proclamation 20081Short titleThis proclamation may be cited as the Statutes Amendment (Petroleum Products) Act (Commencement) Proclam
Allan Hancock College - CSE - 1303
CSE1303, Summer Semester, 2002Tutorial Sheet 4 Solutions: Linked StructuresSchool of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Summer Semester, 2002Tutorial 4: Linked Structures SolutionsExercis
Allan Hancock College - CSE - 1303
CSE1303, Summer Semester, 2002SyllabusSchool of Computer Science and Software Engineering CSE1303 Summer Semester 2002Part A - SyllabusTopic 1: Introduction/Revision (Lecture 1) Important Information. C datatypes Strings Input/Output File
Allan Hancock College - CSE - 1303
CSE1303 Part A - Summer 20031/2/03CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A1 Welcome & RevisionKymberly Fergusson1Overview Important Information. Overview of the course. Review.2Information Part A
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A8 Linked Stacks and Linked QueuesKymberly FergussonOverview Linked Stack. Push Pop Linked Queue. Append Serve2Linked StackTop of the Stack#ifndef LINKEDSTAC
Allan Hancock College - CSE - 1303
" ! e S e a p R I G r dx QywfPTQytv BBwTG vdyTiq3qXF c R S c x R p g r p x ss3e{ epi}8s7}po `esz r 6l ss o k d f d r | g f ~ k d j w q d r | d { { d m r o d y q x u n w r j u t r q q d o f g n m l g k j d
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A9 Linked ListsKymberly FergussonOverview Operations for Lists. Implementation of Linked Lists. Double Linked Lists.2List Operat
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Additional Explanations Lecture 6 Dynamic Memory Lecture 6 int factorial(int x) { /* A */ if (x = 0) { return 1; } return x * factorial(x-1); } void main() { int n = 3; printf (%d, factorial(n); /* B *
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Additional Explanations Lecture 8 Linked Stacks and Queues Push a new node onto an empty stack: 0x4030 6 NULL 0x4030 0x4030 ptr topPtr0x4030newPtr 0x4030 6 NULLNULLtopPtrNormal push: 0x4030 6
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A3 Basic Data Structures (Stacks)Kymberly FergussonBasic Data Structures Stacks Queues Lists2Overview of Stacks What is a Stack? Operations on a Stack push, pop
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityLecture Overview CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A17/18 RevisionKymberly Fergusson Subject overview Topics covered this semester. Exam overview Types of questions f
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A10 Elementary Algorithms (Revision)Kymberly FergussonOverview Selection Sort Insertion Sort Linear Search. Binary Search. Growth
Allan Hancock College - CSE - 1303
:RUNLQJ ZLWK PHPRU\/HFWXUH %/DVW WLPH 6LPSOH 0,36 SURJUDPV hvurvp vtuhqyvt ,PSXW2XWSXW vtrphyy *OREDO YDULDEOHV rqvqhhrtr $VVHPEOHU GLUHFWLYHV! !# 8T@ "Qh7yrprr !Grprrrpv7! !# 8T@ "Qh7yrprr,Q WKLV OHFWXUH 0HPRU\ GLDJUDPV 6\VWHP V
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A5 Basic Data Structures Continued (Lists)Kymberly FergussonBasic Data TypesStackLast-In, First-Out (LIFO) initialize, push, pop, statusQueueFirst-In, First-Out (FIF
Allan Hancock College - CSE - 1303
Words,bitsandpiecesLectureB05LecturenotessectionB0504/24/09 CSE1303PartBlecturenotes 1Lasttime Floatingpoint Anatomyoffloatingpoint sign exponent mantissa Floatingpointarithmetic multiplication addition Limitationsoffloatingpoint04/
Allan Hancock College - CSE - 1303
MakingdecisionsLectureB12LecturenotessectionB1204/24/09 CSE1303PartBlecturenotes 1Lasttime Memorydiagrams Systemstack pushingandpopping $spand$fp Localvariables storedonstack accessedwithnegativeoffsetfrom$fp Addressingmodes register
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A4 Basic Data Structures Continued (Queues)Kymberly FergussonBasic Data Structures Stacks Queues Lists2Overview What is a Queue? Queue Operations. Application
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A3 Basic Data Structures (Stacks)Kymberly FergussonBasic Data Structures Stacks Queues Lists2Overview of Stacks What is a Stack? Operations on a Stack push, pop
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A11 RecursionKymberly FergussonOverview Unary Recursion Binary Recursion Examples Features Stacks Disadvantages Advantages2What is Recursion - Recall A procedur
Allan Hancock College - CSE - 1303
Pointers and arraysLecture B13Lecture notes section B1304/24/09 CSE1303 Part B lecture notes 1Last time C goto MIPS branch and jump instructions Selection ifelse 04/24/09 Iteration (loops)while for dowhileCSE1303 Part B lecture notes
Allan Hancock College - CSE - 1303
MIPSprogrammingLectureB10LecturenotessectionB1004/24/09 CSE1303PartBlecturenotes 1Lasttime MIPSR2000instructions instructionset format encoding pseudoinstructions Sign signedvsunsignedinstructions sign/zeroextending04/24/09 CSE1303Par
Allan Hancock College - TPRICAAP - 2007748
Published in Gazette 10.5.2007 p 1980South AustraliaTobacco Products Regulation (Smoking in Cars) Amendment Act (Commencement) Proclamation 20071-Short titleThis proclamation may be cited as the Tobacco Products Regulation (Smoking in Cars) Ame
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A10 Elementary Algorithms (Revision)Kymberly FergussonOverview Selection Sort Insertion Sort Linear Search. Binary Search. Growth Rates. Implementation.2Selection
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A12 Binary TreesKymberly FergussonOverview Trees. Terminology. Traversal of Binary Trees. Expression Trees. Binary Search Trees.2Trees Family Trees. Organisat
Allan Hancock College - CSE - 1303
CSE1303 Part A, Additional Examples Simple List Partial Implementation Partial List.h:#ifndef list_h #define list_h #include <stdbool.h> #include <stdlib.h> #include <stdio.h> #define MAXLIST 10 struct ListRec { char array[MAXLIST]; int count; }; ty
Allan Hancock College - CSE - 1303
Students on this list are advised to continuewith second-year computing subjects that haveCSE1303 as a prerequisite.1158413018071813181380121814347418169848181699101821371518327133183412411837014418371809184033441843724918468799185
Allan Hancock College - CSE - 1303
CSE1303 Part A, Summer Semester, 2002Practical Session 2: StacksSchool of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Semester II, 2001Practical Session 2: Stacks Aims of this Practical Session1.
Allan Hancock College - CSE - 1303
CSE1303 Part A, Summer Semester, 2002 School of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Summer Semester, 2002Tutorial Sheet 5Tutorial 5: Recursion, Binary Search Trees and ComplexityPlease attem
Allan Hancock College - CSE - 1303
CSE1303 Part A, Summer Semester, 2002 School of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Summer Semester, 2001Tutorial Sheet 6Tutorial 6: Hash Tables, Recursive Sorts and RevisionPlease attempt a
Allan Hancock College - CSE - 1303
Functions,part1LectureB14LecturenotessectionB1404/24/09 CSE1303PartBlecturenotes 1Lasttime Pointers implementation pointeroperations dereference(*)operator address(&)operator Arrays implementation indicesandaddresses relationshiptopoi
Allan Hancock College - CSE - 1303
Interpreters, compilers and assembly languageLecture B07Lecture notes section B0724/04/09 CSE1303 Part B lecture notes 1Last time Pointers Aggregation of data Characters Strings arrays structs24/04/09CSE1303 Part B lecture notes2
Allan Hancock College - CSE - 1303
TheMIPScomputer architectureLectureB08LecturenotessectionB0824/04/09 CSE1303PartBlecturenotes 1Lasttime Interpreters Machinelanguage Assemblylanguage structure Compilers whatacompilerdoes Stagesofcodegeneration compiling,assembling,li
Allan Hancock College - CSE - 1303
RevisionCSE1303 Part A Data Structures and AlgorithmsSubject Overview Basic C Data types 1D and multidimensional arrays Strings I/O & File I/O Structures and typedef Dynamic memory Pointers04/24/09CSE1303 Part A2Subject Overview
Allan Hancock College - CSE - 1303
Pointers, characters and groupingLecture B06Lecture notes section B0624/04/09 CSE1303 Part B lecture notes 1Last time Byte order bitwise operations shifting AND, OR, NOT, XOR masking relationship to multiplication and division right sh
Allan Hancock College - CSE - 1303
Signed integersLecture B03Lecture notes section B0304/24/09 CSE1303 Part B lecture notes 1Last time Place value number systems Bases binary (base 2) hexadecimal (base 16) octal (base 8) powers of two binary 0 to 15 Thinking in binary
Allan Hancock College - CSE - 1303
CSE1303 Part A, Summer Semester, 2002Practical Session 5: Binary Search TreesSchool of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Summer Semester, 2002Practical Session 5: Binary Search TreesAim
Allan Hancock College - CSE - 1303
CSE1303, Summer Semester, 2002SyllabusSchool of Computer Science and Software Engineering CSE1303 Summer Semester 2002Part A - SyllabusTopic 1: Introduction/Revision (Lecture 1) Important Information. C datatypes Strings Input/Output File