**Negotiated settlement**: on Wednesday, April 24, both teams and Dr. Weber agreed to the following.- Both teams accepted Dr. Weber's point assessment up to the time of the agreement: each team ended up with 5 - 3 = 2 points each for a denial of service attack and penalties for a down server.
- Team 043 received 13 points for the return of team 047's key.
- Team 047 received 10 points for the return of team 043's equipment.
- Each team has until noon on Thursday, April 25, to have their web server back in stable service, without being assessed a penalty for any down time until then.
- For the duration of the attack phase, physical attacks on computer locations are outlawed, including 043 KHIC, 047 KHIC, and the server room under Dr. Weber's control.

- Schedule update: We will be meeting at the following times and
locations:
- Wednesday, April 24 at 11:15 am in 036 KHIC to negotiate a partial armistice
- Monday, April 29 at 11:15 am in 112 KHIC to go over test 2
- Monday, May 6 at 1 pm in 036 KHIC final project debrief

- The course project network (csc460net) is now fully operational. No more hosts will be added to the network by me.
- Useful reading for your projects: Chapters 4, 5, 8, 11, 15, 16, 17, 23 and 27 of Gray Hat Hacking. You can either decide to have each member of the team read all the chapters, or split up the reading to cover all the material more quickly and more completely. A portion of Test 2 will cover this reading, and will be completed as a team.
- After the test we will meet two more times: Friday April 26 at normal
class time and Monday May 6 at 1 pm. Both meetings will be in 036
KHIC.
**See new announcement above.** - Review for the test (4/19) and test 2 itself (4/22) will be held in 112 KHIC.
- Test 2 will be on April 19 April 22.

Topics for Test 2- Chapter 3: authentication
- Chapter 4: Access control
- Network scanning tools (nmap/zenmap) demos
- Password cracking/rainbow table demos
- Basic structure of csc460net
- Metasploit & Metasploitable demos
- Wireless network key cracking
- (15%) Team answers for questions on chapters 4, 5, 8, 11, 15-17, 23 & 27 of Gray Hat Hacking

- Meet with your teams on April 10. Friday, April 12, will be the
next time we meet together in 112 KHIC
**036 KHIC**. - Meet with your teams on Monday, April 8.
- Several links have been posted recently in the Resources section below.
- The Air Force Institute of Technology still has scholarship money available for the 2013-14 academic year. See http://www.afit.edu/ccr/CyberCorp/Default.cfm.
- The project description is now available below.
- Next: Chapters 3 and 4 from the Stallings/Brown text, which we will start on Friday, March 8.
- My office hours on Friday 3/8 will be 10-11:05 am.
- Test 1 is now confirmed for Wednesday, March 6. It will cover
chapters 1, 2, 19, and the sections of chapters 20 and 21 that we covered,
as well as the detailed material on the AES algorithm that can be found in
the
Wikipedia entry and the AES defining document
FIPS 197, and the two chapters of Metasploit, and the guest lecture by
David Kennedy. Later I will give a separate quiz over the details of the ACM Code of Ethics and
UMU's
Technology Resources Acceptable Use Policy,
so for now you just need to know the general outlines of these documents.

Expanded list of topics for Test 1.- All topics covered on the quiz (see below).
- Chapter 20
- Section 20.1: Cryptography vs Cryptanalysis, computationally secure, the general outlines of the basic Feistel structure
- Section 20.3/FIPS 197: The general outlines of AES encryption, each of the stages of a round (Substitute Bytes, Shift Rows, Mix Columns, Add Round Key), general outlines of key expansion.
- Section 20.5: Puropose of modes of operation; ECB, CBC, and CTR modes

- Chapter 19
- Types of cybercrime, types of intellectual property, DMCA, Digital Rights Management, U.S. Privacy Act of 1974, four area of privacy concerns (Fig. 19.5), ethical hierarchy, ethical issues relating to computers and information systems, common themes in IEEE, ACM, and AITP codes of conduct, general outlines of ACM code of conduct.

- David Kennedy talk and related material
- Terminology listed in section 2.1 of Metasploit
- PTES
- Penetration testing as a general concept
- Overview of Metasploit
- Overview of an attack
- SET
- High-impact vulnerabilities

