Cryptographic hardware and embedded systems : First InternationalWorkshop, CHES 99 Worcester, MA, USA, August 12 13, 1999 : proceedings

Enregistré dans:
Détails bibliographiques
Collectivité auteur: International Workshop on Cryptographic Hardware and Embedded Systems :Worcester, Mass.
Autres auteurs: Paar, Christof, 1963- (Directeur de la publication), Koç, Çetin Kaya, 1957- (Directeur de la publication)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 1717
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Cryptographic hardware and embedded systems, First International Workshop, CHES '99, Worchester, MA, USA, August 1999, proceedings, Çetin K. Koç, Christof Paar (eds.), 1999, Berlin, Springer, 1 vol. (XI-352 p.), Lecture notes in computer science, 3-540-66646-X
• Cryptographic Hardware and Embedded Systems, Texte imprimé, 9783662215081
Table des matières:
  • 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.