CHES 1999
WORCESTER, MA, USA
Çetin K. Koç Christof Paar (Eds.): Cryptographic Hardware and Embedded Systems – CHES ’99,
First International Workshop, Worcester, MA, USA, August 12-13, 1999, Proceedings. Lecture Notes
in Computer Science, Vol. 1717 Springer 1999, ISBN 3-540-66646-X
Read the paper abstracts. More »
Invited Talk
- B. D. Snow: We need assurance p. 1
Cryptanalytic Hardware
- A. Shamir: Factoring large numbers with the TWINKLE device p. 2
- I. Hamer and P. Chow: DES cracking on the Transmogrifier 2a p. 13
Hardware Architectures
- W. P. Choi and L. M. Cheng: Modeling the crypto-processor from design to synthesis p. 25
- 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 p. 37
- E. Hong, J.-H. Chung, and C. H. Lim: Hardware design and performance estimation of the
128-bit block cipher CRYPTON p. 49
Smartcards 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. 61
- P. J. Lee, E. J. Lee, and Y. D. Kim: How to implement cost-effective and secure public key
cryptosystems 73
Invited Talk
- C. D. Walter: Montgomery's multiplication technique: How to make it
- smaller and faster p. 80
Arithmetic Algorithms I
- A. F. Tenca and Ç. K. Koç: A scalable architecture for Montgomery multiplication p. 94
- T. Horváth: Arithmetic design for permutation groups p. 109
- J. H. Silverman: Fast multiplication in finite fields GF(2N) p. 122
- B. S. Kaliski Jr. and M. Liskov: Efficient finite field basis conversion involving dual
bases p. 135
Power Attacks I
- T. S. Messerges, E. A. Dabbish, and R. H. Sloan: Power analysis attacks of modular
exponentiation in smartcards p. 144
- L. Goubin and J. Patarin: DES and differential power analysis p. 158
- P. N. Fahn and P. K. Pearson: IPA: A new class of power attacks p. 173
Invited Talk
- E. von Faber: Security evaluation schemas for the public and private market with a focus on
smart card systems p. 187
True Random Number Generators
- V. Bagini and M. Bucci: A design of reliable true random number generator for cryptographic
- applications p. 204
- D. P. Maher and R. J. Rance: Random number generators founded on signal and information
theory p. 219
Cryptographic Algorithms on FPGAs
- R. R. Taylor and S. C. Goldstein: A high-performance flexible architecture for cryptography
p. 231
- E. Mosanya, C. Teuscher, H. F. Restrepo, P. Galley, and E. Sanchez: CryptoBooster: A
reconfigurable and modular cryptographic coprocessor p. 246
- L. Gao, S. Shrivastava, and G. E. Sobelman: Elliptic curve scalar multiplier design using
FPGAs p. 257
Arithmetic Algorithms II
- H. Wu, M. A. Hasan, and I. F. Blake: Highly regular architectures for finite field
computation using redundant basis p. 269
- H. Wu: Low complexity bit-parallel finite field arithmetic using polynomial basis p. 280
Power Attacks II
- J.-S. Coron: Resistance against differential power analysis for elliptic curve
cryptosystems p. 292
- H. Handschuh, P. Paillier, and J. Stern: Probing attacks on tamper-resistant devices p. 303
Elliptic Curve Implementations
- J. López and R. Dahab: Fast multiplication on elliptic curves over GF(2m) without
precomputation p. 316
New Cryptographic Schemes and Modes of Operation
- M. Hartmann, S. Paulus, and T. Takagi: NICE | New Ideal Coset Encryption p. 328
- O. Jung and C. Ruland: Encryption with statistical self-synchronization in synchronous
broadband networks p. 340
CHES 1999
WORCESTER, MA, USA
Çetin K. Koç Christof Paar (Eds.): Cryptographic Hardware and Embedded Systems – CHES ’99,
First International Workshop, Worcester, MA, USA, August 12-13, 1999, Proceedings. Lecture Notes
in Computer Science, Vol. 1717 Springer 1999, ISBN 3-540-66646-X
Invited Talk
- B. D. Snow: We need assurance p. 1
Cryptanalytic Hardware
- A. Shamir: Factoring large numbers with the TWINKLE device p. 2
- I. Hamer and P. Chow: DES cracking on the Transmogrifier 2a p. 13
Hardware Architectures
- W. P. Choi and L. M. Cheng: Modeling the crypto-processor from design to synthesis p. 25
- 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 p. 37
- E. Hong, J.-H. Chung, and C. H. Lim: Hardware design and performance estimation of the
128-bit block cipher CRYPTON p. 49
Smartcards 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. 61
- P. J. Lee, E. J. Lee, and Y. D. Kim: How to implement cost-effective and secure public key
cryptosystems 73
Invited Talk
- C. D. Walter: Montgomery's multiplication technique: How to make it
- smaller and faster p. 80
Arithmetic Algorithms I
- A. F. Tenca and Ç. K. Koç: A scalable architecture for Montgomery multiplication p. 94
- T. Horváth: Arithmetic design for permutation groups p. 109
- J. H. Silverman: Fast multiplication in finite fields GF(2N) p. 122
- B. S. Kaliski Jr. and M. Liskov: Efficient finite field basis conversion involving dual
bases p. 135
Power Attacks I
- T. S. Messerges, E. A. Dabbish, and R. H. Sloan: Power analysis attacks of modular
exponentiation in smartcards p. 144
- L. Goubin and J. Patarin: DES and differential power analysis p. 158
- P. N. Fahn and P. K. Pearson: IPA: A new class of power attacks p. 173
Invited Talk
- E. von Faber: Security evaluation schemas for the public and private market with a focus on
smart card systems p. 187
True Random Number Generators
- V. Bagini and M. Bucci: A design of reliable true random number generator for cryptographic
- applications p. 204
- D. P. Maher and R. J. Rance: Random number generators founded on signal and information
theory p. 219
Cryptographic Algorithms on FPGAs
- R. R. Taylor and S. C. Goldstein: A high-performance flexible architecture for cryptography
p. 231
- E. Mosanya, C. Teuscher, H. F. Restrepo, P. Galley, and E. Sanchez: CryptoBooster: A
reconfigurable and modular cryptographic coprocessor p. 246
- L. Gao, S. Shrivastava, and G. E. Sobelman: Elliptic curve scalar multiplier design using
FPGAs p. 257
Arithmetic Algorithms II
- H. Wu, M. A. Hasan, and I. F. Blake: Highly regular architectures for finite field
computation using redundant basis p. 269
- H. Wu: Low complexity bit-parallel finite field arithmetic using polynomial basis p. 280
Power Attacks II
- J.-S. Coron: Resistance against differential power analysis for elliptic curve
cryptosystems p. 292
- H. Handschuh, P. Paillier, and J. Stern: Probing attacks on tamper-resistant devices p. 303
Elliptic Curve Implementations
- J. López and R. Dahab: Fast multiplication on elliptic curves over GF(2m) without
precomputation p. 316
New Cryptographic Schemes and Modes of Operation
- M. Hartmann, S. Paulus, and T. Takagi: NICE | New Ideal Coset Encryption p. 328
- O. Jung and C. Ruland: Encryption with statistical self-synchronization in synchronous
broadband networks p. 340
