Fahrplan

Let’s have a camping Fahrplan!

There are only a few days left and we are late but finally it is here: the Fahrplan for the Chaos Communication Camp 2015. Due to circumstances we had some lags, but finally we made it!

Please note this safety advices by going through the Fahrplan to pick your sessions:

  1. There is a new track: Failosophy. Read more about it in the Call for Papers.
  2. Mind the gap between 12:30 and 16:00. This is siesta-time where no lecture will be held in the lecture-tents. We decided to do so as this timeframe will be incredibly hot and we do not want to constipate you in tents while the heats is rushing over the campsite. (However, there may be a self-organized session going on elsewhere)
  3. There are still other gaps which will be filled magically within the next days till camp. Please come back on a regular basis to get the new talks.
  4. There are Fahrplan Apps. Please move on to the Fahrplan-App wiki-page to see which are available.
  5. For our pleasure and your curiosity we have a naming scheme for the releases of the Fahrplan. Maybe it is to easy, maybe to hard to figure it out. Let’s see what you can do with it.

Enough said – have a look at the first public available Fahrplan (Version 0.8 first and last and always) of the Chaos Communication Camp 2015.

We will meet each other in Mildenberg!

 

Fahrplan zum Easterhegg 2015

Nach zahlreichen Einreichungen gibt es für’s Easterhegg 2015 eine erste Version des Fahrplans. Es sind noch kleinere Änderungen möglich, zumal wir noch bis Freitag Einreichungen an cfp@eh15.easterhegg.eu akzeptieren. *hint*

Wer noch kein Ticket hat, kein Problem, der Presale läuft auch noch. :-)

Fahrplan released!

You will find the Fahrplan version 0.1alpha at: 

http://events.ccc.de/congress/2012/Fahrplan

Please also have a look at the wiki, as there might be alternative interfaces to the Fahrplan, such as mobile apps showing up. See also the <a href=“http://events.ccc.de/congress/2012/wiki/Calendar>Calendar to get an overview of the already planned <a href=“http://events.ccc.de/congress/2012/wiki/Workshops>Workshops. If you like to do your own workshop or some other event at the congress, you can add it there. 

Die zwölfte Gulaschprogrammiernacht

Die Gulaschprogrammiernacht [0] des Entropia e. V. aka CCC Karlsruhe wird dieses Jahr von Donnerstag, den 7. Juni, bis Sonntag, den 10. Juni, stattfinden. Schon seit dem Jahr 2009 hat sich der Veranstaltungsort bewährt: Hacker und kompatible Lebensformen werden sich in den Räumlichkeiten der Hochschule für Gestaltung in Karlsruhe (HfG) treffen. Zu finden ist das Gebäude in der ehemaligen Munitionsfabrik, die sich die HfG mit dem Zentrum für Kunst und Medientechnologie sowie der Städtischen Galerie teilt.

Zu erwarten sind vier Tage packende Vorträge, mitreißende Workshops und ein unwiderstehliches Rahmenprogramm: Gulaschbytes am Freitag, eine fette Party mit live gecodeter Musik am Samstag, dazu Spieleautomaten von Retrogames und eine mediale Lichtinstallation. Ach, und natürlich gibt’s auch wieder den namensgebenden Gulasch zur Verköstigung!

Das Vortrags- und Workshopprogramm [1]2 ist zwar noch in der Gamma-Version, kann sich aber schon sehen lassen. Wer jetzt noch ein spannendes Thema für einen Vortrag oder einen Workshop hat, der kann sich noch ins Programm mogeln. Bitte schickt Vorschläge an: gpn-content (at) entropia.de

Alles Aktuelle zur GPN liefert Entropia via Twitter. [2]3 Gesucht werden auch noch einige Trolle. [3]4

Wer sich für ein paar Hintergrundinformationen interessiert, der kann am Mittwoch, den 30. Mai, um 19.20 Uhr, SWR 2 einschalten. Gäste im Studio sind Martin und Nicola, Mitorganisatoren der Gulaschprogrammiernacht 2012. [4]5

Übrigens: Wer mit der Bahn anreisen möchte, der sollte telefonisch unter 01805 / 31 11 53 (0,14 €/min.) bestellen und das Stichwort “GPN12” erwähnen – dadurch gibt es den CCC-Event-Rabatt. Alternativ kann man sich auch nach Mitfahrgelegenheiten bei anderen GPN-Besuchern auf [5]6 umschauen und sich eventuell selbst dort eintragen.

[0] https://entropia.de/GPN12
1 https://entropia.de/GPN12:Fahrplan
2 https://twitter.com/entropiagpn
3 https://entropia.de/GPN12:Trolle
4 SWR 2 Tandem
5 https://entropia.de/GPN12:Mitfahrgelegenheiten

Crypto Talk at 27C3: Automatic Identification of Cryptographic Primitives in Software, Day1, 16:00, Saal 3

FingerprintMany applications, including closed source applications like malware or DRM-enabled multimedia players (you might consider them as malware too) use cryptography. When analyzing these applications, a first step is the identification and localization of the cryptographic building blocks (cryptographic primitives, for example AES, DES, RSA…) in the applications. When these blocks have been localized, the input and output of the cryptographic primitives and the key management can be observed and the application can be analyzed further. Fortunately, many cryptographic algorithms use special constants or have a typical fingerprint  and there are only a few different public implementations of the algorithm. This allows us to automate this first, Felix Gröbert will show us how:

Using dynamic binary instrumentation, we record instructions of a program during runtime and create a fine-grained trace. We implement a trace analysis tool, which also provides methods to reconstruct high-level information from a trace, for example control flow graphs or loops, to detect cryptographic algorithms and their parameters.

Trace driven/dynamic analysis has some advantages of static analysis:

  • Because the program is analyzed at runtime, it is immediately known which parts of the code are used at which time, so that they might be correlated with runtime decryption of the code or with network communication.
  • Inputs and outputs of the primitives as well as the keys are recorded, even if the originate from a remote server or botnet. This allows us to immediately distinguish between long term keys and session keys, if multiple executions of the same program can be recorded.
  • This is also highly interesting if private keys are included in an obfuscated binary, for example private RSA keys.
  • Dead or unused code is automatically excluded, so that one can proceed with the main parts of the code first.
  • If additional code is loaded from a server, it is included in the analysis. This would be hard to impossible using static analysis.

Analysis Of course, trace driven analysis has it disadvantages, for example if a malware needs to communicate with a command-and-control server, which has already been taken down or behaves differently on different systems or at different times.__

Personally, I am interested in this talk because it might make ease up the analysis of closed source applications using cryptography. Even if the application, the DRM scheme, or the cryptographic primitive has no special weaknesses or bugs, just he recording of every input and output of all cryptographic building blocks in the application might be sufficient to extract a DRM free version of DRM protected digital content. Please also note that even if an application uses only well analyzed cryptographic primitives as AES and RSA, it might still be insecure, if these primitives are used in the wrong way.

See the talk at Day 1, 16:00, Saal 3!

Author: Erik Tews