Publications of ches 1999

Page	Title
1	We Need Assurance
2-12	Factoring Large Numbers with the Twinkle Device (Extended Abstract)
13-24	DES Cracking on the Transmogrifier 2a
25-36	Modelling the Crypto-Processor from Design to Synthesis
37-48	A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond
49-60	Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton
61-72	Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201
73-79	How to Implement Cost-Effective and Secure Public Key Cryptosystems
80-93	Montgomery's Multiplication Technique: How to Make It Smaller and Faster
94-108	A Scalable Architecture for Montgomery Multiplication
109-121	Arithmetic Design for Permutation Groups
122-134	Fast Multiplication in Finite Fields GF(2N)
135-143	Efficient Finite Field Basis Conversion Involving Dual Bases
144-157	Power Analysis Attacks of Modular Exponentiation in Smartcards
158-172	DES and Differential Power Analysis (The "Duplication" Method)
173-186	IPA: A New Class of Power Attacks
187-203	Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems
204-218	A Design of Reliable True Random Number Generator for Cryptographic Applications
219-230	Random Number Generators Founded on Signal and Information Theory
231-245	A High-Performance Flexible Architecture for Cryptography
246-256	CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor
257-268	Elliptic Curve Scalar Multiplier Design Using FPGAs
269-279	Highly Regular Architectures for Finite Field Computation Using Redundant Basis
280-291	Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
292-302	Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
303-315	Probing Attacks on Tamper-Resistant Devices
316-327	Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
328-339	NICE - New Ideal Coset Encryption
340-352	Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks