Sunday, April 2
19:00-21:00 Reception in the conference hotel
Monday, April 3
09:15 | opening remarks |
09:30 | Yusuf Leblebici |
How Much Faster Can We Go? : A Technology Outlook | |
10:30 | coffee break |
Session I: Brute Force Attacks Against Symmetric Algorithms | |
11:00 | Iain Devlin and Alan Purvis |
A fundamental evaluation of 80 bit keys employed by hardware oriented stream ciphers | |
11:30 | discussion |
11:45 | Sandeep Kumar, Christof Paar, Jan Pelzl, Gerd Pfeiffer, Andy Rupp, and Manfred Schimmler |
How to Break DES for € 8,980 | |
12:15 | discussion |
12:30 | lunch |
14:00 | Kris Gaj |
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware | |
15:00 | coffee break |
Session II: Security of Elliptic Curve Cryptosystems | |
15:30 | Tim Güneysu, Christof Paar, and Jan Pelzl |
On the Security of Elliptic Curve Cryptosystems against Attacks with Special-Purpose Hardware | |
16:00 | discussion |
16:15 | Philippe Bulens, Guerric Meurice de Dormale and Jean-Jacques Quisquater |
Hardware for Collision Search on Elliptic Curve over GF(2m) | |
16:45 | discussion |
17:00 | rump session |
19:30 | dinner in "Hotel Hilton Cologne" |
09:30 | Alan Gara |
BlueGene/L: An overview and exploration into unique architectural features that can be exploited for cryptanalysis. | |
10:30 | coffee break |
Session III: Equation Solving and Index Calculus Attacks | |
11:00 | A. Bogdanov, M.C. Mertens, C. Paar, J. Pelzl, and A. Rupp |
SMITH - A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2) | |
11:30 | discussion |
11:45 | Claus Diem |
Index Calculus in Class Groups of Non-Hyperelliptic Curves of Genus 3 from a Full Cost Perspective | |
12:15 | discussion |
12:30 | lunch |
14:00 | Jens Franke |
On the factorization of RSA200 | |
15:00 | coffee break |
Session IV: RSA Factorization | |
15:30 | Naoyuki Hirota, Tetsuya Izu, Noboru Kunihiro, and Kazuo Ohta |
An Evaluation of the Sieving Device YASD for 1024-bit Integers | |
16:00 | discussion |
16:15 | Thorsten Kleinjung |
Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers | |
16:45 | discussion |
17:00 | concluding remarks |