FEEDBACK Smiley face
Normal view MARC view ISBD view

Cryptographic Hardware and Embedded Systems [electronic resource] :First InternationalWorkshop, CHES’99 Worcester, MA, USA, August 12–13, 1999 Proceedings /

Contributor(s): Koç, Çetin K [editor.] | Paar, Christof [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 1717Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999.Description: XI, 356 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540480594.Subject(s): Computer science | Computer hardware | Computer communication systems | Special purpose computers | Data encryption (Computer science) | Algorithms | Computer science -- Mathematics | Computer Science | Data Encryption | Computer Hardware | Computer Communication Networks | Special Purpose and Application-Based Systems | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer ScienceOnline resources: Click here to access online
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in