Cryptographers' World
 

CHES 1999


[Sort by page number] [Sort by citations count]

 
Çetin Kaya KoçChristof Paar, editors, Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99, Worcester, MA, USA, August 12-13, 1999, Proceedings. Springer, 1999. ISBN 3-540-66646-X.
[Papers]

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.



Brian D. Snow,  We Need Assurance, pp. 1 - 1, CHES 1999.

[Electronic Edition][Cited 10 times ]

Adi Shamir,  Factoring Large Numbers with the Twinkle Device (Extended Abstract), pp. 2 - 12, CHES 1999.

[Electronic Edition][Cited 58 times Red Star]

Ivan Hamer,  Paul Chow,  DES Cracking on the Transmogrifier 2a, pp. 13 - 24, CHES 1999.

[Electronic Edition][Cited 11 times ]

W. P. Choi,  Lee-Ming Cheng,  Modelling the Crypto-Processor from Design to Synthesis, pp. 25 - 36, CHES 1999.

[Electronic Edition][Cited 4 times ]

D. Craig Wilcox,  Lyndon G. Pierson,  Perry J. Robertson,  Edward L. Witzke,  Karl Gass,  A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond, pp. 37 - 48, CHES 1999.

[Electronic Edition][Cited 37 times ]

Eunjong Hong,  Jai-Hoon Chung,  Chae Hoon Lim,  Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton, pp. 49 - 60, CHES 1999.

[Electronic Edition][Cited 5 times ]

Kouichi Itoh,  Masahiko Takenaka,  Naoya Torii,  Syouji Temma,  Yasushi Kurihara,  Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201, pp. 61 - 72, CHES 1999.

[Electronic Edition][Cited 77 times Red Star]

Pil Joong Lee,  Eun Jeong Lee,  Yong Duk Kim,  How to Implement Cost-Effective and Secure Public Key Cryptosystems, pp. 73 - 79, CHES 1999.

[Electronic Edition][Cited 5 times ]

Colin D. Walter,  Montgomery's Multiplication Technique: How to Make It Smaller and Faster, pp. 80 - 93, CHES 1999.

[Electronic Edition][Cited 70 times Red Star]

Alexandre F. Tenca,  Ã‡etin Kaya Koç,  A Scalable Architecture for Montgomery Multiplication, pp. 94 - 108, CHES 1999.

[Electronic Edition][Cited 127 times Red StarRed Star]

Tamás Horváth,  Arithmetic Design for Permutation Groups, pp. 109 - 121, CHES 1999.

[Electronic Edition][Cited 1 times ]

Joseph H. Silverman,  Fast Multiplication in Finite Fields GF(2 n), pp. 122 - 134, CHES 1999.

[Electronic Edition][Cited 35 times ]

Burton S. Kaliski Jr.,  Moses Liskov,  Efficient Finite Field Basis Conversion Involving Dual Bases, pp. 135 - 143, CHES 1999.

[Electronic Edition][Cited 6 times ]

Thomas S. Messerges,  Ezzy A. Dabbish,  Robert H. Sloan,  Power Analysis Attacks of Modular Exponentiation in Smartcards, pp. 144 - 157, CHES 1999.

[Electronic Edition][Cited 242 times Red StarRed Star]

Louis Goubin,  Jacques Patarin,  DES and Differential Power Analysis (The "Duplication" Method), pp. 158 - 172, CHES 1999.

[Electronic Edition][Cited 274 times Red StarRed StarRed Star]

Paul N. Fahn,  Peter K. Pearson,  IPA: A New Class of Power Attacks, pp. 173 - 186, CHES 1999.

[Electronic Edition][Cited 58 times Red Star]

Eberhard von Faber,  Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems, pp. 187 - 203, CHES 1999.

[Electronic Edition][No citation]

Vittorio Bagini,  Marco Bucci,  A Design of Reliable True Random Number Generator for Cryptographic Applications, pp. 204 - 218, CHES 1999.

[Electronic Edition][Cited 44 times ]

David Paul Maher,  Robert J. Rance,  Random Number Generators Founded on Signal and Information Theory, pp. 219 - 230, CHES 1999.

[Electronic Edition][Cited 11 times ]

R. Reed Taylor,  Seth Copen Goldstein,  A High-Performance Flexible Architecture for Cryptography, pp. 231 - 245, CHES 1999.

[Electronic Edition][Cited 58 times Red Star]

Emeka Mosanya,  Christof Teuscher,  Héctor Fabio Restrepo,  Patrick Galley,  Eduardo Sanchez,  CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor, pp. 246 - 256, CHES 1999.

[Electronic Edition][Cited 20 times ]

Lijun Gao,  Sarvesh Shrivastava,  Gerald E. Sobelman,  Elliptic Curve Scalar Multiplier Design Using FPGAs, pp. 257 - 268, CHES 1999.

[Electronic Edition][Cited 54 times Red Star]

Huapeng Wu,  M. Anwar Hasan,  Ian F. Blake,  Highly Regular Architectures for Finite Field Computation Using Redundant Basis, pp. 269 - 279, CHES 1999.

[Electronic Edition][Cited 12 times ]

Huapeng Wu,  Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis, pp. 280 - 291, CHES 1999.

[Electronic Edition][Cited 40 times ]

Jean-Sébastien Coron,  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, pp. 292 - 302, CHES 1999.

[Electronic Edition][Cited 504 times Red StarRed StarRed StarRed Star]

Helena Handschuh,  Pascal Paillier,  Jacques Stern,  Probing Attacks on Tamper-Resistant Devices, pp. 303 - 315, CHES 1999.

[Electronic Edition][Cited 30 times ]

Julio López Hernandez,  Ricardo Dahab,  Fast Multiplication on Elliptic Curves over GF(2^m) without Precomputation, pp. 316 - 327, CHES 1999.

[Electronic Edition][Cited 292 times Red StarRed StarRed Star]

Michael Hartmann,  Sachar Paulus,  Tsuyoshi Takagi,  NICE - New Ideal Coset Encryption, pp. 328 - 339, CHES 1999.

[Electronic Edition][Cited 14 times ]

Oliver Jung,  Christoph Ruland,  Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks, pp. 340 - 352, CHES 1999.

[Electronic Edition][Cited 10 times ]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...