Distributed Crypto SAT Solving
From Tmplab
 Titre: Distributed Crypto SAT Solving
 Par: Mate Soos
 Date: Jeudi 10 Septembre 2009  20:00  22:00
 Lieu: /tmp/lab
In this workshop we will take a distributed SAT solver design that works similar to SETI@Home[1] and hack it until it works faster, gives better results. The results will be public and the solver downloadable, along with the server to enable anyone to crack muchhyped but useless cryptosystems using collaborative effort.
Contents 
SAT solvers and cryptography
SAT solvers are mathematical tools that solve problems given in the CNF[2] notation. Since all problems can be described in CNF, in particular, cryptographical problems, SAT solvers can be used to crack ciphers. They have already been used to solve Crypto1[3], used in London (20 seconds to break the encryption...) and HiTag2, used in car immobilizers.
Difficult cryptographic routines such as those used in WPA (wireless internet access), SSL (bank transactions), etc. need much more computing power than older ciphers. This means SAT solvers must be designed to work in a distributed environment, and work similar to SETI@Home or Folding@Home.
Slides & other material
Workshop Organisers
Mate Soos[4] is currently a PhD in INRIA RhoneAlpes. His most recent paper[5] is on solving the stream ciphers Crypto1, Hitag2 and Bivium faster than was possible before.
Participants
 Phil (/tmp/lab)

lekernel (/tmp/lab) (if I can be in Paris)speaking at FPGAworld  Nico (/tmp/lab)
 Jm (/tmp/lab)
 ptr_ (hsbxl)