Difference between revisions of "Summerschool Aachen 2005/Challenges"

From C4 Wiki
Jump to: navigation, search
(Challenges in Progress)
Line 24: Line 24:
 
* Typo & Ilja - 0wn putty
 
* Typo & Ilja - 0wn putty
 
** Update: We found some exploitable bugs. --[[User:Typo|Typo]] 18:10, 20 Sep 2005 (CEST)
 
** Update: We found some exploitable bugs. --[[User:Typo|Typo]] 18:10, 20 Sep 2005 (CEST)
* Christian feat. Max - verBOTen - a bot that mirrors only that stuff that is protected by robots.txt
+
* Christian feat. Max - verBOTen - a bot that mirrors only that stuff that is protected by robots.txt see also [http://blogs.23.nu/disLEXia/stories/9963/]
 
* Max feat. Christian: [[/SSL fingerprinting]]
 
* Max feat. Christian: [[/SSL fingerprinting]]
 
* Chris - Fake driver to replace Apple's IOI2CMotionSensor for further reverse engineering of the motion sensor driver
 
* Chris - Fake driver to replace Apple's IOI2CMotionSensor for further reverse engineering of the motion sensor driver

Revision as of 16:18, 27 September 2005

Open Challenges

Challenges in Progress

  • Daniel & Yves - glibc 2.3.5 look at how to exploit heap-based overflows (avoiding the checks)
  • Typo & Ilja - 0wn putty
    • Update: We found some exploitable bugs. --Typo 18:10, 20 Sep 2005 (CEST)
  • Christian feat. Max - verBOTen - a bot that mirrors only that stuff that is protected by robots.txt see also [1]
  • Max feat. Christian: /SSL fingerprinting
  • Chris - Fake driver to replace Apple's IOI2CMotionSensor for further reverse engineering of the motion sensor driver
  • Lorenzo
    • Pick Ilja's challenges up (didn't look at labsession.pdf yet; it should contain more challenges)
    • Just started a glibc function fuzzer (even if I guess it will take long time, tho :-)
    • "Genetic exploit" [to try] to fight against real address space layout randomization. Is it feasible/worth working on? I don't know yet :-) (I'm just starting to think about it; lot of hypotheses and scenario. main issues: fitness function, little knowledge about genetic algorithms :-\)

Finished Challanges