Title: Verifying ECC Software


Abstract: In the first part of my talk I will give an introduction to 
secure and fast implementations of (elliptic-curve) cryptography. In 
particular I will focus on implementation techniques to eliminate 
side-channel attacks and accelerate finite-field arithmetic, which is 
the core building block for fast elliptic-curve cryptography. In the 
second part I will describe how correctness and timing-attack 
protection can be formally verified. I will describe this from the 
perspective of a cryptographic engineer rather than the perspective of 
a researcher in the area of formal methods.


Bio: Peter Schwabe is an assistant professor at Radboud University 
Nijmegen. He graduated from RWTH Aachen University in computer science 
in 2006 and received a Ph.D. from the Faculty of Mathematics and 
Computer Science of Eindhoven University of Technology in 2011. He 
then worked as a postdoctoral researcher at the Institute for 
Information Science and the Research Center for Information Technology 
Innovation of Academia Sinica, Taiwan and at National Taiwan 
University. His research area is the optimization of cryptographic and 
cryptanalytic algorithms in software. The target architectures of this 
software range from high-end desktop and server CPUs through parallel 
architectures such as the Cell Broadband Engine and graphics 
processing units to embedded processors such as ARM and AVR. He has 
published more than 30 articles in journals and at international 
conferences on fast software for a variety of cryptographic and 
cryptanalytic algorithms.