Book Volume 2779 2003

Cryptographic Hardware and Embedded Systems - CHES 2003

5th International Workshop, Cologne, Germany, September 8–10, 2003. Proceedings


ISBN: 978-3-540-40833-8 (Print) 978-3-540-45238-6 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talk

    1. Chapter

      Pages 1-1

      The Security Challenges of Ubiquitous Computing

  3. Side Channel Attack Methodology

    1. Chapter

      Pages 2-16

      Multi-channel Attacks

    2. Chapter

      Pages 17-34

      Hidden Markov Model Cryptanalysis

    3. Chapter

      Pages 35-50

      Power-Analysis Attacks on an FPGA – First Experimental Results

  4. Hardware Factorization

    1. Chapter

      Pages 51-61

      Hardware to Solve Sparse Systems of Linear Equations over GF(2)

  5. Symmetric Ciphers: Side Channel Attacks and Countermeasures

    1. Chapter

      Pages 62-76

      Cryptanalysis of DES Implemented on Computers with Cache

    2. Chapter

      Pages 77-88

      A Differential Fault Attack Technique against SPN Structures, with Application to the AES and Khazad

    3. Chapter

      Pages 89-97

      A New Algorithm for Switching from Arithmetic to Boolean Masking

    4. Chapter

      Pages 98-112

      DeKaRT: A New Paradigm for Key-Dependent Reversible Circuits

  6. Secure Hardware Logic

    1. Chapter

      Pages 113-124

      Parity-Based Concurrent Error Detection of Substitution-Permutation Network Block Ciphers

    2. Chapter

      Pages 125-136

      Securing Encryption Algorithms against DPA at the Logic Level: Next Generation Smart Card Technology

    3. Chapter

      Pages 137-151

      Security Evaluation of Asynchronous Circuits

  7. Random Number Generators

    1. Chapter

      Pages 152-165

      Design and Implementation of a True Random Number Generator Based on Digital Circuit Artifacts

    2. Chapter

      Pages 166-180

      True Random Number Generators Secure in a Changing Environment

    3. Chapter

      Pages 181-188

      How to Predict the Output of a Hardware Random Number Generator

  8. Efficient Multiplication

    1. Chapter

      Pages 189-202

      On Low Complexity Bit Parallel Polynomial Basis Multipliers

    2. Chapter

      Pages 203-213

      Efficient Modular Reduction Algorithm in \( \mathbb{F}_q \) [x] and Its Application to “Left to Right” Modular Multiplication in \( \mathbb{F}_2 \) [x]

    3. Chapter

      Pages 214-227

      Faster Double-Size Modular Multiplication from Euclidean Multipliers

  9. More on Efficient Arithmetic

    1. Chapter

      Pages 228-242

      Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods

    2. Chapter

      Pages 243-253

      GCD-Free Algorithms for Computing Modular Inverses

previous Page of 2