COMP715/815GB:A Team


 * Home
 * [A Team]
 * Team Awesome
 * Team Gold
 * Team Money
 * Team One

Info

 * Planned Meeting Times:
 * Wednesdays at 4:30pm

Week of Sept 17th
2012.09.19, outside the classroom in the common area, before class.
 * Meeting time/place:

One of the students did not attend the meeting, because his email address was wrong and he didn't know about it. This student also got his project working without issue.
 * Topics Covered:

None of the students that had attended the meeting had really started anything, so we didn’t have much to talk about.

I spoke with them prior to the start of the following class, and of the other three students, all three had problems. One of them was able to get his project working, the other two were unable to get their projects working.

Week of Sept 24th

 * Meeting time:


 * Topics Covered:


 * Open Questions:


 * Concerns:

Week of Oct 1st

 * Meeting time: 4:30 - 5:30 PM, 10/3/2012

Questions one and two. We kept getting hung up on #2. There were a number of proposed solutions to this question, but it wasn't clear what the correct solution was. Proposed solutions include:
 * Topics Covered:

3^3 + 16^2 - Because you should add the probabilities together, and the exponents should total 5 (5 spots).

3^3 * 16^2 - Because the probabilities are depended, they should be multiplied and the exponents should total 5 (5 spots).

3^5 * 16^2 - because there are 5 spots, it could go in any one of those spots

One of the students suggested breaking it up into two pieces. Determine the number of permutations of the unknown keys and determine the number of different ways the known keys can be positioned on the lock.

Another student suggested that if the known digits were the same, this would reduce the number of max number of attempts needed.

One student suggested this website for help: http://www.mathsisfun.com/combinatorics/combinations-permutations.html

Still not sure how this one is supposed to be done Still need to discuss the remaining questions and homework
 * Open Questions:

none
 * Concerns:

Week of Oct 8th

 * Meeting time: 4:45 - 5:30 PM, 10/10/2012


 * Topics Covered:

We discussed the lock question, and what the best way to prevent lockbumping. There were a few different ideas - one student found a complex locking system after discovering the biaxial lock was vulnerable to lockpicking. Another student suggested using a different material that would not transfer the kinectic energy as easily.

We continued to discuss number two. There were a few suggestions on how to do it, but one of the students seemed to have a good answer.

We also discussed the lab. One of the students didn't do the lab, the other two had trouble with it. One student put his loop function in the code of the encryption algorithm, instead of looping the encrypt(key,string) function. He was unable to get the decrypt part working because of this, and I mentioned he should just run the encrypt function three times.

none
 * Open Questions:

One student did not attend.
 * Concerns:

Week of Oct 15

 * Meeting time: 5:00 - 5:30 PM, 10/17/2012

Corridor
 * Topics Covered:

Security Triads

What are methods to secure confidentiality (Encryption, access control, access control, authentication)

Types of malware

Ways to prevent infection

Lockbumping


 * Open Questions:

Want to know whats going to be on the mid-term
 * Concerns:

Week of Oct 22

 * Meeting time: 4:45 - 5:30 PM, 10/24/2012


 * Topics Covered:

Exam Review... topics covered:

security triads

mathematics of lock security

adware

rootkits/botnets

rogue software

memory management

None
 * Open Questions:

None
 * Concerns:

Week of Nov 5

 * Meeting time: 5:00 - 5:30 PM, 11/07/2012


 * Topics Covered:

Lab 4 - brute force password cracking

Cracking WEP Encryption / next homework

Windows 8

None
 * Open Questions:

None
 * Concerns:

Week of Nov 12

 * Meeting time: 5:00 - 5:30 PM, 11/14/2012


 * Topics Covered:

Homework 4

NetStumbler does not work on Windows 7 Machines

difficulty cracking WEP on Windows

Number of passwords discovered via brute force attacks and methods to employ

None
 * Open Questions:

None
 * Concerns:

Week of Nov 31

 * Meeting time: 4:45 - 5:30 PM, 12/02/2012


 * Topics Covered:

Exam review - all questions / topics on exam

None
 * Open Questions:

None
 * Concerns: