Cryptographic Hardware and Embedded Systems - CHES 2001 Third International Workshop, Paris, France, May 14-16, 2001 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Koc, Cetin K. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Nacchae, David (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Paar, Christof (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2162
• Θέματα: Data encryption (Computer science).; Computer communication systems.; Special purpose computers.; Logic design.; Management information systems.; Computer science.; Operating systems (Computers).; Cryptology.; Computer Communication Networks.; Special Purpose and Application-Based Systems.; Logic Design.; Management of Computing and Information Systems.; Operating Systems.

These are the proceedings of CHES 2001, the third Workshop on Cryptographic Hardware and Embedded Systems. The ?rst two CHES Workshops were held in Massachusetts, and this was the ?rst Workshop to be held in Europe. There was a large number of submissions this year, and in response the technical pro...

Πίνακας περιεχομένων:

• Invited Talk
• Protecting Embedded Systems- The Next Ten Years
• Side Channel Attacks I
• A Sound Method for Switching between Boolean and Arithmetic Masking
• Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
• Random Register Renaming to Foil DPA
• Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks
• Rijndael Hardware Implementations
• Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm
• High Performance Single-Chip FPGA Rijndael Algorithm Implementations
• Two Methods of Rijndael Implementation in Reconfigurable Hardware
• Random Number Generators
• Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
• Efficient Online Tests for True Random Number Generators
• Elliptic Curve Algorithms
• The Hessian Form of an Elliptic Curve
• Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve
• Generating Elliptic Curves of Prime Order
• Invited Talk
• New Directions in Croptography
• Arithmetic Architectures
• A New Low Complexity Parallel Multiplier for a Class of Finite Fields
• Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
• High-Radix Design of a Scalable Modular Multiplier
• A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
• Cryptanalysis
• Attacks on Cryptoprocessor Transaction Sets
• Bandwidth-Optimal Kleptographic Attacks
• Electromagnetic Analysis: Concrete Results
• Embedded Implementations and New Ciphers
• NTRU in Constrained Devices
• Transparent Harddisk Encryption
• Side Channel Attacks II
• Sliding Windows Succumbs to Big Mac Attack
• Universal Exponentiation Algorithm A First Step towards Provable SPA-Resistance
• An Implementation of DES and AES, Secure against Some Attacks
• Hardware Implementations of Ciphers
• Efficient Implementation of "Large" Stream Cipher Systems
• Tradeoffs in Parallel and Serial Implementations of the International Data Encryption Algorithm IDEA
• A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
• Implementation of RSA Algorithm Based on RNS Montgomery Multiplication
• Side Channel Attacks on Elliptic Curve Cryptosystems
• Protections against Differential Analysis for Elliptic Curve Cryptography - An Algebraic Approach -
• Preventing SPA/DPA in ECC Systems Using the Jacobi Form
• Hessian Elliptic Curves and Side-Channel Attacks.