|
Wednesday, August 11th
Thursday, August 12th
Friday, August 13th
|
|
Program
| Time |
Event |
| 5:00 pm - 10:00 pm |
Evening Registration and Reception
at Salisbury Lounge |
| Shuttle Service will be provided between
WPI and the Crowne Plaza Hotel every half an hour |
| Time |
Event |
| 7:00 am - 8:45 am |
Registration
at Salisbury Lounge |
|
Continental Breakfast |
| Shuttle Service will be
provided between WPI and the Crowne Plaza Hotel every half an hour
|
| 8:45 am - 9:15 am |
Welcome by Ed Parrish (President, WPI)
|
|---|
|
Introductory remarks by Cetin Koc
and Christof Paar |
|
| Session
| Authors
| Talk's Title |
| 9:15 am - 9:55 am |
Invited Talk |
Brian Snow, National Security Agency, USA |
We Need Assurance |
| 9:55 am - 10:35 am |
Cryptoanalytical
Hardware |
A. Shamir |
Factoring large
numbers with the TWINKLE device |
| I. Hamer and P. Chow |
DES cracking on the
Transmogrifier 2a |
| 10:35 am - 11:00 am |
break |
| 11:00 am - 12:00 pm |
Hardware Architectures |
W.P. Choi and L.M.
Cheng |
Modeling the
crypto-processor from design to synthesis |
| D.C. Wilcox, L.G. Pierson, P.J. Robertson,
E.L. Witzke, and K. Gass |
A DES ASIC suitable for network
encryption at 10 Gbps and beyond |
| E. Hong, J.-H. Chung, and C.H. Lim |
Hardware design and performance
estimation of the 128-bit block cipher CRYPTON |
| 12:00 pm - 12:40 pm |
Smart Cards and Embedded Systems |
K. Itoh, M. Takenaka, N. Torii, S. Temma, and
Y. Kurihara |
Fast implementation of public-key
cryptography on a DSP TMS320C6201 |
| P.J. Lee, E.J. Lee, and Y.D. Kim |
How to implement cost-effective and
secure public key cryptosystems |
| 12:40 pm - 1:55 pm |
lunch break |
| 1:55 pm - 2:35 pm |
Invited Talk |
Colin D. Walter, Computation Department - UMIST,
U.K. |
An Overview of Montgomery's
Multiplication Technique: How to make it Smaller and Faster |
| 2:35 pm - 3:15pm |
Arithmetic Algorithms I |
A.F. Tenca and C.K. Koc |
A scalable
architecture for Montgomery multiplication |
| T. Horvath |
Arithmetic
design for permutation groups |
| 3:15 pm - 3:40 pm |
break |
| 3:40 pm - 4:20 pm |
Arithmetic Algorithms I (Continued) |
J.H. Silverman. |
Fast multiplication in finite fields
GF(2n) |
| B. Kaliski and M. Liskov |
Efficient finite field basis conversion
involving dual bases |
| 4:20 pm - 5:20 pm |
Power Attacks I |
T.S. Messerges, E.A. Dabbish, and
R.H. Sloan |
Power analysis
attacks of modular exponentiation in smartcards |
| L. Goubin and J. Patarin |
DES and differential power
analysis |
| P. Fahn and P. Pearson |
IPA: A new class of power
attacks |
| 5:30 pm - 6:30 pm |
Hospitality Bar (Wine and Beer)
at Higgins House |
| 6:30 pm - 9:00 pm |
CHES
Banquet on the WPI Campus, sponsored by Technical Communications
Corporation, MA |
| 9:00 pm - 10:00 pm |
Shuttle Service between WPI and
the Crowne Plaza will be provided |
| Time |
Event |
| 7:00 am - 8:45 am |
Registration
at Salisbury Lounge |
|
Continental
Breakfast |
| Shuttle Service will be provided between
WPI and the Crowne Plaza Hotel every half an hour |
|
| Session
| Authors
| Talk's Title |
| 8:45 am - 9:25 am |
Invited Talk |
Eberhard von Faber, Debis IT Security Services,
Germany |
Security Evaluation Schemes for the Public
and Private Market with a Focus on Smart Card Systems |
| 9:25 am - 10:05 am |
True Random Number Generators |
V. Bagini and M. Bucci |
A design of reliable true
random number generator for cryptographic applications |
| D. Maher and B. Rance |
Random number generators founded on
signal and information theory |
| 10:05 am -
10:30 am |
break |
| 10:30 am - 11:30 am |
Cryptographic Algorithms on FPGAs |
R.R. Taylor and S.C. Goldstein |
A high-performance flexible
architecture for cryptography |
| E. Mosanya, C. Teuscher, H.F. Restrepo,
P. Galley, and E. Sanchez |
CryptoBooster: A reconfigurable
and modular cryptographic coprocessor |
| L. Gao, S. Shrivastava, and
G.E. Sobelman |
Elliptic curve scalar multiplier
design using FPGAs |
| 11:30 am - 12:10 pm |
Arithmetic Algorithms II |
H. Wu, M.A. Hasan, and I.F. Blake. |
Highly regular architectures
for finite field computation using redundant basis |
| H. Wu |
Low complexity bit-parallel finite
field arithmetic using polynomial basis |
| 12:10 pm -
1:25 pm |
lunch break |
| 1:25 pm - 2:05 pm |
Power Attacks II |
J.-S. Coron |
Resistance against
differential power analysis attacks for elliptic curve
cryptosystems |
| H. Handschuh, P. Paillier, and J. Stern |
Probing attacks on tamper-resistant
devices |
| 2:05 pm - 2:25 pm |
Elliptic Curve Implementations |
J. Lopez and R. Dahab |
Fast multiplication on elliptic
curves over GF(2m) without precomputation |
|
2:25 pm - 2:50
pm |
break |
| 2:50 pm - 3:10 pm |
Elliptic Curve Implementations |
Y. Han, and P.-C. Tan |
Direct computation for elliptic
curve cryptosystems |
| 3:10 pm - 3:50 pm |
New Cryptographic Schemes and Modes of
Operation |
M. Hartmann, S. Paulus, and T. Takagi |
NICE - New Ideal Coset
Encryption - |
| O. Jung and C. Ruland |
Encryption with statistical
self-synchronization in synchronous broadband networks |
| 3:50 pm - 4:50 pm |
Shuttle Service between WPI and
the Crowne Plaza will be provided |
Notes:
- Invited talks are 40 min
- Regular presentations are 20 min long
- The Thursday program is from 8:45 am - 5:20 pm
- The Friday program is from 8:45 am - 3:50 pm
|