- There is a new homework assignment posted below.
- Read chapters 1 and 2 of Metasploit by David Kennedy, et al.
- David Kennedy will be visiting our class on Wednesday, Feb. 27. I've asked him to speak about penetration testing.
- Read chapter 19 (paying special attention to section 19.4), the ACM Code of Ethics and UMU's Technology Resources Acceptable Use Policy.
- Test 1 is tentatively scheduled for Wednesday, March 6.
- Remember you can prepare a half-sheet of notes for Wednesday's quiz.
List of topics:
- Chapter 1
- CIA Triad + Authenticity + Accountability
- All boldface terms in chapter 1,
*except*for the terms in table 1.5

- Chapter 2
- Symmetric encryption: stream vs block cipher; brute-force attack
- Public-Key Encryption
- Two keys needed
- Encrypt with public key and decrypt with private
- Sign with private key and authenticate signature with public

- Message Authentication codes (understand the diagrams)
- Secure hash functions; the 6 requirements for a secure hash function
- Random vs Pseudorandom number generation

- Chapter 21
- Detailed information on hash function requirements, but no SHA
- Details of RSA algorithm (don't need to be able to calculate d given e)
- Details of Diffie-Hellman (don't need to be able to find a primitive root α)

- Chapter 1
- Take a look at test 1 from Spring, 2011. Problems 1, 3, 4, 5, 6, 9 and 12 are all good sample problems for next week's quiz.
- There will be a quiz over chapters 1, 2, and sections 21.1, 21.3, and
21.4 on Monday, Feb. 11
**Wednesday, Feb. 13**. - Read sections 21.4 and 21.1 (after that we'll be going to sections 20.1, 20.3, and 20.5).
- Timken's IT department will be on campus this coming Tuesday night (Feb 5) at 7 pm in EBB 206. Come and see what they have to offer, both in the way of internships and future employment.
- Read Chapter 2 and section 21.3.
- Read Chapter 1

**A3: Due 3/1**- Problem 20.6 on p. 652. (My book has a typo, and yours might too.
I think the P
_{21}is supposed to be P_{2}.) Also show what the four operations used in an AES round would do to the cell in row 1, column 1 of the state in problem 2 of test 1 from Spring, 2011. For each of the four operations, use the state and round key as they are given on the test as your starting point. Warning: you can't use the formula from problem 2c for the Mix Columns operation, since it is for the wrong column. You'll have to look up the right formula. **A2: Due 2/11**- Problems 21.2bc, 21.6, 21.12 on pp. 677-679
**A1: Due 2/1**- Use Mathematica to generate a pair of 2048 bit RSA keys. Send me the public key in an email message. Then send me a short message that you have digitally signed with your private key in a separate message.

- The project description and timeline is here.
- A team will not received the promised resources until every team member successfully passes the Ethics Quiz with a score of 75% or higher. Here is a copy of the ethics quiz from Spring, 2011.

- Using aircrack to crack WEP codes
- aircrack FAQ
- VirtualBox
- Metasploitable and the Metasploitable 2 Exploitability Guide.
- Rainbow tables that go with rcracki_mt.
- Stallings/Brown textbook website
- Gray Hat Hacking on Safari Bookshelf
- OpenSSL

- Wikipedia Entry on Block Cipher Modes of Operation
- Wikipedia entry on Advanced Encryption Standard
- AES defining document: FIPS
Publication
197

- Straightforward C
implementation
of
AES by Karl Malbrain

- ITU-T Recommendation X.800 Security Architecture for OSI.
- Wikipedia entry on RSA algorithm
- The following Mathematica functions are useful for the key generation,
encryption and decryption:
- Key generation: RandomPrime, GCD, and PowerMod.
- Encoding a string message to an integer: ToCharacterCode and FromDigits (use 256 as the base).
- Encrypting and decrypting using an RSA key: PowerMod
- Decoding an integer back to a string: IntegerDigits (use 256 as base) and FromCharacterCode.

- Here is my RSA public key:
e = 65537 n = 1892430833211604519449673245606290963939813962543864979094556481835199\ 7707804513430728173998373639025953068311831186006418738808449167065342\ 7735843687709168414932537869192546917391243844019915752236802798318756\ 3184764521999993060911883129362002921642977567820026827679954372951448\ 6683742904386991302967466625811655158514803947097522014285779667900709\ 4098871905867005677581591748643594540530225016839032457671497167274467\ 6775456619638431161004444141390511429925286707197584065325733413612447\ 0435161536827711085459218228252909845364794210294272255431442792863475\ 332191833808064388772061196199576551601838337761982201591