Strong Error Detection Methods For Cryptography
Dr. Berk Sunar
|
Texto completo de la Conferencia
Resumen
In this talk we summarize the error detection techniques proposed for the realization of cryptographic primitives in both hardware and software. We present results based on encoding operands in a representation derived from linear codes. We introduce weak and strong attacker models and associated metrics for capturing the error detection capability of the detection technique. Extensions based on non-linear codes that can withstand strong attackers is presented. Finally a survey summarizing the detection capabilities of proposed codes and associated overheads is given.
Esbozo Curricular
Berk Sunar received his BSc from Middle East Technical University in 1995 and his Ph.D. degree in Electrical and Computer Engineering from Oregon State University in December 1998. He then joined Worcester Polytechnic Institute and is currently an Associate Professor. He is the head of the Cryptography and Information Security Laboratory (CRIS). He organized the Cryptographic Hardware and Embedded Systems Conference (CHES) in 2004, and was the co-editor of CHES 2005. His research interests include tamper-proof and efficient cryptography, finite field and integer arithmetic, and quantum cryptography.
