The SHARCS Workshop is the first open meeting ever devoted entirely
to the challenging subject of special-purpose cryptanalytical
Much of the earlier work in this area was done on key searches for symmetric-key algorithms, with a particular emphasis on attacks against DES. More recently there has been interest in hardware architectures for sieving methods for attacking the RSA scheme. However, it seems that much work remains to be done including, for instance, special purpose hardware crackers for:
The ultimate objective of SHARCS is to determine whether
special purpose hardware poses a real threat for today's cryptographic
algorithms, and whether there are advantages over software-based attacks.
Since this is an intrinsically interdisciplinary subject, it is hoped that
the workshop can bring together researchers with different backgrounds
for discussing and advancing this exciting field.
The workshop will consist of invited keynote presentations and some contributed presentations. We welcome submissions of extended abstracts (at least 3 pages.) We would like to stress that we do not aim at receiving contributions on side channel attacks nor on attacks carried out on conventional computer platforms with conventional attack algorithms. Furthermore, at this point we exclude quantum cryptologic devices. Theoretical papers analyzing the feasibility and costs of attacks using specialized hardware are, however, very much welcomed.
The workshop is organized by the European Network of Excellence (ECRYPT). The workshop is an activity of ECRYPT's VAMPIRE - Virtual Application and Implementation Research Lab.
|January 3, 2005:||submission of abstracts||closed|
|January 24, 2005:||notification of acceptance or rejection|
|February 10, 2005:||revised version of accepted papers|
|February 24 & 25, 2005:||SHARCS workshop|
So far the following speakers have confirmed giving an invited talk:
SHARCS is organized within ECRYPT - European Network of Excellence for Cryptology. We aknowledge the support by the European Commission under the IST program, IST-2002-507932.
|We thank ENSTA for local support and good cooperation.|
|We acknowledge organizational support from the Horst Görtz Institute for IT-Security.|
|We acknowledge organizational support from Department of Mathematics, Technical University of Denmark.|