Cryptographic Hardware and Embedded Systems

by Ches'9 (1999 Worchester, Mass.); Paar, Christof; Goos, G.; Hartmanis, J.; Leeuwen, J. Van

• ISBN13: 9783540666462
• ISBN10: 354066646X
• Format: Paperback
• Copyright: 1999-11-01
• Publisher: Springer Verlag

Summary

This book constitutes the refereed proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, CHES'99, held in Worcester, MA, USA in August 1999. The 27 revised papers presented together with three invited contributions were carefully reviewed and selected from 42 submissions. The papers are organized in sections on cryptographic hardware, hardware architectures, smartcards and embedded systems, arithmetic algorithms, power attacks, true random numbers, cryptographic algorithms on FPGAs, elliptic curve implementations, new cryptographic schemes and modes of operation.

Table of Contents

Invited Talk
We need assurance	1	(1)
B. D. Snow
Cryptanalytic Hardware
Factoring large numbers with the TWINKLE device	2	(11)
A. Shamir
DES cracking on the Transmogrifier 2a	13	(12)
I. Hamer
P. Chow
Hardware Architectures
Modeling the crypto-processor from design to synthesis	25	(12)
W. P. Choi
L. M. Cheng
A DES ASIC suitable for network encryption at 10 Gbps and beyond	37	(12)
D. C. Wilcox
L. G. Pierson
P. J. Robertson
E. L. Witzke
K. Gass
Hardware design and performance estimation of the 128-bit block cipher CRYPTON	49	(12)
E. Hong
J.-H. Chung
C. H. Lim
Smartcards and Embedded Systems
Fast implementation of public-key cryptography on a DSP TMS320C6201	61	(12)
K. Itoh
M. Takenaka
N. Torii
S. Temma
Y. Kurihara
How to implement cost-effective and secure public key cryptosystems	73	(7)
P. J. Lee
E. J. Lee
Y. D. Kim
Invited Talk
Montgomery's multiplication technique: How to make it smaller and faster	80	(14)
C. D. Walter
Arithmetic Algorithms I
A scalable architecture for Montgomery multiplication	94	(15)
A. F. Tenca
C. K. Koc
Arithmetic design for permutation groups	109	(13)
T. Horvath
Fast multiplication in finite fields GF(2N)	122	(13)
J. H. Silverman
Efficient finite field basis conversion involving dual bases	135	(9)
B. S. Kaliski Jr.
M. Liskov
Power Attacks I
Power analysis attacks of modular exponentiation in smartcards	144	(14)
T. S. Messerges
E. A. Dabbish
R. H. Sloan
DES and differential power analysis	158	(15)
L. Goubin
J. Patarin
IPA: A new class of power attacks	173	(14)
P. N. Fahn
P. K. Pearson
Invited Talk
Security evaluation schemas for the public and private market with a focus on smart card systems	187	(17)
E. von Faber
True Random Number Generators
A design of reliable true random number generator for cryptographic applications	204	(15)
V. Bagini
M. Bucci
Random number generators founded on signal and information theory	219	(12)
D. P. Maher
R. J. Rance
Cryptographic Algorithms on FPGAs
A high-performance flexible architecture for cryptography	231	(15)
R. R. Taylor
S. C. Goldstein
CryptoBooster: A reconfigurable and modular cryptographic coprocessor	246	(11)
E. Mosanya
C. Teuscher
H. F. Restrepo
P. Galley
E. Sanchez
Elliptic curve scalar multiplier design using FPGAs	257	(12)
L. Gao
S. Shrivastava
G. E. Sobelman
Arithmetic Algorithms II
Highly regular architectures for finite field computation using redundant basis	269	(11)
H. Wu
M. A. Hasan
I. F. Blake
Low complexity bit-parallel finite field arithmetic using polynomial basis	280	(12)
H. Wu
Power Attacks II
Resistance against differential power analysis for elliptic curve cryptosystems	292	(11)
J.-S. Coron
Probing attacks on tamper-resistant devices	303	(13)
H. Handschuh
P. Paillier
J. Stern
Elliptic Curve Implementations
Fast multiplication on elliptic curves over GF(2m) without precomputation	316	(12)
J. Lopez
R. Dahab
New Cryptographic Schemes and Modes of Operation
NICE --- New Ideal Coset Encryption	328	(12)
M. Hartmann
S. Paulus
T. Takagi
Encryption with statistical self-synchronization in synchronous broadband networks	340	(13)
O. Jung
C. Ruland
Author Index	353