4. CHES 2002: Redwood Shores, CA, USA

Invited Talk

• Jean-Jacques Quisquater:
  CHES: Past, Present, and Future. 1
  

Attack Strategies

• Sergei P. Skorobogatov, Ross J. Anderson:
  Optical Fault Induction Attacks. 2-12
  
• Suresh Chari, Josyula R. Rao, Pankaj Rohatgi:
  Template Attacks. 13-28
  
• Dakshi Agrawal, Bruce Archambeault, Josyula R. Rao, Pankaj Rohatgi:
  The EM Side-Channel(s). 29-45
  

Finite Field and Modular Arithmetic I

• Shay Gueron:
  Enhanced Montgomery Multiplication. 46-56
  
• Róbert Lórencz:
  New Algorithm for Classical Modular Inverse. 57-70
  
• Wieland Fischer, Jean-Pierre Seifert:
  Increasing the Bitlength of a Crypto-Coprocessor. 71-81
  

Elliptic Curve Cryptography I

• Elisabeth Oswald:
  Enhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems. 82-97
  
• Elena Trichina, Antonio Bellezza:
  Implementation of Elliptic Curve Cryptography with Built-In Counter Measures against Side Channel Attacks. 98-113
  
• Catherine H. Gebotys, Robert J. Gebotys:
  Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor. 114-128
  
• Kouichi Itoh, Tetsuya Izu, Masahiko Takenaka:
  Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA. 129-143
  

AES and AES Candidates

• A. K. Lutz, J. Treichler, Frank K. Gürkaynak, Hubert Kaeslin, G. Basler, Antonia Erni, S. Reichmuth, P. Rommens, Stephan Oetiker, Wolfgang Fichtner:
  2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis. 144-158
  
• Guido Bertoni, Luca Breveglieri, Pasqualina Fragneto, Marco Macchetti, Stefano Marchesin:
  Efficient Software Implementation of AES on 32-Bit Platforms. 159-171
  
• Sumio Morioka, Akashi Satoh:
  An Optimized S-Box Circuit Architecture for Low Power AES Design. 172-186
  
• Elena Trichina, Domenico De Seta, Lucia Germani:
  Simplified Adaptive Multiplicative Masking for AES. 187-197
  
• Jovan Dj. Golic, Christophe Tymen:
  Multiplicative Masking and Power Analysis of AES. 198-212
  

Tamper Resistance

• Andrew Huang:
  Keeping Secrets in Hardware: The Microsoft Xbox™ Case Study. 213-227
  

RSA Implementation

• Bert den Boer, Kerstin Lemke, Guntram Wicke:
  A DPA Attack against the Modular Reduction within a CRT Implementation of RSA. 228-243
  
• Vlastimil Klíma, Tomás Rosa:
  Further Results and Considerations on Side Channel Attacks on RSA. 244-259
  
• Christian Aumüller, Peter Bier, Wieland Fischer, Peter Hofreiter, Jean-Pierre Seifert:
  Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures. 260-275
  

Finite Field and Modular Arithmetic II

• Colin D. Walter:
  Some Security Aspects of the M IST Randomized Exponentiation Algorithm. 276-290
  
• Marc Joye, Sung-Ming Yen:
  The Montgomery Powering Ladder. 291-302
  
• Kouichi Itoh, Jun Yajima, Masahiko Takenaka, Naoya Torii:
  DPA Countermeasures by Improving the Window Method. 303-317
  
• Martijn Stam, Arjen K. Lenstra:
  Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. 318-332
  

Elliptic Curve Cryptography II

• Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis:
  On the Efficient Generation of Elliptic Curves over Prime Fields. 333-348
  
• Nils Gura, Sheueling Chang Shantz, Hans Eberle, Sumit Gupta, Vipul Gupta, Daniel Finchelstein, Edouard Goupy, Douglas Stebila:
  An End-to-End Systems Approach to Elliptic Curve Cryptography. 349-365
  
• Richard Schroeppel, Cheryl L. Beaver, Rita Gonzales, Russell Miller, Timothy Draelos:
  A Low-Power Design for an Elliptic Curve Digital Signature Chip. 366-380
  
• M. Ernst, Michael Jung, Felix Madlener, Sorin A. Huss, Rainer Blümel:
  A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2ⁿ). 381-399
  
• N. Boston, T. Charles Clancy, Y. Liow, J. Webster:
  Genus Two Hyperelliptic Curve Coprocessor. 400-414
  

Random Number Generation

• Viktor Fischer, Milos Drutarovský:
  True Random Number Generator Embedded in Reconfigurable Hardware. 415-430
  
• Werner Schindler, Wolfgang Killmann:
  Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications. 431-449
  
• Thomas E. Tkacik:
  A Hardware Random Number Generator. 450-453
  

Invited Talk

• Sanjay E. Sarma, Stephen A. Weis, Daniel W. Engels:
  RFID Systems and Security and Privacy Implications. 454-469
  

New Primitives

• Alexander Klimov, Adi Shamir:
  A New Class of Invertible Mappings. 470-483
  

Finite Field and Modular Arithmetic II

• Adnan Abdul-Aziz Gutub, Alexandre F. Tenca, Erkay Savas, Çetin Kaya Koç:
  Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2). 484-499
  
• Johannes Wolkerstorfer:
  Dual-Field Arithmetic Unit for GF(p) and GF(2^m). 500-514
  
• Arash Reyhani-Masoleh, M. Anwarul Hasan:
  Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. 515-528
  
• Dan Page, Nigel P. Smart:
  Hardware Implementation of Finite Fields of Characteristic Three. 529-539
  

Elliptic Curve Cryptography III

• Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica:
  Preventing Differential Analysis in GLV Elliptic Curve Scalar Multiplication. 540-550
  
• JaeCheol Ha, Sang-Jae Moon:
  Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks. 551-563
  
• Katsuyuki Okeya, Kouichi Sakurai:
  Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick. 564-578
  

Hardware for Cryptanalysis

• Richard Clayton, Mike Bond:
  Experience Using a Low-Cost FPGA Design to Crack DES Keys. 579-592
  
• François-Xavier Standaert, Gaël Rouvroy, Jean-Jacques Quisquater, Jean-Didier Legat:
  A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results. 593-609
  

Last update Sun May 19 21:50:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page