Cryptographic Hardware and Embedded Systems : First International Workshop, Ches'99, Worcester, Ma, Usa, August 12-13, 1999, Proceedings

Ches'9 (1999 Worchester, Mass.); Paar, Christof (EDT); Goos, G. (EDT); Hartmanis, J. (EDT); Leeuwen, J. Van (EDT); Koc, Cetin K. (EDT); Koc, Cetin K.; Paar, Christof

ISBN 10: 354066646X / ISBN 13: 9783540666462

Editore: Springer, 1999

Riguardo questo articolo

Codice articolo 918781-n

Dati bibliografici

• Titolo: Cryptographic Hardware and Embedded Systems : First International Workshop, Ches'99, Worcester, Ma, Usa, August 12-13, 1999, Proceedings
• Editore: Springer
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 354066646X
• ISBN 13: 9783540666462
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

These are the proceedings of CHES 99, the rst workshop on Cryptographic Hardware and Embedded Systems. As it becomes more obvious that strong security will be an important part of the next generation of communication, computer, and electronic consumer devices, we felt that a new type of cryp- graphic conference was needed. Our goal was to create a forum which discusses innovative solutions for cryptography in practice. Consequently, the focus of the CHES Workshop is on all aspects of cryptographic hardware and embedded s- tem design. Of special interest were contributions that describe new methods for e cient hardware implementations and high-speed software for embedded s- tems, e. g. , smart cards, microprocessors, or DSPs. We hope that the workshop will help to ll the gap between the cryptography research community and the application areas of cryptography. There were 42 submitted contributions to CHES 99, of which 27 were selected for presentation. All papers were reviewed. In addition, there were three invited speakers. We hope to continue to make the CHES Workshop a forum of intellectual exchange in creating the secure, reliable, and robust security solutions of tom- row. We thank everyone whose involvement made the CHES Workshop such a successful event, and in particular we thank Murat Aydos, Dan Bailey, Br- don Chetwynd, Adam Elbirt, Serdar Erdem, Jorge Guajardo, Linda Looft, Pam O Bryant, Marie Piergallini, Erkay Sava s, and Adam Woodbury. Corvallis, Oregon C etin K.

Contenuti

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.