Non-linear Residue Codes for Robust Public-Key Arithmetic

(Required for Computer Systems Area Graduate Students)

Berk Sunar
Electrical & Computer Engineering Dept.
Worcester Polytechnic Institute, CRIS Lab
Visiting Researcher, Ruhr-Universitat Bochum, COSY Group
Visiting Professor, Dept. of Computer Eng., Bilkent University

Where: Marston 132

When: Thursday, Nov. 30, at 4:00pm


An active side channel attack such as differential fault analysis (DFA) relies on the manifestation of injected faults as erroneous results which can then be observed at the output of the device. There is therefore, an urgent need for a robust error detection scheme. In this talk we present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes are attractive due to their data dependency and asymptotically low probability of missing errors making it nearly impossible for an adversary to successfully inject faults that are missed by the error detection circuit.

Speaker Bio:

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.