Pub. Date:
Springer Berlin Heidelberg
Cryptographic Hardware and Embedded Systems: First International Workshop, CHES'99 Worcester, MA, USA, August 12-13, 1999 Proceedings / Edition 1

Cryptographic Hardware and Embedded Systems: First International Workshop, CHES'99 Worcester, MA, USA, August 12-13, 1999 Proceedings / Edition 1

by Cetin K. Koc, Christof Paar


Current price is , Original price is $79.99. You

Temporarily Out of Stock Online

Please check back later for updated availability.


This book constitutes the refereed proceedings of the First Internatio nal Workshop on Cryptographic Hardware and Embedded Systems, CHESF99, held in Worcester, MA, USA in August 1999. The 27 revised papers prese nted together with three invited contributions were carefully reviewed and selected from 42 submissions. The papers are organized in section s on cryptographic hardware, hardware architectures, smartcards and em bedded systems, arithmetic algorithms, power attacks, true random numb ers, cryptographic algorithms on FPGAs, elliptic curve implementations , new cryptographic schemes and modes of operation.

Product Details

ISBN-13: 9783540666462
Publisher: Springer Berlin Heidelberg
Publication date: 11/23/1999
Series: Lecture Notes in Computer Science , #1717
Edition description: 1999
Pages: 356
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Invited Talk.- We Need Assurance.- Cryptanalytic Hardware.- Factoring Large Numbers with the TWINKLE Device.- DES Cracking on the Transmogrifier 2a.- Hardware Architectures.- Modelling the Crypto-Processor from Design to Synthesis.- A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond.- Hardware Design and Performance Estimation of the 128-bit Block Cipher CRYPTON.- Smartcards and Embedded Systems.- Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201.- How to Implement Cost-Effective and Secure Public Key Cryptosystems.- Invited Talk.- Montgomery’s Multiplication Technique: How to Make It Smaller and Faster.- Arithmetic Algorithms I.- A Scalable Architecture for Montgomery Nultiplication.- Arithmetic Design for Permutation Groups.- Fast Multiplication in Finite Fields GF(2n).- Efficient Finite Field Basis Conversion Involving dual bases.- Power Attacks I.- Power Analysis Attacks of Modular Exponentiation in Smartcards.- DES and Differential Power Analysis The “Duplication” Method.- IPA: A New Class of Power Attacks.- Invited Talk.- Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems.- True Random Number Generators.- A Design of Reliable True Random Number Generator for Cryptographic Applications.- Random Number Generators Founded on Signal and Information Theory.- Cryptographic Algorithms on FPGAs.- A High-Performance Flexible Architecture for Cryptography.- CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor.- Elliptic Curve Scalar Multiplier Design Using FPGAs.- Arithmetic Algorithms II.- Highly Regular Architectures for Finite Field Computation Using Redundant Basis.- Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis.- Power Attacks II.- Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems.- Probing Attacks On Tamper-Resistant Devices.- Elliptic Curve Implementations.- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation.- New Cryptographic Schemes and Modes of Operation.- NICE - New Ideal Coset Encryption -.- Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews