--- begin forwarded text Date: Thu, 8 Jul 1999 15:33:39 -0400 (EDT) From: Christof Paar <[EMAIL PROTECTED]> To: DCSB <[EMAIL PROTECTED]> Subject: CHES Program Sender: [EMAIL PROTECTED] Reply-To: Christof Paar <[EMAIL PROTECTED]> Please find below the prelinarary program of the CHES workshop. For registration information, please see http://ece.wpi.edu/Research/crypt/ches -Christof ------------------------------------------------------- PRELIMINARY PROGRAM Workshop on Cryptographic Hardware and Embedded Systems Worcester, Massachusetts, August 12-13, 1999 ------------------------------------------------------- --- THURSDAY, AUGUST 12 --- Welcome by Ed Parrish (President, WPI) Introductory remarks by Cetin Koc and Christof Paar Invited Talk: Brian Snow, National Security Agency, USA We Need Assurance Session: CRYPTANALYTICAL HARDWARE A. Shamir Factoring large numbers with the TWINKLE device I. Hamer and P. Chow DES cracking on the Transmogrifier 2a --- break --- Session: 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 Session: 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 --- lunch break --- Invited Talk: Colin D. Walter, Computation Department - UMIST, U.K. An Overview of Montgomery's Multiplication Technique: How to make it Smaller and Faster Session: ARITHMETIC ALGORITHMS A.F. Tenca and C.K. Koc A scalable architecture for Montgomery multiplication J.H. Silverman. Fast multiplication in finite fields GF(2^N) B. Kaliski and M. Liskov Efficient finite field basis conversion involving dual bases --- break --- 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 Session: 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 --- CHES Banquet on the WPI Campus, sponsored by Technical --- --- Communications Corporation, MA --- --- FRIDAY, AUGUST 13 --- Invited Talk: Dale Hopkins, Compaq - Atalla, USA Design of Hardware Encryption Systems for e-Commerce Applications Session: TRUE RANDOM 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 --- break --- Session: 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 Session: GALOIS FIELD ARCHITECTURES 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 --- lunch break --- Invited Talk: David Naccache, Gemplus, France Significance Tests and Hardware Leakage Session: 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 --- break --- Session: ELLIPTIC CURVE IMPLEMENTATIONS J. Lopez and R. Dahab Fast multiplication on elliptic curves over GF(2^m) without precomputation Y. Han, J. Zhang, and P.-C. Tan Direct computation for elliptic curve cryptosystems Session: NEW CRYPTOGRAPHIC SCHEMES AND MODES OF OPERATION M. Hartmann, S. Paulus, and T. Takagi NICE - New Ideal Coset Encryption - T. Horvath Arithmetic design for permutation groups O. Jung and C. Ruland Encryption with statistical self-synchronization in synchronous broadband networks ----------------------------------------------------------- Invited talks are 40 min, regular presentations 20 min long The Thursday program is from 9:00 am - 6:00 pm, the Friday program is from 8:30 am - 4:30 pm -------------------------------------------------------- Workshop on Cryptographic Hardware and Embedded Systems Worcester, Massachusetts, August 12-13, 1999 ------------------------------------------------------- Information: http://ece.wpi.edu/Research/crypt/ches E-Mail: [EMAIL PROTECTED] Program Chairs: Cetin Kaya Koc & Christof Paar [EMAIL PROTECTED] & [EMAIL PROTECTED] ------------------------------------------------------- For help on using this list (especially unsubscribing), send a message to "[EMAIL PROTECTED]" with one line of text: "help". --- end forwarded text ----------------- Robert A. Hettinga <mailto: [EMAIL PROTECTED]> The Internet Bearer Underwriting Corporation <http://www.ibuc.com/> 44 Farquhar Street, Boston, MA 02131 USA "... however it may deserve respect for its usefulness and antiquity, [predicting the end of the world] has not been found agreeable to experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'