Publications of ches 2000

Page	Title
1-24	Software Implementation of Elliptic Curve Cryptography over Binary Fields
25-40	Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
41-56	A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
57-70	Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor
71-77	Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies
78-92	Smartly Analyzing the Simplicity and the Power of Simple Power Analysis on Smartcards
93-108	Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems
109-124	A Timing Attack against RSA with the Chinese Remainder Theorem
125-140	A Comparative Study of Performance of AES Final Candidates Using FPGAs
141-155	A Dynamic FPGA Implementation of the Serpent Block Cipher
156-163	A 12 Gbps DES Encryptor/Decryptor Core in an FPGA
164-174	A 155 Mbps Triple-DES Network Encryptor
175-190	An Energy Efficient Reconfigurable Public-Key Cryptograhpy Processor Architecture
191-203	High-Speed RSA Hardware Based on Barret's Modular Reduction Method
204-215	Data Integrity in Hardware for Modular Arithmetic
216-228	A Design for Modular Exponentiation Coprocessor in Mobile Telecommunication Terminals
229-230	How to Explain Side-Channel Leakage to Your Kids
231-237	On Boolean and Arithmetic Masking against Differential Power Analysis
238-251	Using Second-Order Power Analysis to Attack DPA Resistant Software
252-263	Differential Power Analysis in the Presence of Hardware Countermeasures
264-276	Montgomery Multiplier and Squarer in GF(2m)
277-292	A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
293-301	Montgomery Exponentiation with no Final Subtractions: Improved Results
302-317	Physical Security Devices for Computer Subsystems: A Survey of Attacks and Defences
318-327	Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis
328-339	MiniPASS: Authentication and Digital Signatures in a Constrained Environment
340-354	Efficient Generation of Prime Numbers