3. CHES 2001: Paris, France

Çetin Kaya Koç, David Naccache, Christof Paar (Eds.): Cryptographic Hardware and Embedded Systems - CHES 2001, Third International Workshop, Paris, France, May 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2162 Springer 2001, ISBN 3-540-42521-7

Invited Talk

Louis Goubin:
A Sound Method for Switching between Boolean and Arithmetic Masking. 3-15
Eric Brier, Helena Handschuh, Christophe Tymen:
Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware. 16-27
David May, Henk L. Muller, Nigel P. Smart:
Random Register Renaming to Foil DPA. 28-38
Elisabeth Oswald, Manfred Josef Aigner:
Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks. 39-50

Henry Kuo, Ingrid Verbauwhede:
Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm. 51-64
Máire McLoone, John V. McCanny:
High Performance Single-Chip FPGA Rijndael Algorithm Implementations. 65-76
Viktor Fischer, Milos Drutarovský:
Two Methods of Rijndael Implementation in Reconfigurable Hardware. 77-92

Nick Howgrave-Graham, Joan G. Dyer, Rosario Gennaro:
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor. 93-102
Werner Schindler:
Efficient Online Tests for True Random Number Generators. 103-117

Nigel P. Smart:
The Hessian Form of an Elliptic Curve. 118-125
Katsuyuki Okeya, Kouichi Sakurai:
Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve. 126-141
Erkay Savas, Thomas A. Schmidt, Çetin Kaya Koç:
Generating Elliptic Curves of Prime Order. 142-158

Manuel Leone:
A New Low Complexity Parallel Multiplier for a Class of Finite Fields. 160-170
Atri Rudra, Pradeep K. Dubey, Charanjit S. Jutla, Vijay Kumar, Josyula R. Rao, Pankaj Rohatgi:
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic. 171-184
Alexandre F. Tenca, Georgi Todorov, Çetin Kaya Koç:
High-Radix Design of a Scalable Modular Multiplier. 185-201
Johann Großschädl:
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2^m). 202-219

Mike Bond:
Attacks on Cryptoprocessor Transaction Sets. 220-234
Adam L. Young, Moti Yung:
Bandwidth-Optimal Kleptographic Attacks. 235-250
Karine Gandolfi, Christophe Mourtel, Francis Olivier:
Electromagnetic Analysis: Concrete Results. 251-261

Daniel V. Bailey, Daniel Coffin, Adam J. Elbirt, Joseph H. Silverman, Adam D. Woodbury:
NTRU in Constrained Devices. 262-272
Thomas Pornin:
Transparent Harddisk Encryption. 273-285

Colin D. Walter:
Sliding Windows Succumbs to Big Mac Attack. 286-299
Christophe Clavier, Marc Joye:
Universal Exponentiation Algorithm. 300-308
Mehdi-Laurent Akkar, Christophe Giraud:
An Implementation of DES and AES, Secure against Some Attacks. 309-318

Palash Sarkar, Subhamoy Maitra:
Efficient Implementation of "Large" Stream Cipher Systems. 319-332
Ocean Y. H. Cheung, Kuen Hung Tsoi, Philip Heng Wai Leong, Monk-Ping Leong:
Tradeoffs in Parallel and Serial Implementations of the International Data Encryption Algorithm IDEA. 333-347
Gerardo Orlando, Christof Paar:
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware. 348-363
Hanae Nozaki, Masahiko Motoyama, Atsushi Shimbo, Shin-ichi Kawamura:
Implementation of RSA Algorithm Based on RNS Montgomery Multiplication. 364-376

Marc Joye, Christophe Tymen:
Protections against Differential Analysis for Elliptic Curve Cryptography. 377-390
Pierre-Yvan Liardet, Nigel P. Smart:
Preventing SPA/DPA in ECC Systems Using the Jacobi Form. 391-401
Marc Joye, Jean-Jacques Quisquater:
Hessian Elliptic Curves and Side-Channel Attacks. 402-410

Last update Sat May 18 18:14:25 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page