Termin:Chaotic-Congress-Cinema Nr. 12

Aus Attraktor Wiki

Wechseln zu: Navigation, Suche


Chaotic-Congress-Cinema Nr. 12

Beginn:

06.04.2011 20:00

Ende:

06.04.2011 23:00


Needs to be there, but does not need to be seen by a visitor Yes Wir schauen uns die Aufzeichnung von Congress Vorträgen an. Du bist herzlich eingeladen, in den Clubräumen im Mexikoring 21 aufzutauchen und mit uns die Talks anzuschauen und zu diskutieren. Es wird Getränke und Knabberkram zu moderaten Preisen geben. Falls Du kein CCC-, CCCHH- oder Attraktor e.V.-Mitglied bist, macht das überhaupt nichts: Alle Gäste sind gern gesehen. :-)

Weitere Informationen unter Chaotic Congress Cinema.

Netzneutralität und QoS - ein Widerspruch?

Fakten auf den Tisch

Geht es mit der Netzneutralität zu Ende? Was haben wir den Lobbyisten und PR-Leuten der Telekommunikationsunternehmen argumentativ entgegenzusetzen? Was sind die Fakten, was gehört ins Reich der Mythen?

Tim Berners-Lee hat folgende griffige Definition gefunden: "Net neutrality is this: If I pay to connect to the Net with a certain quality of service, and you pay to connect with that or greater quality of service, then we can communicate at that level."

Welche der sagenumwobenen Kapazitätsengpässe existieren wirklich? Und wie soll Quality of Service (QoS) praktisch in Zukunft gehandhabt werden? Was ist machbar, was sind die Bedingungen für eine gesetzliche Regulierung? Fragen über Fragen, die mit Euch zusammen diskutiert werden sollen.

http://events.ccc.de/congress/2010/Fahrplan/events/4094.en.html

Code deobfuscation by optimization

Optimization algorithms present an effective way for removing most obfuscations that are used today. Much of the compiler theory can be applied in removing obfuscations and building fast and reliable deobfuscation systems. By understanding traditional optimization problems and techniques it is possible to develop and customize compiler optimization algorithms for usage in binary deobfuscation/analysis.

Analysis of malware binaries is constantly becoming more difficult with introduction of many different types of code obfuscators. One common theme in all obfuscators is transformation of code into a complex representation. This process can be viewed as inverse of compiler optimization techniques and as such can be partially removed using optimization algorithms. > Optimization algorithms present an effective way for removing most obfuscations that are used today. Much of the compiler theory can be applied in removing obfuscations and building fast and reliable deobfuscation systems. By understanding traditional optimization problems and techniques it is possible to develop and customize compiler optimization algorithms for usage in binary deobfuscation analysis. > Optimization algorithms are especially successful in following:
• Removal of no operation instructions > • Simplifying complex instructions
• Removal of unconditional jumps > • Removal of conditional jumps
• Simplifying control-flow graph

This presentation shows common obfuscation techniques and a process of adapting optimization algorithms for removing obfuscations. Additionally, a open-source plug-in for the IDA Pro disassembler is presented that demonstrates usability of the proposed optimization process as well as a set of techniques to speed up the process of analyzing obfuscated code.

http://events.ccc.de/congress/2010/Fahrplan/events/4096.en.html