International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from CHES 1999

Year
Venue
Title
1999
CHES
A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond
D. Craig Wilcox Lyndon G. Pierson Perry J. Robertson Edward L. Witzke Karl Gass
1999
CHES
A Design of Reliable True Random Number Generator for Cryptographic Applications
Vittorio Bagini Marco Bucci
1999
CHES
A High-Performance Flexible Architecture for Cryptography
R. Reed Taylor Seth Copen Goldstein
1999
CHES
A Scalable Architecture for Montgomery Multiplication
Alexandre F. Tenca Çetin Kaya Koç
1999
CHES
Arithmetic Design for Permutation Groups
Tamás Horváth
1999
CHES
CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor
Emeka Mosanya Christof Teuscher Héctor Fabio Restrepo Patrick Galley Eduardo Sanchez
1999
CHES
DES and Differential Power Analysis (The "Duplication" Method)
Louis Goubin Jacques Patarin
1999
CHES
DES Cracking on the Transmogrifier 2a
Ivan Hamer Paul Chow
1999
CHES
Efficient Finite Field Basis Conversion Involving Dual Bases
Burton S. Kaliski Jr. Moses Liskov
1999
CHES
Elliptic Curve Scalar Multiplier Design Using FPGAs
Lijun Gao Sarvesh Shrivastava Gerald E. Sobelman
1999
CHES
Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks
Oliver Jung Christoph Ruland
1999
CHES
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
Adi Shamir
1999
CHES
Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201
Kouichi Itoh Masahiko Takenaka Naoya Torii Syouji Temma Yasushi Kurihara
1999
CHES
Fast Multiplication in Finite Fields GF(2<sup>N</sup>)
Joseph H. Silverman
1999
CHES
Fast Multiplication on Elliptic Curves over GF(2<sup>m</sup>) without Precomputation
Julio López Ricardo Dahab
1999
CHES
Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton
Eunjong Hong Jai-Hoon Chung Chae Hoon Lim
1999
CHES
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
Huapeng Wu M. Anwarul Hasan Ian F. Blake
1999
CHES
How to Implement Cost-Effective and Secure Public Key Cryptosystems
Pil Joong Lee Eun Jeong Lee Yong Duk Kim
1999
CHES
IPA: A New Class of Power Attacks
Paul N. Fahn Peter K. Pearson
1999
CHES
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
Huapeng Wu
1999
CHES
Modelling the Crypto-Processor from Design to Synthesis
W. P. Choi Lee-Ming Cheng
1999
CHES
Montgomery's Multiplication Technique: How to Make It Smaller and Faster
★Invited paper
Colin D. Walter
1999
CHES
NICE - New Ideal Coset Encryption
Michael Hartmann Sachar Paulus Tsuyoshi Takagi
1999
CHES
Power Analysis Attacks of Modular Exponentiation in Smartcards
Thomas S. Messerges Ezzy A. Dabbish Robert H. Sloan
1999
CHES
Probing Attacks on Tamper-Resistant Devices
Helena Handschuh Pascal Paillier Jacques Stern
1999
CHES
Random Number Generators Founded on Signal and Information Theory
David Paul Maher Robert J. Rance
1999
CHES
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
★ CHES Test of Time Award
Jean-Sébastien Coron
1999
CHES
Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems
★Invited paper
Eberhard von Faber
1999
CHES
We Need Assurance
★Invited paper
Brian D. Snow